Intersection problems and a correlation inequality for integer sequences

Peter Frankl, Andrey Kupavskii

Let us consider a collection $\mathcal{G}$ of codewords of length $n$ over an alphabet of size $s$. Let $t_1,\dots ,t_s$ be nonnegative integers. What is the maximum of $|\mathcal…