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 Xωk, 1≤ k≤ n, is -close to an integer, for any possible value of X∈C, where ω is a primitive nth root of unity. It turns out that there is always a X for which the above numbers are concentrated around 1/21. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…