UPPER BOUNDS FOR SUNFLOWER-FREE SETS

DOI10.1017/FMS.2017.12zbMath1366.05113arXiv1606.09575OpenAlexW2963589591MaRDI QIDQ5280253

Eric Naslund, William F. Sawin

Publication date: 20 July 2017

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.09575

zbMATH Keywords

matrix multiplicationsunflower conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial aspects of packing and covering (05B40)

Related Items (16)

The analytic rank of tensors and its applications ⋮ Multicolour Sunflowers ⋮ An improved upper bound for the size of a sunflower-free family ⋮ Exponential bounds for the Erdős-Ginzburg-Ziv constant ⋮ The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\) ⋮ A Gap in the Subrank of Tensors ⋮ Near-sunflowers and focal families ⋮ Bounds on the higher degree Erdős-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\) ⋮ Geometric rank and linear determinantal varieties ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Monochromatic equilateral triangles in the unit distance graph ⋮ A gap in the slice rank of \(k\)-tensors ⋮ Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles ⋮ Unnamed Item ⋮ Improved bounds for the sunflower lemma ⋮ Tensor slice rank and Cayley's first hyperdeterminant

Cites Work

• Unnamed Item
• On sunflowers and matrix multiplication
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Combinatorial properties of systems of sets
• Intersection Theorems for Systems of Sets
• On cap sets and the group-theoretic approach to matrix multiplication

This page was built for publication: UPPER BOUNDS FOR SUNFLOWER-FREE SETS