Papers
Topics
Authors
Recent
Search
2000 character limit reached

Simultaneous approximation in nilsystems and the multiplicative thickness of return-time sets

Published 30 Jun 2022 in math.DS and math.CO | (2207.00098v2)

Abstract: In the topological dynamical system $(X,T)$, a point $x$ simultaneously approximates a point $y$ if there exists a sequence $n_1$, $n_2$, ... of natural numbers for which $T{n_i} x$, $T{2n_i}x$,..., $T{k n_i} x$ 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 $\delta$-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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.