betaFeedback

WorksMathematics

Quasipolynomial pyjamas

Abstract

The ``pyjama stripe" E(ε)E(\varepsilon) is the set of all complex numbers whose real part lies within ε\varepsilon of the nearest integer. The Pyjama Problem asks whether, for each ε>0\varepsilon > 0, there exists some union of finitely many rotations of E(ε)E(\varepsilon) about the origin that covers the plane. This was answered in the affirmative by Manners. Kravitz and Leng subsequently showed that exp⁡(exp⁡(exp⁡(ε−O(1))))\exp(\exp(\exp(\varepsilon^{-O(1)}))) rotations suffice. In this paper, we prove an upper bound of exp⁡((log⁡ε−1)50000)\exp((\log \varepsilon^{-1})^{50000}) rotations. We also show that at least (π/2+0.003+o(1))ε−1(π/2 + 0.003 + o(1))\varepsilon^{-1} rotations are necessary, improving upon the natural lower bound of (π/2+o(1))ε−1(π/2 + o(1))\varepsilon^{-1}.

Introduction

For ε>0\varepsilon> 0, let E(ε)E(\varepsilon) denote the “pyjama stripe”, given by

E(ε):={z∈C:Re⁡(z)∈(−ε,ε)(mod1)}.E(\varepsilon) := \{z \in\mathbb{C} : \operatorname{Re}(z) \in(-\varepsilon,\varepsilon)\pmod{1}\}.

This is the central object of study in the Pyjama Problem of Iosevich, Kolountzakis and Matolcsi [12]. For θ\theta a unit-norm complex number, let Eθ(ε):={z∈C:Re⁡(θz)∈(−ε,ε)(mod1)}E_\theta(\varepsilon) := \{z \in\mathbb{C} : \operatorname{Re}(\theta z) \in(-\varepsilon,\varepsilon)\pmod{1}\} denote the pyjama stripe rotated by θ−1\theta^{-1} about the origin.

Problem 1.1. Let ε>0\varepsilon> 0. Does there exist a finite set {ψ1,…,ψN}\{\psi_1,\ldots,\psi_N\} of unit-norm complex numbers such that

⋃n=1NEψn(ε)=C?\bigcup_{n=1}^{N} E_{\psi_n}(\varepsilon) = \mathbb{C}?

For ε>1/3\varepsilon> 1/3, one can easily verify that E1(ε)∪Ee2πi/3(ε)∪Ee4πi/3(ε)=CE_1(\varepsilon) \cup E_{e^{2\pi i/3}}(\varepsilon) \cup E_{e^{4\pi i/3}}(\varepsilon) = \mathbb{C}. A natural next approach would be to consider roots of unity in general. However, Malikiosis, Matolcsi and Ruzsa [16, 17] demonstrated that for ε<1/3\varepsilon< 1/3, rotations of E(ε)E(\varepsilon) by finitely many roots of unity cannot cover C\mathbb{C}.

In a breakthrough paper, Manners [18] resolved the Pyjama Problem in the affirmative for all ε>0\varepsilon> 0. Motivated by Furstenberg’s Theorem [7] on (×2,×3)(\times2, \times3)-invariant closed subsets of R/Z\mathbb{R}/\mathbb{Z}, Manners considers the semigroup generated by two multiplicatively independent rational rotations. In particular, he works with the unit-norm complex numbers given by

θ5:=1+2i1−2i,θ13:=2+3i2−3i.\theta_5 := \frac{1+2i}{1-2i}, \qquad\theta_{13} := \frac{2+3i}{2-3i}.

each labelled by the norm of the Gaussian prime in the numerator (or denominator). To resolve the Pyjama Problem, Manners adapts Furstenberg’s Theorem to a specific solenoid, with actions by θ5\theta_5 and θ13\theta_{13} taking the roles of multiplication by 2 and 3.

Since Manners’s proof appealed to compactness arguments, it provided no quantitative bound on the number of rotations required in terms of ε\varepsilon. This was the subject of Problem 41 in Green’s open problem list [8]. In recent work [15], Kravitz and Leng prove that

exp⁡(exp⁡(exp⁡(ε−C)))\exp(\exp(\exp(\varepsilon^{-C})))

rotations suffice, for some constant C>0C > 0.

To obtain this bound, Kravitz and Leng perform a quantitative analysis of Manners’s argument. A key input is their adaptation of a result of Bourgain, Lindenstrauss, Michel and Venkatesh [4], which provides an effective version of a (×2,×3)(\times2,\times3) theorem of Rudolph [23] (a special case of Furstenberg’s Conjecture, which generalises Furstenberg’s Theorem). They also combined their careful analysis with new geometric ideas to quantify the remaining steps.

While keeping the same blueprint as Kravitz and Leng, we consider actions corresponding to a growing number of primes, not just 5 and 13. We obtain the following bound.

