Skip to main content Accessibility help
×
Home

ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS

  • NIKOS FRANTZIKINAKIS (a1) and BRYNA KRA (a2)

Abstract

Szemerédi's theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain arbitrarily long polynomial configurations; Szemerédi's theorem corresponds to the linear case of the polynomial theorem. We focus on the case farthest from the linear case, that of rationally independent polynomials. We derive results in ergodic theory and in combinatorics for rationally independent polynomials, showing that their behavior differs sharply from the general situation.

Copyright

Keywords

ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS

  • NIKOS FRANTZIKINAKIS (a1) and BRYNA KRA (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed