On certain other sets of integers (Q351354): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Let \(A\subset\{1, \ldots, N\}\) be a set of integers without non-trivial arithmetic progressions of length \(3\). Then \[ |A|=O\left(\frac{N}{(\log N)^{3/4-o(1)}}\right). \] The problem of estimating an upper bound on \(|A|\) goes back to Erdős and Turán, and was for example studied by Roth, Heath-Brown, Szemerédi, and Bourgain. The author refines the work of \textit{J. Bourgain} [J. Anal. Math. 104, 155-192 (2008; Zbl 1155.11011)], where a resampling technique was introduced. Here it is shown that several density increment steps are (in some sense) independent, so that they can be more efficiently treated simultaneously. The author has meanwhile significantly improved the upper bound to \[ |A|= O\left(\frac{N(\log \log N)^5}{\log N}\right) \] [Ann. Math. (2) 174, No. 1, 619--636 (2011; Zbl 1264.11004)].
Property / review text: Let \(A\subset\{1, \ldots, N\}\) be a set of integers without non-trivial arithmetic progressions of length \(3\). Then \[ |A|=O\left(\frac{N}{(\log N)^{3/4-o(1)}}\right). \] The problem of estimating an upper bound on \(|A|\) goes back to Erdős and Turán, and was for example studied by Roth, Heath-Brown, Szemerédi, and Bourgain. The author refines the work of \textit{J. Bourgain} [J. Anal. Math. 104, 155-192 (2008; Zbl 1155.11011)], where a resampling technique was introduced. Here it is shown that several density increment steps are (in some sense) independent, so that they can be more efficiently treated simultaneously. The author has meanwhile significantly improved the upper bound to \[ |A|= O\left(\frac{N(\log \log N)^5}{\log N}\right) \] [Ann. Math. (2) 174, No. 1, 619--636 (2011; Zbl 1264.11004)]. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Christian Elsholtz / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11B25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11B30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6186963 / rank
 
Normal rank
Property / zbMATH Keywords
 
arithmetic progressions
Property / zbMATH Keywords: arithmetic progressions / rank
 
Normal rank
Property / zbMATH Keywords
 
density increment
Property / zbMATH Keywords: density increment / rank
 
Normal rank
Property / zbMATH Keywords
 
Bohr sets
Property / zbMATH Keywords: Bohr sets / rank
 
Normal rank

Revision as of 09:28, 28 June 2023

scientific article
Language Label Description Also known as
English
On certain other sets of integers
scientific article

    Statements

    On certain other sets of integers (English)
    0 references
    0 references
    11 July 2013
    0 references
    Let \(A\subset\{1, \ldots, N\}\) be a set of integers without non-trivial arithmetic progressions of length \(3\). Then \[ |A|=O\left(\frac{N}{(\log N)^{3/4-o(1)}}\right). \] The problem of estimating an upper bound on \(|A|\) goes back to Erdős and Turán, and was for example studied by Roth, Heath-Brown, Szemerédi, and Bourgain. The author refines the work of \textit{J. Bourgain} [J. Anal. Math. 104, 155-192 (2008; Zbl 1155.11011)], where a resampling technique was introduced. Here it is shown that several density increment steps are (in some sense) independent, so that they can be more efficiently treated simultaneously. The author has meanwhile significantly improved the upper bound to \[ |A|= O\left(\frac{N(\log \log N)^5}{\log N}\right) \] [Ann. Math. (2) 174, No. 1, 619--636 (2011; Zbl 1264.11004)].
    0 references
    0 references
    arithmetic progressions
    0 references
    density increment
    0 references
    Bohr sets
    0 references