Random generation of subgroups of the modular group with a fixed isomorphism type
arXiv:2310.18923 · doi:10.37236/12559
Abstract
We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group of a given isomorphism type. The method to achieve these results relies on a natural map of independent interest, which associates with any finitely generated subgroup of a graph which we call its silhouette, and which can be interpreted as a conjugacy class of free finite index subgroups of .
29 pages. This is the first part of a thorough revision of arXiv:2011.09179. The second part of this revision will be posted shortly