A step beyond Freiman's theorem for set addition modulo a prime (Q2199684): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.5802/jtnb.1122 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.5802/JTNB.1122 / rank
 
Normal rank

Latest revision as of 11:08, 17 December 2024

scientific article
Language Label Description Also known as
English
A step beyond Freiman's theorem for set addition modulo a prime
scientific article

    Statements

    A step beyond Freiman's theorem for set addition modulo a prime (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2020
    0 references
    A well-known \(3k-4\) theorem of \textit{G. A. Freĭman} [Izv. Vyssh. Uchebn. Zaved., Mat. 1964, No. 6(43), 168--178 (1964; Zbl 0201.37504)] says that any finite subset of integers \(A\) with \(|A+A| \le 3|A|-4\) is contained in an arithmetic progression of length at most \(|A+A|-|A|+1\). This is an optimal result in the sense that the constants \(3\) and \(4\) cannot be changed but the question is open in the case of the group \(\mathbb{Z}/p\mathbb{Z}\), where \(p\) is a prime. Namely, Freiman showed the same for \(A \subseteq \mathbb{Z}/p\mathbb{Z}\) with \(|A+A| \le 2.4|A|-3\) but the constant \(2.4\) is believed to be increased. The main result of this paper is Theorem. Let \(p\) be a prime number and let \(A\subset \mathbb{Z}/p\mathbb{Z}\) be a set with \(|A+A| \le 2.48|A|-7\) and \(|A| <p/10^{10}\). Then there is an arithmetic progression \(P \subset \mathbb{Z}/p\mathbb{Z}\) such that \(A \subseteq P\) and \(|P| \le |A+A|-|A|+1\).
    0 references
    additive combinatorics
    0 references
    sumset
    0 references
    small doubling
    0 references
    inverse result
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references