Finite field models in additive combinatorics

MaRDI QIDQ3416242zbMATH OpenFDO

Authors Ben Green

Publication date 19 January 2007

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

Mathematics Subject Classification ID

Extremal set theory (05D05) Arithmetic combinatorics; higher degree uniformity (11B30)

Recommendations

• Finite field models in arithmetic combinatorics -- ten years on
• Additive combinatorics over finite fields: new results and applications
• On arithmetic progressions in symmetric sets in finite field model
• \(\mathbb F_p\) is locally like \(\mathbb C\)
• scientific article; zbMATH DE number 5219598

Cited in

(51)

• A tight bound for Green's arithmetic triangle removal lemma in vector spaces
• A bilinear Bogolyubov theorem
• Additive relations in fields: an entropy approach
• On the Gowers norms of certain functions
• Characterizations of democratic systems of translates on locally compact abelian groups
• Caps and progression-free sets in \(\mathbb{Z}_m^n\)
• The-square-and-add Markov chain
• On arithmetic progressions in symmetric sets in finite field model
• Bounds in Cohen's idempotent theorem
• Product set estimates for non-commutative groups
• The Littlewood-Gowers problem
• Finite field models in arithmetic combinatorics -- ten years on
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Generalizations of Fourier analysis, and how to apply them
• Convolutions of sets with bounded VC-dimension are uniformly continuous
• A combinatorial model for reversible rational maps over finite fields
• From affine to two-source extractors via approximate duality
• On pseudo-finite dimensions
• Equivalence of polynomial conjectures in additive combinatorics
• Growth polynomials for additive quadruples and (h,k)-tuples
• New applications of the polynomial method: the cap set conjecture and beyond
• Non-Malleable Codes from Additive Combinatorics
• Growth in solvable subgroups of \(\mathrm{GL}_r(\mathbb Z/p\mathbb Z)\).
• The NOF multiparty communication complexity of composed functions
• Bootstrapping partition regularity of linear systems
• The Erdős-Moser sum-free set problem
• Popular progression differences in vector spaces II
• Semicontinuity of structure for small sumsets in compact abelian groups
• Near optimal bounds in Freiman's theorem
• Additive combinatorics over finite fields: new results and applications
• An additive combinatorics approach relating rank to communication complexity
• Communication lower bounds using directional derivatives
• From harmonic analysis to arithmetic combinatorics
• Popular differences for matrix patterns
• On higher-order Fourier analysis in characteristic p
• The structure of popular difference sets
• Subsets of without L-shaped configurations
• On sets with small doubling property
• Bounds in a popular multidimensional nonlinear Roth theorem
• A note on lower bounds in Szemerédi's theorem with random differences
• Some new results on the higher energies
• On Fourier coefficients of sets with small doubling
• On off-diagonal Ramsey numbers for vector spaces over \(\mathbb{F}_2\)
• Improved bounds for skew corner-free sets
• On a conjecture of Marton
• Sumsets and entropy revisited
• Sumsets in the hypercube
• Testing sumsets is hard
• The critical number of dense triangle-free binary matroids
• Quadratic uniformity of the Möbius function
• On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions

This page was built for publication: Finite field models in additive combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416242)