arXiv · 1510.03645
Rotations by roots of unity and Diophantine approximation
Abstract
For a fixed integer $n$, we study the question whether at least one of the numbers $\Re Xω^k$, $1\leq k\leq n$, is $\varepsilon$-close to an integer, for any possible value of $X\in\mathbb{C}$, where $ω$ is a primitive $n$th root of unity. It turns out that there is always a $X$ for which the above numbers are concentrated around $1/2\bmod1$. The distance from $1/2$ depends only on the local properties of $n$, rather than its magnitude. This is directly related the so-called "pyjama" problem which was solved recently.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Romanos-Diogenes Malikiosis. 2015-10-13. Rotations by roots of unity and Diophantine approximation. https://doi.org/10.1007/s11139-016-9781-5
Cite the original work for its findings. Save a collection to share your selection of sources.