加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本