On a conjecture of Marton (Q7009446)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8014495
Language Label Description Also known as
default for all languages
No label defined
    English
    On a conjecture of Marton
    scientific article; zbMATH DE number 8014495

      Statements

      On a conjecture of Marton (English)
      0 references
      0 references
      0 references
      0 references
      20 March 2025
      0 references
      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.
      0 references
      0 references
      sumsets
      0 references
      doubling
      0 references
      Freiman's theorem
      0 references
      additive combinatorics
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references