Hostname: page-component-5c6d5d7d68-sv6ng Total loading time: 0 Render date: 2024-08-23T03:03:53.521Z Has data issue: false hasContentIssue false
  • English
  • Français

A RAMSEY THEOREM ON SEMIGROUPS AND A GENERAL VAN DER CORPUT LEMMA

Published online by Cambridge University Press:  29 June 2016

ANUSH TSERUNYAN
ANUSH TSERUNYAN*
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN IL, 61801, USAE-mail: anush@illinois.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemerédi’s theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs is that, for actions of semigroups, a certain kind of one recurrence (mixing along a filter) amplifies itself to multiple recurrence. This amplification is proved using a so-called van der Corput difference lemma for a suitable filter on the semigroup. Particular instances of this lemma (for concrete filters) have been proven before (by Furstenberg, Bergelson–McCutcheon, and others), with a somewhat different proof in each case. We define a notion of differentiation for subsets of semigroups and isolate the class of filters that respect this notion. The filters in this class (call them ∂-filters) include all those for which the van der Corput lemma was known, and our main result is a van der Corput lemma for ∂-filters, which thus generalizes all its previous instances. This is done via proving a Ramsey theorem for graphs on the semigroup with edges between the semigroup elements labeled by their ratios.

Keywords

van der Corputdifference lemmaRamseyfilterdifferentiation on semigroups
Type
Articles
Information
The Journal of Symbolic Logic , Volume 81 , Issue 2 , June 2016 , pp. 718 - 741
Copyright
Copyright © The Association for Symbolic Logic 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Bergelson, V., Ultrafilters, IP sets, dynamics, and combinatorial number theory , Ultrafilters Across Mathematics, Contemporary Mathematics, vol. 530, American Mathematical Society, Providence, RI, 2010, pp. 23–47.Google Scholar
Bergelson, V. and Gorodnik, A., Weakly Mixing Group Actions: A Brief Survey and an Example, Modern Dynamical Systems and Applications, Cambridge University Press, Cambridge, 2004, pp. 3–25.Google Scholar
Bergelson, V. and Mc Cutcheon, R., Central sets and a noncommutative Roth theorem . American Journal of Mathematics, vol. 129 (2007), no. 5, pp. 1251–1275.Google Scholar
Furstenberg, H., Ergodic behavior of diagonal measures and a theorem of Szemerédion arithmetic progressions . Journal d’Analyse Mathematique, vol. 31 (1977), pp. 204–256.Google Scholar
Furstenberg, H., Recurrence in Ergodic Theory and Combinatorial Number Theory, Princeton University Press, Princeton, NJ, 1981.CrossRefGoogle Scholar
Rudolph, D. J., Fundamentals of Measurable Dynamics, Clarendon Press, Oxford, 1990.Google Scholar
Szemerédi, E., On sets of integers containing no k elements in arithmetic progression . Acta Arithmetica, vol. 27 (1975), pp. 199–245.Google Scholar
Todorcevic, S., Introduction to Topological Ramsey Spaces, Princeton University Press, Princeton, NJ, 2010.Google Scholar
Tserunyan, A., Mixing and triple recurrence in probability groups, arXiv:1405.5629, 2013, submitted.Google Scholar
van der Corput, J. G., Diophantische Ungleichungen. I. Zur Gleichverteilung modulo Eins . Acta Mathematica, vol. 56 (1931), no. 1, pp. 373–456.Google Scholar