Theorem 1.2. For ε>0\varepsilon> 0 sufficiently small, there exists a finite set Θ\Theta of unit-norm complex numbers such that

∣Θ∣≤exp⁡((log⁡ε−1)50000)|\Theta| \leq\exp((\log\varepsilon^{-1})^{50000})

and ⋃ψ∈ΘEψ(ε)=C\bigcup_{\psi\in\Theta} E_\psi(\varepsilon) = \mathbb{C}.

We make no effort to optimise the exponent of log⁡ε−1\log\varepsilon^{-1}, which currently relies on the best bounds for the zero-free strip for finite Hecke LL-functions.

We also consider the lower bound for the Pyjama Problem. Kravitz and Leng [15] noted a trivial volume-counting lower bound of 12ε−1\frac{1}{2}\varepsilon^{-1} rotations. Moreover, by considering an arc length bound along the circle S1−ε(0):={z∈C:∣z∣=1−ε}S_{1-\varepsilon}(0) := \{z \in\mathbb{C} : |z| = 1-\varepsilon\}, we see that at least (π2+o(1))ε−1(\frac{\pi}{2}+o(1))\varepsilon^{-1} rotations are required2. This provides a natural barrier to overcome. Here we provide a slight improvement.

Theorem 1.3. Let ε>0\varepsilon> 0 be sufficiently small. If Θ\Theta is a finite set of unit-norm complex numbers such that ⋃ψ∈ΘEψ(ε)=C\bigcup_{\psi\in\Theta} E_\psi(\varepsilon) = \mathbb{C}, then we must have

∣Θ∣≥(π2+1300)ε−1.|\Theta| \geq\left(\frac{\pi}{2}+\frac{1}{300}\right)\varepsilon^{-1}.

We achieve this by considering a small neighbourhood of S2−ε(0)S_{2-\varepsilon}(0) alongside S1−ε(0)S_{1-\varepsilon}(0). The arguments are purely geometric with no connection to techniques for the upper bound. It is likely that Theorem 1.3 does not demonstrate the true behaviour of the lower bound, and so a natural next target would be a lower bound of the form γ(ε)⋅ε−1\gamma(\varepsilon)\cdot\varepsilon^{-1}, where γ(ε)→∞\gamma(\varepsilon)\to\infty as ε→0\varepsilon\to0.

Proof outline

Upper bound

We start by explaining the setup of Manners’s argument [18]. Then we describe the quantitative framework of Kravitz and Leng [15]. Finally, we move onto our improvements on their approach.

Rational rotations.

A dual problem

Malikiosis, Matolcsi and Ruzsa [17] noticed that the pyjama stripes have a natural dual interpretation. The continuous characters on C\mathbb{C} are

χz:C→R/Z,χz:w↦Re⁡(zw)(mod1),\chi_z:\mathbb{C}\to\mathbb{R}/\mathbb{Z},\qquad\chi_z:w\mapsto\operatorname{Re}(zw)\pmod{1},

for z∈Cz\in\mathbb{C}. Thus, for θ\theta a unit-norm complex number, we may equivalently write

Eθ(ε)={z∈C:χz(θ)∈(−ε,ε)}.E_\theta(\varepsilon)=\{z\in\mathbb{C}:\chi_z(\theta)\in(-\varepsilon,\varepsilon)\}.

We can extend this definition to include all characters on C\mathbb{C}, not just the continuous ones. These form a group C^\widehat{\mathbb{C}}, the Pontryagin dual of C\mathbb{C} (when equipped with the discrete topology). We may then define

Eθ′(ε):={χ∈C^:χ(θ)∈(−ε,ε)}.E'_\theta(\varepsilon):=\{\chi\in\widehat{\mathbb{C}}:\chi(\theta)\in(-\varepsilon,\varepsilon)\}.

Importantly, C^\widehat{\mathbb{C}} is compact as the dual of a discrete space, with Eθ′(ε)E'_\theta(\varepsilon) an open subset (under the dual topology given by pointwise evaluation). Using this, Malikiosis, Matolcsi and Ruzsa showed that Problem 1.1 is equivalent to asking whether

⋃ψ∈S1Eψ′(ε)=C^\bigcup_{\psi\in S^1}E'_\psi(\varepsilon)=\widehat{\mathbb{C}}

holds. However, as remarked by Manners, C^\widehat{\mathbb{C}} is non-metrisable and generally difficult to work with. To get around this, Manners considers the semigroup Φ∞\Phi_\infty generated by the two rational rotations θ5,θ13∈Q(i)∩S1\theta_5,\theta_{13}\in\mathbb{Q}(i)\cap S^1, as described in the Introduction. Explicitly, we have

