Search arXivSearch

arXiv · 2502.09498

On the monodromy and spin parity of single-cylinder origamis in the minimal stratum

Abstract

In a paper with Menasco-Nieland, the first author constructed factorially many origamis in the minimal stratum of the moduli space of translation surfaces having simultaneously a single vertical cylinder and a single horizontal cylinder. Moreover, these origamis were constructed using the minimal number of squares required for origamis in the minimal stratum. We shall call such origamis minimal $[1,1]$-origamis. In this work, we calculate all of the spin parities of the Aougab-Menasco-Nieland origamis, and we therefore determine the connected component of the minimal stratum within which each is contained. Motivated by understanding the $\SL(2,\Z)$-orbits of these origamis, we investigate their monodromy groups, in particular proving that all of them are alternating or projective special linear groups. In fact, we prove more generally that the monodromy group of a minimal $[1,1]$-origami must almost always be a finite simple group. Finally, we determine the Kontsevich-Zorich monodromies of these origamis in low genus and give a conjecture in general. Note that previous works in the literature (e.g., that of Eskin-Kontsevich-Zorich, Filip-Forni-Matheus, Gutiérrez-Romo, Kany-Matheus, Matheus-Yoccoz-Zmiaikou, and Zorich) often chose to discuss just one of these $\SL(2,\Z)$-invariants at a time: in particular, to the best our knowledge, this is one of the first places where all of these $\SL(2,\Z)$-invariants are computed explicitly in a single paper for such a large family of origamis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tarik Aougab, Adam Friedman-Brown, Luke Jeffreys, Jiajie Ma. 2026-01-25. On the monodromy and spin parity of single-cylinder origamis in the minimal stratum. https://arxiv.org/abs/2502.09498

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT