Rotations by roots of unity and Diophantine approximation

From MaRDI portal



Abstract: For a fixed integer n, we study the question whether at least one of the numbers ReXomegak, 1leqkleqn, is varepsilon-close to an integer, for any possible value of XinmathbbC, where omega is a primitive nth root of unity. It turns out that there is always a X for which the above numbers are concentrated around . 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.












This page was built for publication: Rotations by roots of unity and Diophantine approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688188)