Pyjama problem

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.

Uses your system voice; voice and rate in settings.

≈ 2 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

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.[2] It was answered in the affirmative by Freddie Manners in 2015, using an analogy with Furstenberg’s ×2, ×3 Theorem.[3]

Quantitative bounds

edit edit source

Let E(ε):={z∈ℂ:Re(z)∈(−ε,ε)(mod1)} be the pyjama stripe of width 2ε. Noah Kravitz and James Leng proved that exp⁡exp⁡exp⁡(ε−O(1)) rotations of E(ε) about the origin are sufficient to cover ℂ, hence obtaining an explicit upper bound for the pyjama problem.[4] It remains an open problem to obtain lower bounds for the pyjama problem beyond the trivial volume preserving bound of ε−1/2.[4][5]

See also

edit edit source

References

edit edit source
  1. ^ Malikiosis, R. D.; Matolcsi, M.; Ruzsa, I. Z. (2013). "A note on the pyjama problem". European Journal of Combinatorics. 34 (7): 1071–1077. arXiv:1211.6138. doi:10.1016/j.ejc.2013.03.001. Wikipedia revision 1368141379, retrieved 2026-11-18
  2. ^ Iosevich, Alex; Kolountzakis, Mihail N.; Matolcsi, Máté (2007). "Covering the plane by rotations of a lattice arrangement of disks". In Carbery, Anthony; Duren, Peter L.; Khavinson, Dmitry; Siskakis, Aristomenis G. (eds.). Complex and Harmonic Analysis: Proceedings of the International Conference held at the Aristotle University of Thessaloniki, Thessaloniki, May 25–27, 2006. Lancaster, Pennsylvania: DEStech Publications. pp. 249–257. arXiv:math/0611800. ISBN 978-1-932078-73-2. MR 2387294. A preliminary version appeared on arXiv.org on 26 November 2006. Wikipedia revision 1368141379, retrieved 2026-11-18
  3. ^ Manners, Freddie (2015). "A solution to the pyjama problem". Inventiones Mathematicae. 202: 239–270. arXiv:1305.1514. doi:10.1007/s00222-014-0571-7. Wikipedia revision 1368141379, retrieved 2026-11-18
  4. ^ a b Kravitz, Noah; Leng, James (2025). "Quantitative pyjama". arXiv:2510.17744 [math.DS]. Wikipedia revision 1368141379, retrieved 2026-11-18
  5. ^ Green, Ben. "Problem 41" (PDF). 100 open problems. p. 20. Retrieved 2025-10-29. Wikipedia revision 1368141379, retrieved 2026-11-18

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

Words in each sectionQuantitative boundsQuantitative boundsQuantitative bounds: 82 words82See alsoSee alsoSee also: 27 words27
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001368141379 · captured 2026-08-07 · ledger · version history

Cite this page as: encyclopegia.org, “Pyjama problem”, snapshot enwiki-001368141379. https://encyclopegia.org/a/pyjama-problem