Freiman's Theorem in Finite Fields via Extremal Set Theory
From MaRDI portal
Publication:3557495
DOI10.1017/S0963548309009821zbMath1254.11093arXivmath/0703668MaRDI QIDQ3557495
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0703668
05D05: Extremal set theory
11T30: Structure theory for finite fields and commutative rings (number-theoretic aspects)
11P70: Inverse problems of additive number theory, including sumsets
11B30: Arithmetic combinatorics; higher degree uniformity
Related Items
The structure theory of set addition revisited, SMALL DOUBLING IN ORDERED GROUPS, An Additive Combinatorics Approach Relating Rank to Communication Complexity, Equivalence of polynomial conjectures in additive combinatorics, Growth polynomials for additive quadruples and \((h,k)\)-tuples, A product version of the Erdős-Ko-Rado theorem, Roth's theorem in many variables, On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support, A statistical approach to covering lemmas, The Freiman-Ruzsa theorem over finite fields, Finite field models in arithmetic combinatorics -- ten years on, On the Freiman theorem in finite fields, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, On Sums of Generating Sets in ℤ2n
Cites Work