Free subgroups of free products and combinatorial hypermaps
Abstract
We derive a generating series for the number of free subgroups of finite index in by using a connection between free subgroups of and certain hypermaps (also known as ribbon graphs or "fat" graphs), and show that this generating series is transcendental. We provide non-linear recurrence relations for the above numbers based on differential equations that are part of the Riccati hierarchy. We also study the generating series for conjugacy classes of free subgroups of finite index in , which correspond to isomorphism classes of hypermaps. Asymptotic formulas are provided for the numbers of free subgroups of given finite index, conjugacy classes of such subgroups, or, equivalently, various types of hypermaps and their isomorphism classes.
Cite
@article{arxiv.1708.03842,
title = {Free subgroups of free products and combinatorial hypermaps},
author = {Laura Ciobanu and Alexander Kolpakov},
journal= {arXiv preprint arXiv:1708.03842},
year = {2019}
}
Comments
27 pages, 3 figures; supplementary SAGE worksheets available at http://sashakolpakov.wordpress.com/list-of-papers/