On triples in arithmetic progression (Q1964140): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s000390050105 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996922551 / rank
 
Normal rank

Revision as of 23:02, 19 March 2024

scientific article
Language Label Description Also known as
English
On triples in arithmetic progression
scientific article

    Statements

    On triples in arithmetic progression (English)
    0 references
    0 references
    3 February 2000
    0 references
    It was shown by \textit{K. F. Roth} [J. Lond. Math. Soc. 28, 104-109 (1953; Zbl 0050.04002)] that a set \(A\) of positive integers \(n\leq x\) containing \(\gg x(\log\log x)^{-1}\) elements, must contain three distinct terms in arithmetic progression. The result was sharpened by the reviewer [J. Lond. Math. Soc. (2) 35, 385-394 (1987; Zbl 0589.10062)] and \textit{E. Szemerédi} [Acta Math. Hung. 56, 155-158 (1990; Zbl 0721.11007)], to show that \(\gg x(\log x)^{-c}\) terms suffice, for a certain positive constant \(c\). The present paper shows that in fact it is enough for \(A\) to contain \(\gg x(\log\log x/\log x)^{1/2}\) terms. The author uses a form of the circle method, but instead of examining the behaviour of \(A\) in arithmetic progressions, one uses `Bohr sets' defined by conditions of the form \(\|n\theta_j\|< \delta\) for \(j\leq J\).
    0 references
    0 references
    triples
    0 references
    density
    0 references
    arithmetic progression
    0 references
    circle method
    0 references
    0 references
    0 references