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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1805.12374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets with small sumset in the circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial bound in Freiman's theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A STEP BEYOND KNESER'S THEOREM FOR ABELIAN FINITE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3847481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On doubling and volume: chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: SETS WITH SMALL SUMSET AND RECTIFICATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Freiman's theorem in an arbitrary abelian group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the critical pair theory in Z/pZ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Freiman's inverse problem with small doubling property / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small sumsets in an abelian group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On addition of two distinct sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized arithmetical progressions and sumsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Appendix to `Roth's theorem on progressions revisited' by J. Bourgain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near optimal bounds in Freiman's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Critical Pairs of Subsets of a Group of Prime Order / rank
 
Normal rank

Revision as of 14:02, 23 July 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