Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.01382

Exact curve counting of given word length on the once-punctured torus

Filippo Baroni·David Fisac·Mingkun Liu
View original source ↗Read source document ↗Export metadata ↓

Abstract

On the once-punctured torus, we give an exact formula for the number of curves in any given mapping class group orbit of given word length. This settles a conjecture of Chas in [Cha16].

Explore related subjects

math.GTcs.CGmath.CO

Keep this discovery

BibTeXRIS

Filippo Baroni, David Fisac, Mingkun Liu. 2026-09-01. Exact curve counting of given word length on the once-punctured torus. https://arxiv.org/abs/2609.01382

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

Discover connections

cs.CG subjectmath.CO subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Unfolding Overlaps of the Exceptional Regular Polytopes

We find explicit ridge unfoldings of the three exceptional 4D polytopes (24-cell, 120-cell, 600-cell) that result in overlaps of their facets. These failures bring an end to the full classification of regular polytopes with the all-net property.

cs.CG↗
arXiv2026

Column Number of Delta-modular matrices: Refined Analysis via Sauer Matrices

In this paper, we build upon the analysis initiated by Gennadiy Averkov and Matthias Schymura (2022) and establish that the number of distinct columns of a $Δ$-modular matrix $A \in \mathbb{Z}^{m \times n}$ of rank $m$ is $O(m^3 Δ)$. This upper bound was previously known only for odd values of $Δ$. Recall that a matrix is called $Δ$-modular if the maximum of the absolute values of its $m \times m$ minors equals $Δ$.

math.CO↗
arXiv2026

Distinguishing classes of intersection graphs of homothets or similarities of two convex disks

For smooth convex disks $A$, i.e., convex compact subsets of the plane with non-empty interior and with at most one tangent at every boundary point, we classify the classes $G^{\text{hom}}(A)$ and $G^{\text{sim}}(A)$ of intersection graphs that can be obtained from homothets and similarities of $A$, respectively. Namely, we prove that $G^{\text{hom}}(A)=G^{\text{hom}}(B)$ if and only if $A$ and $B$ are affine equivalent, and $G^{\text{sim}}(A)=G^{\text{sim}}(B)$ if and only if $A$ and $B$ are similar.

cs.CG↗