Freiman's Theorem in Finite Fields via Extremal Set Theory
From MaRDI portal
Publication:3557495
DOI10.1017/S0963548309009821zbMath1254.11093arXivmath/0703668OpenAlexW2152351539MaRDI 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
Extremal set theory (05D05) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Inverse problems of additive number theory, including sumsets (11P70) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (16)
On Sums of Generating Sets in ℤ2n ⋮ Equivalence of polynomial conjectures in additive combinatorics ⋮ Growth polynomials for additive quadruples and \((h,k)\)-tuples ⋮ The Freiman-Ruzsa theorem over finite fields ⋮ The structure theory of set addition revisited ⋮ A product version of the Erdős-Ko-Rado theorem ⋮ Roth's theorem in many variables ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ On the Freiman theorem in finite fields ⋮ A generalization of a theorem of Rothschild and van Lint ⋮ On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support ⋮ A generalization of a theorem of Rothschild and van Lint ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ SMALL DOUBLING IN ORDERED GROUPS ⋮ An Additive Combinatorics Approach Relating Rank to Communication Complexity ⋮ A statistical approach to covering lemmas
Cites Work
This page was built for publication: Freiman's Theorem in Finite Fields via Extremal Set Theory
