Researchers Slash Complexity Estimates for the Infinite Pyjama Tiling Puzzle
A new mathematical approach reduces triple-exponential rotation bounds down to a quasipolynomial scale, narrowing a long-standing gap in planar geometry.
Mathematicians have cracked open a long-standing puzzle about how repeating stripes can tile an infinite two-dimensional plane, slashing previous complexity estimates by multiple exponential layers. The geometric conundrum, affectionately known in mathematical circles as the Pyjama Problem, asks whether any stripe-like region defined by a width parameter epsilon can be rotated around a central point a finite number of times until every single point in the plane is covered.
While previous research proved that a finite covering set of rotations always exists, the resulting upper bounds on the required number of rotations were staggering, scaling as a triple-exponential tower of powers. Now, in a study available on the arXiv preprint server, author Sida Li from the University of Cambridge reports an exponential upper bound of roughly exp((log epsilon^{-1})^{50000}) rotations, drastically reining in the previous astronomical estimates.
To understand the puzzle, picture an infinite sheet of paper and a set of parallel bands where the real part of any complex number falls within a small distance epsilon of the nearest integer. These bands resemble old-fashioned striped sleepwear, inspiring the quirky moniker. If the strip is very wide, a handful of rotations will easily paint over every coordinate on the plane. But as the stripe width shrinks toward zero, covering every microscopic gap requires an increasingly intricate choreography of rotations.
Earlier work by researchers Noah Kravitz and James Leng established that a triple-exponential number of rotations would suffice by analyzing a pair of specific rational rotations. However, those bounds suffered because the underlying mathematical metric grew excessively large when tracking individual components across prime number extensions. Li bypassed this bottleneck by spreading the rotational workload across a growing family of auxiliary prime numbers rather than relying on just two.
By coordinating actions across multiple prime moduli and utilizing advanced tools in analytic number theory, including bounds on finite Hecke characters, the author constructed a much more efficient mixing framework. This technique significantly dampens the growth rate of the required rotation set. On the flip side of the equation, the paper also refines the lower bound required for tiling the plane, pushing past simple volume-counting arguments by analyzing geometric neighborhoods along specific circular boundaries to establish that at least about (pi/2 + 0.003) epsilon^{-1} rotations are strictly necessary.
Despite the dramatic reduction from triple-exponential towers down to a quasipolynomial scale, a wide gap remains between the upper and lower bounds. The author notes that while further improvements might require even tighter control over prime generation, these new insights bring mathematicians one step closer to understanding the true structural limits of covering spatial dimensions with simple periodic shapes.
The study was posted to the arXiv preprint server on November 19, 2026.
This article has been fact checked for accuracy, with information verified against reputable sources. Learn more about us and our editorial process.
Last reviewed on .
Article history
- Latest version
Reference(s)
- Li, Sida. “Quasipolynomial pyjamas.” arXiv.org <http://arxiv.org/abs/2611.26622v1>.
Cite this page:
- Posted by Joseph Jackson