Abstract
A sequence of integers S is called Glasner if, given any ε > 0 and any infinite subset A of T = R/Z, and given y in T, we can find an integer n ∈ S such that there is an element of {nx : x ∈ A} whose distance to y is not greater than ε. In this paper we show that if a sequence of integers is uniformly distributed in the Bohr compactification of the integers, then it is also Glasner. The theorem is proved in a quantitative form.
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 callMore From: Proceedings of the Royal Society of Edinburgh: Section A Mathematics
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.
