On large subsets of F_q^n with no three-term arithmetic progression
From MaRDI portal
Publication:509700
Abstract: In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of with no three terms in arithmetic progression by with . For , the problem of finding the largest subset with no three terms in arithmetic progression is called the `cap problem'. Previously the best known upper bound for the cap problem, due to Bateman and Katz, was .
Recommendations
- New bounds on cap sets
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\)
- On the maximal number of 3-term arithmetic progressions in subsets of ℤ/p ℤ
- Three-term arithmetic progressions in subsets of \(\mathbf{F}_q^\infty\) of large Fourier dimension
Cites work
- A course on large deviations with an introduction to Gibbs measures
- A density version of a geometric Ramsey theorem
- Extensions of generalized product caps
- New bounds on cap sets
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
Cited in
(only showing first 100 items - show all)- Popular differences for right isosceles triangles
- On arithmetic progressions in symmetric sets in finite field model
- scientific article; zbMATH DE number 7564426 (Why is no real title available?)
- On an almost all version of the Balog-Szemerédi-Gowers theorem
- A Gap in the Subrank of Tensors
- Caps and wickets
- Using graphs and games to generate cap set bounds
- scientific article; zbMATH DE number 7731180 (Why is no real title available?)
- Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor
- On approximability of satisfiable k-CSPs. II
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Sharp Effective Finite-Field Nullstellensatz
- On the Harborth constant of \(C_3 \oplus C_{3p}\)
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Sumsets as unions of sumsets of subsets
- Interview with Yufei Zhao
- The Kelley-Meka bounds for sets free of three-term arithmetic progressions
- On the maximal number of 3-term arithmetic progressions in subsets of ℤ/p ℤ
- On subsets of the hypercube with prescribed Hamming distances
- Universal points in the asymptotic spectrum of tensors
- Mathematical reasoning and the computer
- Some bounds arising from a polynomial ideal associated to any \(t\)-design
- \textsc{Superset}: A (super)natural variant of the card game \textsc{Set}
- Odd-sunflowers
- Relative rank and regularization
- How many cards should you lay out in a game of \textit{EvenQuads}: a detailed study of caps in \(\mathrm{AG}(n, 2)\)
- On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns
- \(G\)-stable rank of symmetric tensors and log canonical threshold
- Avoiding intersections of given size in finite affine spaces \(\operatorname{AG}(n,2)\)
- Notions of tensor rank
- Transcendence of polynomial canonical heights
- Exposé Bourbaki 1196 : Recent progress on bounds for sets with no three terms in arithmetic progression (after Bloom and Sisask, Croot, Lev, and Pach, and Ellenberg and Gijswijt)
- Three-term arithmetic progressions in subsets of \(\mathbf{F}_q^\infty\) of large Fourier dimension
- A robust version of Hegedűs's lemma, with applications
- Partial Degeneration of Tensors
- Subrank and optimal reduction of scalar multiplications to generic tensors
- Weighted slice rank and a minimax correspondence to Strassen's spectra
- Evasive sets, covering by subspaces, and point-hyperplane incidences
- What is the point of computers? A question for pure mathematicians
- Bounds on the higher degree Erdős-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\)
- Avoiding right angles and certain Hamming distances
- A recursive Lovász theta number for simplex-avoiding sets
- Tensor slice rank and Cayley's first hyperdeterminant
- Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method
- Sidon sets and 2-caps in \(\mathbb{F}_3^n\)
- On cap sets and the group-theoretic approach to matrix multiplication
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
- Demicaps in \(\mathrm{AG}(4,3)\) and maximal cap partitions
- Exponentially larger affine and projective caps
- Multicolour sunflowers
- Monochromatic equilateral triangles in the unit distance graph
- Sunflowers and quasi-sunflowers from randomness extractors
- Caps and progression-free sets in \(\mathbb{Z}_m^n\)
- A gap in the slice rank of \(k\)-tensors
- New bounds on cap sets
- Subsets without \(q\)-separation and binomial products of Fibonacci numbers
- A Sauer-Shelah-Perles lemma for sumsets
- Four‐term progression free sets with three‐term progressions in all large subsets
- On the strength of general polynomials
- Arithmetic progressions in multiplicative groups of finite fields
- Exponential bounds for the Erdős-Ginzburg-Ziv constant
- The sum of nonsingular matrices is often nonsingular
- Improved bounds for progression-free sets in \(C_8^n\)
- Solving linear equations in a vector space over a finite field
- The asymptotic induced matching number of hypergraphs: balanced binary strings
- scientific article; zbMATH DE number 7561763 (Why is no real title available?)
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- An analogue of Ruzsa's conjecture for polynomials over finite fields
- Sets avoiding six-term arithmetic progressions in \(\mathbb{Z}_6^n\) are exponentially small
- Removal lemmas and approximate homomorphisms
- Bounds on affine caps
- On the cardinality spectrum and the number of Latin bitrades of order 3
- Frames over finite fields: basic theory and equiangular lines in unitary geometry
- Barriers for fast matrix multiplication from irreversibility
- Improved bound in Roth's theorem on arithmetic progressions
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles
- The cap set problem and standard diagrams
- On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\)
- Approximately strongly regular graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Bounds on upper transversals in hypergraphs
- A framework for constructing sets without configurations
- On explicit constructions of designs
- Bounds for matchings in nonabelian groups
- The analytic rank of tensors and its applications
- Near-sunflowers and focal families
- On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
- Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
- Proof of a conjecture of Kleinberg-Sawin-Speyer
- The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- Two remarks on the vectorization problem
- A new exponential upper bound for the Erd\H{o}s-Ginzburg-Ziv constant
- Further limitations of the known approaches for matrix multiplication
- An asymptotically tight bound for the Davenport constant
- Limits on the universal method for matrix multiplication
- Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions
- Occurrence of right angles in vector spaces over finite fields
This page was built for publication: On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509700)
