Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method

DOI10.1016/J.JCTA.2019.06.001zbMath1421.05027arXiv1806.05303OpenAlexW2953863565WikidataQ127623794 ScholiaQ127623794MaRDI QIDQ2326330

Yanyan Li

Publication date: 7 October 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

finite geometrypolynomial methodaffine capsfunction rank

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (4)

New applications of the polynomial method: The cap set conjecture and beyond ⋮ Exponentially larger affine and projective caps ⋮ How many cards should you lay out in a game of \textit{EvenQuads}: a detailed study of caps in \(\mathrm{AG}(n, 2)\) ⋮ Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$

Cites Work

• Unnamed Item
• 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
• Maximal caps in \(\mathrm{AG}(6,3)\).
• Extensions of generalized product caps
• On \(k\)-caps in \(\mathrm{PG}(n, q)\), with \(q\) even and \(n \geq 4\)
• The classification of the largest caps in AG(5, 3)
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• New bounds on cap sets

This page was built for publication: Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method