Nonstandard methods and the Erdős-Turán conjecture

Steven C. Leth ()
Additional contact information
Steven C. Leth: University of Northern Colorado, Department of Mathematical Sciences

Chapter 9 in The Strength of Nonstandard Analysis, 2007, pp 133-142 from Springer

Abstract: 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]

Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-211-49905-4_9

Ordering information: This item can be ordered from
http://www.springer.com/9783211499054

DOI: 10.1007/978-3-211-49905-4_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().