Statistics of subgroups of the modular group

We count the finitely generated subgroups of the modular group [Formula: see text]. More precisely, each such subgroup [Formula: see text] can be represented by its Stallings graph [Formula: see text], we consider the number of vertices of [Formula: see text] to be the size of [Formula: see text] and we count the subgroups of size [Formula: see text]. Since an index [Formula: see text] subgroup has size [Formula: see text], our results generalize the known results on the enumeration of the finite index subgroups of [Formula: see text]. We give asymptotic equivalents for the number of finitely generated subgroups of [Formula: see text], 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 [Formula: see text] subgroup and prove a large deviation 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 [Formula: see text] subgroup (respectively, finite index subgroup, free subgroup) of [Formula: see text].

[1]  George W. Polites,et al.  An introduction to the theory of groups , 1968 .

[2]  W. Stothers.  Free subgroups of the free product of cyclic groups , 1978 .

[3]  T. Müller,et al.  Statistics of isomorphism types in free products , 2010 .

[4]  S. M. Gersten,et al.  Intersection of finitely generated subgroups of free groups and resolutions of graphs , 1983 .

[5]  I. M. S. Dey.  Schreier systems in free products , 1965, Proceedings of the Glasgow Mathematical Association.

[6]  Aner Shalev,et al.  Fuchsian groups, coverings of Riemann surfaces, subgroup growth, random quotients and random walks , 2004 .

[7]  T. Müller,et al.  Character Theory of Symmetric Groups and Subgroup Growth of Surface Groups , 2002 .

[8]  Ilya Kapovich,et al.  Stallings Foldings and Subgroups of Free Groups , 2002 .

[9]  E. Bender.  An asymptotic expansion for the coefficients of some formal power series , 1975 .

[10]  E. Bender.  Asymptotic Methods in Enumeration , 1974 .

[11]  Pascal Weil,et al.  On the Complexity of the Whitehead Minimization Problem , 2007, Int. J. Algebra Comput..

[12]  Impossible specifications for the modular group , 1974 .

[13]  Alexander Kolpakov,et al.  Three-dimensional maps and subgroup growth , 2021, manuscripta mathematica.

[14]  M. Hall.  Subgroups of Finite Index in Free Groups , 1949, Canadian Journal of Mathematics.

[15]  Pascal Weil,et al.  Random Generation of Finitely Generated Subgroups of a Free Group , 2007, Int. J. Algebra Comput..

[16]  Pascal Weil,et al.  Stallings graphs for quasi-convex subgroups , 2017 .

[17]  On Cycloidal Subgroups of the Modular Group , 1969 .

[18]  Pascal Weil,et al.  PSPACE-complete problems for subgroups of free groups and inverse finite automata , 2000, Theor. Comput. Sci..

[19]  L. Markus-Epstein,et al.  Stallings Foldings and Subgroups of Amalgams of Finite Groups , 2007, Int. J. Algebra Comput..

[20]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[21]  Pascal Weil,et al.  Statistical properties of subgroups of free groups , 2013, Random Struct. Algorithms.

[22]  T. Müller,et al.  Classification and statistics of finite index subgroups in free products , 2004 .

[23]  Pedro V. Silva,et al.  Finite automata for Schreier graphs of virtually free groups , 2011, 1112.5709.

[24]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[25]  T. Müller.  Subgroup growth of free products , 1996 .

[26]  S. Chowla,et al.  On Recursions Connected With Symmetric Groups I , 1951, Canadian Journal of Mathematics.

[27]  John R. Stallings,et al.  Topology of finite graphs , 1983 .

[28]  M. H. Millington.  Subgroups of the Classical Modular Group , 1969 .

[29]  Mark V. Sapir,et al.  Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata , 2001, Int. J. Algebra Comput..

[30]  Pascal Weil,et al.  Algebraic extensions in free groups , 2006, math/0610880.

[31]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[32]  Asymptotic formulas related to free products of cyclic groups , 1976 .

[33]  S. Gersten,et al.  Rational subgroups of biautomatic groups , 1991 .

[34]  J. Schlage-Puchta,et al.  Character theory of symmetric groups, subgroup growth of Fuchsian groups, and random walks , 2003, math/0305260.