Abstract
A major open question in combinatorial number theory is the Erdős-Turán conjecture which states that if A = 〈a n〉 is a sequence of natural numbers with the property that ∑ ∞ n=1 1/a n diverges then A contains arbitrarily long arithmetic progressions [1]. The difficulty of this problem is underscored by the fact that a positive answer would generalize Szcmerédi’s theorem which says that if a sequence A⊂ ℕ has positive upper Banach Density then A contains arbitrarily long arithmetic progressions. Szemerédi’s theorem itself has been the object of intense interest, since first, conjectured, also by Erdős and Turán, in 1936. First proved by Szemerédi in 1974 [9], the theorem has been re-proved using completely different approaches by Furstenberg in 1977 [2]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Erdős and P. Turán “On some sequences of Integers”, J. London Math. Soc., 11 (1936) 261–264.
H. Furstenberg, “Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions”, J. Anal. Math. Soc., 31 (1977) 204–256.
H. Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory, Princeton University Press, 1981.
T. Gowers, “A new proof of Szemerédi’s theorem”, GAFA, 11 (2001) 465–588.
R. Graham, B. Rothschild and J. Spencer, Ramsey Theory, 2nd ed. Wiley, 1990.
B. Green and T. Tao, The Primes Contain Arbitrarily Long Arithmetic Progressions. Preprint, 8 Apr 2004. http://arxiv.org/abs/math.NT/0404188
S. Leth, “Some nonstandard methods in combinatorial number theory”, Studia Logica, XLVII (1988) 85–98.
S. Leth, “Near arithmetic progressions in sparse sets”, Proc. of the Amor. Math. Soc., 134 (2005) 1579–1589.
E. Szemerédi, “On sets of integers containing no k elements in arithmetic progression”, Acta Arith., 27 (1975) 199–245.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Wien
About this chapter
Cite this chapter
Leth, S.C. (2007). Nonstandard methods and the Erdős-Turán conjecture. In: van den Berg, I., Neves, V. (eds) The Strength of Nonstandard Analysis. Springer, Vienna. https://doi.org/10.1007/978-3-211-49905-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-211-49905-4_9
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-49904-7
Online ISBN: 978-3-211-49905-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)