New bounds on cap sets
From MaRDI portal
Publication:2879894
DOI10.1090/S0894-0347-2011-00725-XzbMath1262.11010arXiv1101.5851WikidataQ60568643 ScholiaQ60568643MaRDI QIDQ2879894
Michael Bateman, Nets Hawk Katz
Publication date: 5 April 2012
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.5851
Other combinatorial number theory (11B75) Finite fields and commutative rings (number-theoretic aspects) (11T99) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (33)
The analytic rank of tensors and its applications ⋮ Logarithmic bounds for Roth's theorem via almost-periodicity ⋮ Unnamed Item ⋮ Some Properties of Lower Level-Sets of Convolutions ⋮ Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\) ⋮ A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ On sunflowers and matrix multiplication ⋮ The \(G\)-stable rank for tensors and the cap set problem ⋮ Some new results on higher energies ⋮ Sunflowers and testing triangle-freeness of functions ⋮ Improved bounds for progression-free sets in \(C_8^n\) ⋮ Growth polynomials for additive quadruples and \((h,k)\)-tuples ⋮ Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\) ⋮ Exponentially larger affine and projective caps ⋮ The Kelley-Meka bounds for sets free of three-term arithmetic progressions ⋮ Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory ⋮ The NOF multiparty communication complexity of composed functions ⋮ 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 ⋮ Caps and progression-free sets in \(\mathbb{Z}_m^n\) ⋮ ADDITIVE DIMENSION AND A THEOREM OF SANDERS ⋮ A subexponential upper bound for van der Waerden numbers \(W(3,k)\) ⋮ ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS ⋮ On the missing log in upper tail estimates ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ Improved bound in Roth's theorem on arithmetic progressions ⋮ ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING ⋮ Energies and structure of additive sets ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method ⋮ MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS ⋮ Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$
Cites Work
- Unnamed Item
- Unnamed Item
- Near optimal bounds in Freiman's theorem
- A probabilistic technique for finding almost-periods of convolutions
- On Roth's theorem on progressions
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- On Additive Doubling and Energy
- A Note on Freĭman's Theorem in Vector Spaces
- On sets of large trigonometric sums
- Structure in Sets with Logarithmic Doubling
This page was built for publication: New bounds on cap sets
