Rotations by roots of unity and Diophantine approximation
Romanos-Diogenes Malikiosis

TL;DR
This paper investigates how roots of unity influence the approximation of complex numbers by integers, revealing concentration phenomena around 1/2 mod 1 and connecting to the recent solution of the pyjama problem.
Contribution
It establishes that for any fixed integer n, there exists a complex number X making certain rotations by roots of unity concentrate near 1/2 mod 1, linking to the pyjama problem.
Findings
Existence of X concentrating around 1/2 mod 1
Distance depends on local properties of n
Connection to the pyjama problem
Abstract
For a fixed integer , we study the question whether at least one of the numbers , , is -close to an integer, for any possible value of , where is a primitive th root of unity. It turns out that there is always a for which the above numbers are concentrated around . The distance from depends only on the local properties of , rather than its magnitude. This is directly related the so-called "pyjama" problem which was solved recently.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
