Abstract

In the topological dynamical system (X,T), a point x simultaneously approximates a point y if there exists a sequence n1, n2, …of natural numbers for which Tnix, T2nix, …, Tknix all tend to y. In 1978, Furstenberg and Weiss showed that every system possesses a point which simultaneously approximates itself (a multiply recurrent point) and deduced refinements of van der Waerden's theorem on arithmetic progressions. In this paper, we study the denseness of the set of points that are simultaneously approximated by a given point. We show that in a minimal nilsystem, all points simultaneously approximate a δ-dense set of points under a necessarily restricted set of powers of T. We tie this theorem to the multiplicative combinatorial properties of return-time sets, showing that all nil-Bohr sets and typical return-time sets in a minimal system are multiplicatively thick in a coset of a multiplicative subsemigroup of the natural numbers. This yields an inhomogeneous multiple recurrence result that generalizes Furstenberg and Weiss' theorem and leads to new enhancements of van der Waerden's theorem. This work relies crucially on continuity in the prolongation relation (the closure of the orbit-closure relation) developed by Auslander, Akin, and Glasner; the theory of rational points and polynomials on nilmanifolds developed by Leibman, Green, and Tao; and the machinery of topological characteristic factors developed recently by Glasner, Huang, Shao, Weiss, and Ye.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.