{"version":"1.0","type":"link","title":"Pyjama problem - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/e/e8/Pyjama_covering_with_9_angles.png/1280px-Pyjama_covering_with_9_angles.png","thumbnail_width":1280,"thumbnail_height":1280}