Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1705.05190

Enumeration of meanders and Masur-Veech volumes

Vincent Delecroix·Elise Goujard·Peter Zograf·Anton Zorich
View original source ↗Read source document ↗Export metadata ↓

Abstract

A meander is a topological configuration of a line and a simple closed curve in the plane (or a pair of simple closed curves on the 2-sphere) intersecting transversally. Meanders can be traced back to H. Poincaré and naturally appear in various areas of mathematics, theoretical physics and computational biology (in particular, they provide a model of polymer folding). Enumeration of meanders is an important open problem. The number of meanders with 2N crossings grows exponentially when N grows, but the longstanding problem on the precise asymptotics is still out of reach. We show that the situation becomes more tractable if one additionally fixes the topological type (or the total number of minimal arcs) of a meander. Then we are able to derive simple asymptotic formulas for the numbers of meanders as N tends to infinity. We also compute the asymptotic probability of getting a simple closed curve on a sphere by identifying the endpoints of two arc systems (one on each of the two hemispheres) along the common equator. The new tools we bring to bear are based on interpretation of meanders as square-tiled surfaces with one horizontal and one vertical cylinders. The proofs combine recent results on Masur-Veech volumes of the moduli spaces of meromorphic quadratic differentials in genus zero with our new observation that horizontal and vertical separatrix diagrams of integer quadratic differentials are asymptotically uncorrelated. The additional combinatorial constraints we impose in this article yield explicit polynomial asymptotics.

Explore related subjects

math.GTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vincent Delecroix, Elise Goujard, Peter Zograf, Anton Zorich. 2019-03-24. Enumeration of meanders and Masur-Veech volumes. https://doi.org/10.1017/fmp.2020.2

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