A Hardy field extension of Szemeredi's Theorem

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

37 pages. Some light editing after receiving the proofs

Scientific paper

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a cube, or more generally of the form $p(n)$ where $p(n)$ is any integer polynomial with zero constant term. We produce a variety of new results of this type related to sequences that are not polynomial. We show that the common difference of the progression in Szemer\'edi's theorem can be of the form $[n^\delta]$ where $\delta$ is any positive real number and $[x]$ denotes the integer part of $x$. More generally, the common difference can be of the form $[a(n)]$ where $a(x)$ is any function that is a member of a Hardy field and satisfies $a(x)/x^k\to \infty$ and $a(x)/x^{k+1}\to 0$ for some non-negative integer $k$. The proof combines a new structural result for Hardy sequences, techniques from ergodic theory, and some recent equidistribution results of sequences on nilmanifolds.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Hardy field extension of Szemeredi's Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Hardy field extension of Szemeredi's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Hardy field extension of Szemeredi's Theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-646997

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.