New applications of the polynomial method: The cap set conjecture and beyond
From MaRDI portal
Publication:4562036
DOI10.1090/bull/1648zbMath1434.11033OpenAlexW2895170202WikidataQ123209432 ScholiaQ123209432MaRDI QIDQ4562036
Publication date: 14 December 2018
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/bull/1648
Related Items (8)
Interview with Larry Guth ⋮ Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\) ⋮ Exponentially larger affine and projective caps ⋮ Stability of the Levi-Civita tensors and an Alon-Tarsi type theorem ⋮ The cap set problem and standard diagrams ⋮ Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles ⋮ On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero ⋮ Tensor slice rank and Cayley's first hyperdeterminant
Uses Software
Cites Work
- Hilbertian fields and Galois representations
- Variants of the Selberg sieve, and bounded intervals containing many primes
- A remark on matrix rigidity
- Complexity of linear circuits and geometry
- On certain other sets of integers
- On sunflowers and matrix multiplication
- Using elimination theory to construct rigid matrices
- 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
- A new proof of the graph removal lemma
- On Roth's theorem on progressions
- A note on matrix rigidity
- Busy beaver competition and Collatz-like problems
- Character-free approach to progression-free sets
- Le geometrie di Galois
- Roth's theorem in the primes
- Roth's theorem in \(\mathbb Z^n_4\)
- Matrix multiplication via arithmetic progressions
- Roth's theorem on progressions revisited
- Maximal caps in \(\mathrm{AG}(6,3)\).
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- On subsets of abelian groups with no 3-term arithmetic progression
- Factoring integers with elliptic curves
- A density version of a geometric Ramsey theorem
- On the combinatorial problems which I would most like to see solved
- On the largest prime factors of \(n\) and \(n+1\)
- Combinatorial properties of systems of sets
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Improved lower bounds on the rigidity of Hadamard matrices
- Maximal three-independent subsets of \(\{0,1,2\}^ n\)
- The card game SET.
- Progression-free sets in finite abelian groups.
- Extensions of generalized product caps
- On the rigidity of Vandermonde matrices
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
- An improved construction of progression-free sets
- The classification of the largest caps in AG(5, 3)
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- Prime numbers and computer methods for factorization.
- A lattice point problem and additive number theory
- Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012
- On triples in arithmetic progression
- Integer factoring
- Roth's theorem in many variables
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method
- The primes contain arbitrarily long arithmetic progressions
- Bounded gaps between primes
- Finite field models in arithmetic combinatorics -- ten years on
- Gaussian elimination is not optimal
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Integer sets containing no arithmetic progressions
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS
- New bounds on cap sets
- Fast Matrix Multiplication
- Sárközy's Theorem in Function Fields
- A Note on Elkin’s Improvement of Behrend’s Construction
- On the size of Kakeya sets in finite fields
- Extremal Combinatorics
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Intersection Theorems for Systems of Sets
- Complexity Lower Bounds using Linear Algebra
- Powers of tensors and fast matrix multiplication
- Geometry and the complexity of matrix multiplication
- The Mathematical Coloring Book
- Integer Sets Containing No Arithmetic Progressions
- A Method of Factoring and the Factorization of F 7
- On sets of integers containing k elements in arithmetic progression
- On the distribution of primes in short intervals
- The Algorithmic Aspects of the Regularity Lemma
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On cap sets and the group-theoretic approach to matrix multiplication
- Sumsets as unions of sumsets of subsets
- The growth rate of tri-colored sum-free sets
- Proof of a conjecture of Kleinberg-Sawin-Speyer
- Combinatorics and linear algebra of Freiman's isomorphism
- Probabilistic rank and matrix rigidity
- Further Limitations of the Known Approaches for Matrix Multiplication
- Matrix rigidity and the Croot-Lev-Pach lemma
- A DISTRIBUTION ON TRIPLES WITH MAXIMUM ENTROPY MARGINAL
- Improving Roth's Theorem in the Primes
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Multiplying matrices faster than coppersmith-winograd
- Erdős and Arithmetic Progressions
- New Lower Bounds for the Rank of Matrix Multiplication
- On sets of integers containing no four elements in arithmetic progression
- Ein Extremalproblem für Gitterpunkte.
- On Some Sequences of Integers
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- An inverse theorem for the Gowers \(U^{s+1}[N\)-norm]
- Small gaps between primes
- Theory and Applications of Models of Computation
- Unsolved problems in number theory
- Large caps in small spaces
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New applications of the polynomial method: The cap set conjecture and beyond
