Pyjama problem

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, the pyjama problem asks whether the plane can be covered by a finite number of rotated copies of a repeating pattern of stripes ("pyjama stripes"), no matter how thin the stripes are. The problem was posed in 2006 by Alex Iosevich, Mihail Kolountzakis, and Máté Matolcsi. It was answered in the affirmative by Freddie Manners in 2015, using an analogy with Furstenberg’s ×2, ×3 Theorem.

In mathematics, the pyjama problem asks whether the plane can be covered by a finite number of rotated copies of a repeating pattern of stripes ("pyjama stripes"), no matter how thin the stripes are. The problem was posed in 2006 by Alex Iosevich, Mihail Kolountzakis, and Máté Matolcsi. It was answered in the affirmative by Freddie Manners in 2015, using an analogy with Furstenberg’s ×2, ×3 Theorem. Let E(\varepsilon) := \{z \in \mathbb{C}: \mathrm{Re}(z) \in (-\varepsilon, \varepsilon) \pmod{1}\} be the pyjama stripe of width 2\varepsilon . Noah Kravitz and James Leng proved that \exp\exp\exp(\varepsilon^{-O(1)}) rotations of E(\varepsilon) about the origin are sufficient to cover \mathbb{C} , hence obtaining an explicit upper bound for the pyjama problem. It remains an open problem to obtain lower bounds for the pyjama problem beyond the trivial volume preserving bound of \varepsilon^{-1}/2 .

Text derived from https://en.wikipedia.org/w/index.php?oldid=1368141379 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.