Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1404.2110

On the Critical Exponent of Infinitely Generated Veech Groups

Ralf Lehnert
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove the existence of Veech groups having a critical exponent strictly greater than any elementary Fuchsian group (i.e. $>\frac{1}{2}$) but strictly smaller than any lattice (i.e. $<1$). More precisely, every affine covering of a primitive L-shaped Veech surface $X$ ramified over the singularity and a non-periodic connection point $P\in X$ has such a Veech group. Hubert and Schmidt showed that these Veech groups are infinitely generated and of the first kind. We use a result of Roblin and Tapie which connects the critical exponent of the Veech group of the covering with the Cheeger constant of the Schreier graph of $\mathrm{SL}(X)/\mathrm{Stab}_{\mathrm{SL}(X)}(P)$. The main task is to show that the Cheeger constant is strictly positive, i.e. the graph is non-amenable. In this context, we introduce a measure of the complexity of connection points that helps to simplify the graph to a forest for which non-amenability can be seen easily.

Explore related subjects

math.GTmath.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ralf Lehnert. 2014-04-08. On the Critical Exponent of Infinitely Generated Veech Groups. https://arxiv.org/abs/1404.2110

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↗