The Erdős-Rado sunflower problem for vector spaces
A family \(\mathcal{A}\) of sets is called an \(s\)-sunflower (or a \(\Delta(s)\)-system) with kernel \(K\) if \(|\mathcal{A}|= s\) and \(A \cap B = K\) for every \(A, B \in \mathcal{A}\) with \(A \neq B\). Let \(s \geq 3\), and let \(\mathcal{F}\) be a family of \(k\)-element sets such that \(\mathcal{F}\) contains no \(s\)-sunflower. A famous result of \textit{P. Erdős} and \textit{R. Rado} [J. Lond. Math. Soc. 35, 85--90 (1960; Zbl 0103.27901)], referred to as the Sunflower Lemma, states that \(|\mathcal{F}| \leq k!(s-1)^k\). Erdős and Rado [loc. cit.] conjectured that \(|\mathcal{F}| \leq (Cs)^k\) for some constant \(C\). Their bound was improved to \((Ds \log k)^k\) [\textit{T. Bell} et al., Discrete Math. 344, No. 7, Article ID 112367, 3 p. (2021; Zbl 1466.05204)], where \(D\) is a constant, following a breakthrough of \textit{R. Alweiss} et al. [Ann. Math. (2) 194, No. 3, 795--815 (2021; Zbl 1479.05343)].\N\NThis paper provides an analogue of the Sunflower Lemma for vector spaces. Let \(q\) be a prime power, and let \(F\) be a \(q\)-element field. Let \(\mathcal{S}\) be a set of vector spaces over \(F\). If \(\dim \left(\sum_{S \in \mathcal{S}} S \right) = \sum_{S \in \mathcal{S}} \dim (S)\), then \(\mathcal{S}\) is said to be in general position. If \(K\) is a vector space over \(F\), \(S \cap T = K\) for every \(S, T \in \mathcal{S}\) with \(S \neq T\), and \(\{S/K \colon S \in \mathcal{S}\}\) is in general position, then \(\mathcal{S}\) is said to be an \(s\)-sunflower with kernel \(K\). Let \(s \geq 3\) and \(k \geq 2\), and let \(\mathcal{F}\) be a set of \(k\)-dimensional vector spaces over \(F\) such that \(\mathcal{F}\) contains no \(s\)-sunflower. The authors show that \(|\mathcal{F}| \leq \left( \frac{q}{q-1} \right)^k q^{(s-1)\binom{k+1}{2} - k}\). They also show that if \(\mathcal{F}\) is of maximum size, then \(|\mathcal{F}| \geq q^{(s-1)\binom{k+1}{2} - k}\) if \(s \geq k+1\), and \(|\mathcal{F}| \geq q^{(s-2)\binom{k+1}{2} - k}\) if \(s \leq k\).
- A Rank-Metric Approach to Error Control in Random Network Coding
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Equidistant codes in the Grassmannian
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- Improved bounds for the sunflower lemma
- Intersection Theorems for Systems of Sets
- Note on sunflowers
- On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
This page was built for publication: The Erdős-Rado sunflower problem for vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887507)
