NEAR OPTIMAL BOUNDS IN FREIMAN'S THEOREM

被引：31
|
作者：
Schoen, Tomasz [1 ]
机构：
[1] Adam Mickiewicz Univ, Fac Math & Comp Sci, PL-61614 Poznan, Poland
来源：
DUKE MATHEMATICAL JOURNAL | 2011年 / 158卷 / 01期
关键词：
LONG ARITHMETIC PROGRESSIONS; SUMSETS; SETS; PROOF; ERDOS;
D O I：
10.1215/00127094-1276283
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that if for a finite set A of integers we have vertical bar A + A vertical bar <= K vertical bar A vertical bar, then A is contained in a generalized arithmetic progression of dimension at most K1+C(log K)-1/2 and of size at most exp(K1+C(log K)-1/2)vertical bar A vertical bar for some absolute constant C. We also discuss a number of applications of this result.
引用
收藏
页码：1 / 12
页数：12
相关论文
共 50 条
  • [41] A FREIMAN-TYPE THEOREM FOR LOCALLY COMPACT ABELIAN GROUPS
    Sanders, Tom
    ANNALES DE L INSTITUT FOURIER, 2009, 59 (04) : 1321 - 1335
  • [42] A strengthening of Freiman's 3k-4$3k-4$ theorem
    Bollobas, Bela
    Leader, Imre
    Tiba, Marius
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2023, 55 (05) : 2363 - 2381
  • [43] Near-Optimal Generalisations of a Theorem of Macbeath
    Mustafa, Nabil H.
    Ray, Saurabh
    31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 578 - 589
  • [44] A model-theoretic note on the Freiman-Ruzsa theorem
    Martin-Pizarro, Amador
    Palacin, Daniel
    Wolf, Julia
    SELECTA MATHEMATICA-NEW SERIES, 2021, 27 (04):
  • [45] Effective bounds for Nori's connectivity theorem
    Braun, R
    MullerStach, S
    HIGHER DIMENSIONAL COMPLEX VARIETIES, 1996, : 83 - 88
  • [46] Effective bounds for Nori's connectivity theorem
    Nagel, J
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1998, 327 (02): : 189 - 192
  • [47] SCHAUDER'S THEOREM AND THE METHOD OF A PRIORI BOUNDS
    Granas, Andrzej
    Frigon, Marlene
    TOPOLOGICAL METHODS IN NONLINEAR ANALYSIS, 2018, 52 (01) : 99 - 109
  • [48] Ordinal recursive bounds for Higman's theorem
    Cichon, EA
    Bittar, ET
    THEORETICAL COMPUTER SCIENCE, 1998, 201 (1-2) : 63 - 84
  • [49] Sharp bounds for a discrete John's theorem
    van Hintum, Peter
    Keevash, Peter
    COMBINATORICS PROBABILITY & COMPUTING, 2024,
  • [50] Asymptotic bounds for Nori's Connectivity Theorem
    Otwinowska, A
    JOURNAL OF ALGEBRAIC GEOMETRY, 2005, 14 (04) : 643 - 661
12345