
TL;DR
This paper establishes a quantitative bound on the number of rotations of the pyjama stripe needed to cover the complex plane, advancing the understanding of the Pyjama Problem with explicit bounds.
Contribution
It provides the first explicit exponential bound on the number of rotations required to cover the plane in the Pyjama Problem, using entropic methods.
Findings
Bound of triple exponential in epsilon for covering the plane.
Application of entropic tools from additive combinatorics.
Extension of previous qualitative results to quantitative bounds.
Abstract
The "pyjama stripe" with parameter is the set of all complex numbers such that the distance from to the nearest integer is at most . The Pyjama Problem of Iosevich, Kolountzakis, and Matolcsi asks whether, for every choice of , it is possible to cover the entire complex plane with finitely many rotations of around the origin. Manners obtained an affirmative answer to this question by studying a -type problem over a suitable solenoid. Manners's argument provided no quantitative bounds (in terms of ) on the number of rotations required, and Green has highlighted the problem of obtaining such quantitative bounds. Our main result is that rotations of suffice to cover the complex plane. Our analysis makes use of the…
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.
Taxonomy
TopicsPoint processes and geometric inequalities · Mathematical Dynamics and Fractals · Mathematical Approximation and Integration
