Can I read On Sets of Integers Not Containing Long Arithmetic Progressions on EtoBox?
On Sets of Integers Not Containing Long Arithmetic Progressions by walterhu315 is a document available to read on EtoBox.
What is On Sets of Integers Not Containing Long Arithmetic Progressions about?
The document discusses the maximal cardinality of subsets of integers that do not contain long arithmetic progressions, denoted as r(k, N). It presents a theorem improving previous estimates for r(1 + 2k, N), showing that r(1 + 2k, N) ≥ N exp(−C(log N)^(1/(k+1))). The paper builds on earlier work by Erdos, Turan, Roth, and Behrend, and provides proofs for its propositions using geometric and combinatorial methods.
- Author
- walterhu315
- Language
- EN