加载中…
We present a method to compute finite index subgroups of . Our strategy follows Kulkarni’s ideas, the main contribution being a recursive method to compute bivalent trees and their automorphism group. As a concrete application, we compute all subgroups of index up to 20. We then use this database to produce tables with several arithmetical properties.

生成讲解博客的中文版本

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