Φ∞:=⋃N≥1ΦN,ΦN:={θ5sθ13t:0≤s,t≤N}.\Phi_\infty:=\bigcup_{N\ge1}\Phi_N,\qquad\Phi_N:=\{\theta_5^s\theta_{13}^t:0\le s,t\le N\}.

Manners noticed that by committing to this rotation set in advance, he only needs to evaluate a given character on elements of Φ∞\Phi_\infty, instead of the whole of S1S^1. Thus, we can restrict C\mathbb{C} to a smaller subring before taking the dual formulation of the Pyjama Problem. The hope is that for a well-chosen subring, the dual space becomes more manageable than C^\widehat{\mathbb{C}}.

The requirement is that this subring contains Φ∞\Phi_\infty. This motivates the following choice:

A:=Z[i][1P5,1P13],P5:=1+2i,P13:=2+3i.A:=\mathbb{Z}[i]\left[\frac{1}{P_5},\frac{1}{P_{13}}\right],\qquad P_5:=1+2i,\qquad P_{13}:=2+3i.

As before, this has compact Pontryagin dual X:=A^X:=\widehat{A}, with an embedding of C\mathbb{C} as the continuous characters. In contrast to C^\widehat{\mathbb{C}}, XX is now metrisable and can even be thought of as a quotient of C×Q5×Q13\mathbb{C}\times\mathbb{Q}_5\times\mathbb{Q}_{13}.

The dual pyjama stripe within XX takes the form

E∗(ε):={χ∈X:χ(1)∈(−ε,ε)}.E^*(\varepsilon):=\{\chi\in X:\chi(1)\in(-\varepsilon,\varepsilon)\}.

Using this, Manners considers an alternative perspective on the Pyjama Problem. Instead of rotating the dual pyjama stripe to cover XX, we equivalently fix E∗(ε)E^*(\varepsilon) and consider “rotating” points of XX into E∗(ε)E^*(\varepsilon). This motivates us to equip XX with actions corresponding to rotations. For θ∈Φ∞\theta\in\Phi_\infty and χ∈X\chi\in X, let

(θ⋅χ)(z):=χ(θz).(\theta\cdot\chi)(z):=\chi(\theta z).

This is a continuous action, so we can view (X,Φ∞)(X,\Phi_\infty) as a topological dynamical system.

Rational rotations.

With this new perspective, we would be done if the orbit of every point in XX intersects E∗(ε)E^*(\varepsilon). It turns out this is too much to ask for, and this fact is manifested in the original geometric setting as follows.

Observe that Φ∞⊆Q(i)\Phi_\infty\subseteq\mathbb{Q}(i). Hence, the finite set ΦN\Phi_N lies in the lattice 1DZ[i]\frac{1}{D}\mathbb{Z}[i] for some non-zero D∈Z[i]D \in\mathbb{Z}[i]. Consider any θ∈ΦN\theta\in\Phi_N, so Dθ∈Z[i]D\theta\in\mathbb{Z}[i]. Since E(ε)E(\varepsilon) is invariant under translation by Z[i]\mathbb{Z}[i], the rotated pyjama stripe Eθ(ε)E_\theta(\varepsilon) is doubly-periodic with respect to DZ[i]D\mathbb{Z}[i].

One of the main results of Malikiosis, Matolcsi and Ruzsa [17] is that these periodic rotations cannot cover all of C\mathbb{C} when ε<1/3\varepsilon< 1/3. This illustrates the existence of “rational obstructions”: points with specific rational form which are guaranteed to be uncovered. To briefly demonstrate: suppose that Θ⊆1DZ[i]\Theta\subseteq\frac{1}{D}\mathbb{Z}[i], where DD is an odd integer (DD can always be chosen in this way). Each θ∈Θ\theta\in\Theta can be written as r+sit\frac{r+si}{t} in reduced form, where r,s,tr,s,t are coprime integers. This forces r−s,tr-s,t to be odd, and a short computation shows that all points of the form θ⋅1+i2D\theta\cdot\frac{1+i}{2}D have real part exactly 1/21/2. This means that 1+i2D\frac{1+i}{2}D lies outside of the union of the rotated pyjama stripes.

The key insight of Manners’s proof is that an almost-converse holds: for sufficiently large NN, C∖⋃θ∈ΦNEθ(ε)\mathbb{C} \setminus\bigcup_{\theta\in\Phi_N} E_\theta(\varepsilon) is actually contained in the union of small balls around rational obstructions, which lie in a sparse lattice. This is known as a “rationality lemma”. Then he adds a few irrational rotations to cover the remaining set, adapting the “irrational trick” trick of Malikiosis, Matolcsi and Ruzsa.

To establish the rationality lemma, Manners exploits the compactness of the dual space XX. He first shows that rational obstructions correspond to low-order torsion points in XX. Now recall that XX has one complex and two pp-adic components. Balls in the complex component, centred at these torsion points, also rotate amongst themselves under the action of Φ∞\Phi_\infty. This is captured in the following infinitary rationality lemma, which forms the core of Manners’s argument.

