2000 character limit reached
A Polynomial Improvement of Naslund--Sawin Bound for Sunflower-Free Families Using Triangular Tensors
Published 29 Jun 2026 in math.CO | (2606.30593v1)
Abstract: Naslund and Sawin used the slice-rank method for diagonal tensors to prove that $$|\mathcal{F}|=O!\left(n{1/2}\left(\frac{3}{2{2/3}}\right)n\right)$$ for any sunflower-free family $\mathcal{F}\subseteq 2{[n]}$. We prove a lemma similar to the slice-rank lemma for the newly defined $i$-triangular tensors, and use it to achieve a polynomial-factor improvement of the bound of Naslund and Sawin by proving that $$|\mathcal{F}|=O!\left(n{1/6}\left(\frac{3}{2{2/3}}\right)n\right)$$ for any sunflower-free family $\mathcal{F}\subseteq 2{[n]}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.