Title: Unique ergodicity of systems of order k and applications
Abstract: The dichotomy between “structure” and “randomness” plays a fundamental role in the application of ergodic theory to combinatorial problems. A ubiquitous structure underlying many classes of combinatorial configurations in the integers (arithmetic progressions, polynomial progressions, sumsets, etc.) is the structure of nilsystems. In this talk, we will describe the structured systems responsible for combinatorial patterns in groups beyond the integers (a generalization of nilsystems) and prove a basic property of such systems, namely that orbit-closures always support a unique invariant measure. We will also see applications to combinatorics, including a new result that every set of positive multiplicative density in the integers contains the product set of arbitrarily many infinite sets. This talk is based on joint work with Asgar Jamneshan and Or Shalom.
Audience
- Faculty/Staff
- Post Docs/Docs
- Graduate Students
Contact
Andreas Mountakis
Email
Interest
- Academic (general)