Publication:3416242
From MaRDI portal
zbMath1155.11306arXivmath/0409420MaRDI QIDQ3416242
Publication date: 19 January 2007
Full work available at URL: https://arxiv.org/abs/math/0409420
Related Items
New applications of the polynomial method: The cap set conjecture and beyond, Non-Malleable Codes from Additive Combinatorics, 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, 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, Subsets of without L-shaped configurations, On pseudo-finite dimensions, Equivalence of polynomial conjectures in additive combinatorics, Growth polynomials for additive quadruples and \((h,k)\)-tuples, Growth in solvable subgroups of \(\mathrm{GL}_r(\mathbb Z/p\mathbb Z)\)., The NOF multiparty communication complexity of composed functions, Near optimal bounds in Freiman's theorem, The structure of popular difference sets, On sets with small doubling property, 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, A tight bound for Green's arithmetic triangle removal lemma in vector spaces, A bilinear Bogolyubov theorem, 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, From Affine to Two-Source Extractors via Approximate Duality, Convolutions of sets with bounded VC-dimension are uniformly continuous