\(L\)-balancing families (Q2116371)

Let \(2^{[n]}\) denote the power set of \([n]=\{1, 2, \ldots, n\}\) and \(\binom{[n]}{d}\) denote the family of all \(d\)-element subsets of \([n]\). Let \(p\) be a prime number and \(L \subseteq [p-1]\) be a given subset. \(\mathcal{F} \subseteq 2^{[2p]}\) is defined to be an \(L\)-balancing family by the author if for each \(F \in \binom{[2p]}{p}\) there exists a \(G \subseteq [2p]\) such that \(\vert F \cap G\vert \in L\). The main result of this paper is the following lower bound: \(\vert \mathcal{F}\vert \geq p/\vert L\vert \).