Rotations by roots of unity and Diophantine approximation
From MaRDI portal
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.
Recommendations
Cites work
- A note on the cyclotomic polynomial
- A note on the pyjama problem
- A solution to the pyjama problem
- Ein Beitrag zum Problem der Faktorisation von endlichen Abelschen Gruppen
- scientific article; zbMATH DE number 5290536 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3081728 (Why is no real title available?)
- On vanishing sums of roots of unity.
- Über das Kreisteilungspolynom
Cited in
(5)- On square roots of a rotation
- Rotation number associated with difference equations satisfied by polynomials orthogonal on the unit circle
- A positive factorization for the balanced superelliptic rotation
- Numbers sticking together ( N)
- On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture
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)