Abstract
This note concerns the so-called pyjama problem, whether it is possible to cover the plane by finitely many rotations of vertical strips of half-width . We first prove that there exist no periodic coverings for . Then we describe an explicit (non-periodic) construction for . Finally, we use a compactness argument combined with some ideas from additive combinatorics to show that a finite covering exists for . The question whether can be arbitrarily small remains open.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.