Frankl-Füredi type inequalities for polynomial semi-lattices (Q1378521)

Summary: Let \(X\) be an \(n\)-set and \(L\) a set of nonnegative integers. \({\mathcal F}\), a set of subsets of \(X\), is said to be an \(L\)-intersection family if and only if for all \(E \neq F \in {\mathcal F}\), \(|E \cap F |\in L\). A special case of a conjecture of \textit{P. Frankl} and \textit{J. Füredi} [Colloq. Math. Soc. János Bolyai 37, 305-318 (1984; Zbl 0575.05001)]\ states that if \( L = \{1, 2, \dots,k\}\), \(k\) a positive integer, then \(|{\mathcal F}|\leq\sum_{i=0}^{k}\binom{n-1}{i}\). Here \(|{\mathcal F}|\) denotes the number of elements in \({\mathcal F}\). Recently G. V. Ramanan proved this conjecture. We extend his method to polynomial semi-lattices and we also study some special \(L\)-intersection families on polynomial semi-lattices. Finally we prove two modular versions of the Ray-Chaudhuri-Wilson inequality for polynomial semi-lattices.