On a conjecture of Marton
A conjecture of K. Marton, widely known as the \textit{polynomial Freiman-Ruzsa conjecture}, in characteristic 2, has many equivalent forms. One form is stated as follows:\N\N\textbf{Conjecture 1}. Suppose that \(A\subseteq \textbf{F}_2^n\) is a set with \(|A+A|\le K|A|\). Then \(A\) is covered by at most \(2K^C\) cosets of some subgroup \(H\le \textbf{F}_2^n\) of size at most \(|A|\).\N\NIn 1999, \textit{I. Z. Ruzsa} [in: Structure theory of set addition. Paris: Société Mathématique de France. 323--326 (1999; Zbl 0946.11007)] obtained an upper bound \(2K^22^{K^4}\) in place of \(2K^C\), which is the first result in this direction. In the converse direction, by analysing the case when \(A\) is a Hamming ball, the constant \(C\) in Conjecture 1 is necessarily at least \(1.46601\). There are many subsequent results on Conjecture 1.\N\NIn this paper, as a main result, the authors confirmed Conjecture 1 with \(C=12\). Other related results are also obtained.
- A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds
- A counterexample to a strong variant of the polynomial Freiman-Ruzsa conjecture in Euclidean space
- A NOTE ON THE FREIMAN AND BALOG–SZEMERÉDI–GOWERS THEOREMS IN FINITE FIELDS
- A note on the polynomial Freĭman-Ruzsa conjecture over \(\mathbb{Z}\)
- Additive combinatorics
- An Elekes-Rónyai theorem for sets with few products
- An equivalence between inverse sumset theorems and inverse conjectures for the \(U^{3}\) norm
- Eine zahlentheoretische Anwendung der Graphentheorie.
- Equivalence of polynomial conjectures in additive combinatorics
- Finding a low-dimensional piece of a set of integers
- Finite field models in additive combinatorics
- Freiman's theorem in finite fields via extremal set theory
- Freiman–Ruzsa-type theory for small doubling constant
- scientific article; zbMATH DE number 1315276 (Why is no real title available?)
- scientific article; zbMATH DE number 5592824 (Why is no real title available?)
- scientific article; zbMATH DE number 5663738 (Why is no real title available?)
- Low-degree tests at large distances
- Marton's conjecture in abelian groups with bounded torsion
- Near optimal bounds in Freiman's theorem
- On additive doubling and energy
- On sums of generating sets in Z₂^n
- On the Bogolyubov-Ruzsa lemma
- On the Freiman theorem in finite fields
- On the size of k-fold sum and product sets of integers
- Query complexity and the polynomial Freiman-Ruzsa conjecture
- Random walks on discrete groups: Boundary and entropy
- Some consequences of the polynomial Freiman-Ruzsa conjecture
- Sumset and Inverse Sumset Theory for Shannon Entropy
- Sumsets and entropy
- Sumsets and entropy revisited
- Szemerédi's regularity lemma revisited
- The structure theory of set addition revisited
- When entropy meets Turán: new proofs and hypergraph Turán results
- Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
- Undecidability of polynomial inequalities in subset densities and additive energies
- Marton's conjecture in abelian groups with bounded torsion
- Locality in sumsets
- On Fourier coefficients of sets with small doubling
- Undecidability of polynomial inequalities in subset densities and additive energies
- On an entropic analogue of additive energy
- Low-degree polynomials are good extractors
This page was built for publication: On a conjecture of Marton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009446)