Lemma 2.1. If Y⊆XY \subseteq X is a closed, Φ∞\Phi_\infty-invariant set such that the image of the evaluation map Y(1)={χ(1):χ∈X}Y(1) = \{\chi(1) : \chi\in X\} is not all of R/Z\mathbb{R}/\mathbb{Z}, then

Y⊆⋃i=1kB‾1/2c(qi),Y \subseteq\bigcup_{i=1}^{k} \overline{B}_{1/2}^{c}(q_i),

for some finite set of torsion points {q1,…,qk}⊆X\{q_1,\ldots,q_k\} \subseteq X.

References

  1. [1]Alan Baker. Linear forms in the logarithms of algebraic numbers (i). Mathematika, 13(2):204–216, 1966.DOI
  2. [2]Alan Baker. Linear forms in the logarithms of algebraic numbers (ii). Mathematika, 14(1):102–107, 1967.DOI
  3. [3]Alan Baker. Linear forms in the logarithms of algebraic numbers (iii). Mathematika, 14(2):220–228, 1967.DOI
  4. [4]Jean Bourgain, Elon Lindentstrauss, Philippe Michel, and Akshay Venkatesh. Some effective results for ×a × b. Ergodic Theory and Dynamical Systems, 29(6):1705–1722, 2009.
  5. [5]John W. S. Cassels. Local Fields. London Mathematical Society Student Texts. Cambridge University Press, 1986.DOI
  6. [6]Vijay Chothi, Graham Everest, and Thomas Ward. S-integer dynamical systems: periodic points. Journal für die reine und angewandte Mathematik, 489:99–132, 1997.
  7. [7]Harry Furstenberg. Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation. Mathematical systems theory, 1:1–49, 1967.DOI
  8. [8]Ben Green. 100 open problems. manuscript, available on request to Professor Green, 2024.
  9. [9]Ben Green and Mehtaab Sawhney. Primes of the form p² + nq², 2026. arXiv:2410.04189.
  10. [10]A quasi-Riemann hypothesis for Dedekind zeta functions. Hexagon preprint hexagon:2610.00200v2, 2026. Contributors: Dean Cureton; Jesse Thorner.
  11. [11]A seven-eighths zero-free half-plane for unitary Weil L-functions. Hexagon preprint hexagon:2610.00216v1, 2026. Contributors: Boyang Hu.
  12. [12]Alex Losevich, Mihail N. Kolountzakis, and Mate Matolcsi. Covering the plane by rotations of a lattice arrangement of disks, 2006. arXiv:0611800.
  13. [13]Henryk Iwaniec and Emmanuel Kowalski. Analytic number theory. Colloquium publications (American Mathematical Society) v. 53. American Mathematical Society, Providence, R.I, 2004.
  14. [14]Oleksiy Klurman, Igor E. Shparlinski, and Joni Teräväinen. On the generation of multiplicative groups by small primes, 2026. arXiv:2609.25393.arxiv.org/abs/2609.25393
  15. [15]Noah Kravitz and James Leng. Quantitative pyjama, 2025. arXiv:2510.17744.arxiv.org/abs/2510.17744
  16. [16]Romanos-Diogenes Malikiosis. Rotations by roots of unity and Diophantine approximation. The Ramanujan Journal, 44(1):105–113, March 2016.DOI
  17. [17]Romanos-Diogenes Malikiosis, Mate Matolcsi, and Imre Z. Ruzsa. A note on the pyjama problem. European Journal of Combinatorics, 34(7):1071–1077, 2013.DOI
  18. [18]Freddie Manners. A solution to the pyjama problem. Inventiones mathematicae, 202:239–270, 2013.DOI
  19. [19]OpenAI. Primitive roots for every admissible integer base. OpenAI Math Release preprint OAI:Primitive-roots-for-every-admissible-integer-base-October-4-2026, 2026.DOI
  20. [20]OpenAI. The Quasi-Riemann Hypothesis. OpenAI Math Release preprint OAI:The-Quasi-Riemann-Hypothesis-October-5-2026, 2026.DOI
  21. [21]OpenAI. The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane Re(s) > 7/8. OpenAI Math Release preprint OAI:The-Quasi-Riemann-Hypothesis-September-30-2026, 2026.DOI
  22. [22]Cédric Pilatte. Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms. Forum of Mathematics, Pi, 14, 2026.DOI
  23. [23]Daniel J. Rudolph. ×2 and ×3 invariant measures and entropy. Ergodic Theory and Dynamical Systems, 10(2):395–406, 1990.DOI
  24. [24]Waldemar Schlackow. A sieve problem over the Gaussian integers. 2010.DOI

Paper details

vlnc:W_5wyqem35
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents