arXiv:1112.5709 [math.GR]AbstractReferencesReviewsResources
Finite automata for Schreier graphs of virtually free groups
Pedro Silva, Xaro Soler-EscrivĂ , Enric Ventura
Published 2011-12-24Version 1
The Stallings construction for finitely generated subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an eficient computation of the core of a Schreier graph based on edge folding. It is proved that those groups admitting Stallings sections are precisely finitely generated virtually free groups, through a constructive approach based on Bass-Serre theory. Complexity issues and applications are also discussed.
Categories: math.GR
Related articles: Most relevant | Search more
arXiv:2405.17695 [math.GR] (Published 2024-05-27)
The Limit Space of Self-similar Groups and Schreier graphs
arXiv:1811.02115 [math.GR] (Published 2018-11-03)
Examples of defining groups by finite automata
arXiv:1905.10120 [math.GR] (Published 2019-05-24)
Convergence towards the end space for random walks on Schreier graphs