Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSilhouettes and generic properties of subgroups of the modular group
105
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We show how to count and randomly generate finitely generated subgroups of the modular group $textsf{PSL}(2,mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for these subgroups. The combinatorial methods developed to achieve these results bring to light a natural map, which associates with any finitely generated subgroup of $textsf{PSL}(2,mathbb{Z})$ a graph which we call its silhouette, and which can be interpreted as a conjugacy class of free finite index subgroups of $textsf{PSL}(2,mathbb{Z})$.
rate research
Read More
We count the finitely generated subgroups of the modular group $textsf{PSL}(2,mathbb{Z})$. More precisely: each such subgroup $H$ can be represented by its Stallings graph $Gamma(H)$, we consider the number of vertices of $Gamma(H)$ to be the size of $H$ and we count the subgroups of size $n$. Since an index $n$ subgroup has size $n$, our results generalize the known results on the enumeration of the finite index subgroups of $textsf{PSL}(2,mathbb{Z})$. We give asymptotic equivalents for the number of finitely generated subgroups of $textsf{PSL}(2,mathbb{Z})$, as well as of the number of finite index subgroups, free subgroups and free finite index subgroups. We also give the expected value of the isomorphism type of a size $n$ subgroup and prove a large deviations statement concerning this value. Similar results are proved for finite index and for free subgroups. Finally, we show how to efficiently generate uniformly at random a size $n$ subgroup (resp. finite index subgroup, free subgroup) of $textsf{PSL}(2,mathbb{Z})$.
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these representations: here we assume that they are represented by tuples of reduced words (generators of a subgroup) or of cyclically reduced words (relators). Classical models consider fixed size tuples of words (e.g. the few-generator model) or exponential size tuples (e.g. Gromovs density model), and they usually consider that equal length words are equally likely. We generalize both the few-generator and the density models with probabilistic schemes that also allow variability in the size of tuples and non-uniform distributions on words of a given length.Our first results rely on a relatively mild prefix-heaviness hypothesis on the distributions, which states essentially that the probability of a word decreases exponentially fast as its length grows. Under this hypothesis, we generalize several classical results: exponentially generically a randomly chosen tuple is a basis of the subgroup it generates, this subgroup is malnormal and the tuple satisfies a small cancellation property, even for exponential size tuples. In the special case of the uniform distribution on words of a given length, we give a phase transition theorem for the central tree property, a combinatorial property closely linked to the fact that a tuple freely generates a subgroup. We then further refine our results when the distribution is specified by a Markovian scheme, and in particular we give a phase transition theorem which generalizes the classical results on the densities up to which a tuple of cyclically reduced words chosen uniformly at random exponentially generically satisfies a small cancellation property, and beyond which it presents a trivial group.
In 1933 B.~H.~Neumann constructed uncountably many subgroups of ${rm SL}_2(mathbb Z)$ which act regularly on the primitive elements of $mathbb Z^2$. As pointed out by Magnus, their images in the modular group ${rm PSL}_2(mathbb Z)cong C_3*C_2$ are maximal nonparabolic subgroups, that is, maximal with respect to containing no parabolic elements. We strengthen and extend this result by giving a simple construction using planar maps to show that for all integers $pge 3$, $qge 2$ the triangle group $Gamma=Delta(p,q,infty)cong C_p*C_q$ has uncountably many conjugacy classes of nonparabolic maximal subgroups. We also extend results of Tretkoff and of Brenner and Lyndon for the modular group by constructing uncountably many conjugacy classes of such subgroups of $Gamma$ which do not arise from Neumanns original method. These maximal subgroups are all generated by elliptic elements, of finite order, but a similar construction yields uncountably many conjugacy classes of torsion-free maximal subgroups of the Hecke groups $C_p*C_2$ for odd $pge 3$. Finally, an adaptation of work of Conder yields uncountably many conjugacy classes of maximal subgroups of $Delta(2,3,r)$ for all $rge 7$.
We show that finitely-generated, purely pseudo-Anosov subgroups of the genus-2 Goeritz group are convex cocompact in the genus-2 mapping class group.
Let $A$ be the ring of elements in an algebraic function field $K$ over a finite field $F_q$ which are integral outside a fixed place $infty$. In an earlier paper we have shown that the Drinfeld modular group $G=GL_2(A)$ has automorphisms which map congruence subgroups to non-congruence subgroups. Here we prove the existence of (uncountably many) normal genuine non-congruence subgroups, defined to be those which remain non-congruence under the action of every automorphism of $G$. In addition, for all but finitely many cases we evaluate $ngncs(G)$, the smallest index of a normal genuine non-congruence subgroup of $G$, and compare it to the minimal index of an arbitrary normal non-congruence subgroup.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
