Loading...
Loading...

Go to the content (press return)

Finite automata for Schreier graphs of virtually free groups

Author
Silva, P.V.; Soler, X.; Ventura, E.
Type of activity
Presentation of work at congresses
Name of edition
Fribourg Weekend in Group Theory 2012
Date of publication
2012
Presentation's date
2012-05-15
Book of congress proceedings
CRM preprints series
First page
1
Last page
32
URL
http://www.crm.cat/en/Publications/Publications/2013/Pr1140.pdf Open in new window
Abstract
The Stallings construction for f.g. subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an e¿cient computation of the core of a Schreier graph based on edge folding. It is proved that those groups admitting Stallings sections are precisely f.g. virtually free groups, through a constructive approach based on Bass-Serre theory. Complexity issues and applications are also discussed.
Keywords
Fnitely generated subgroups, Schreier graphs, Stallings foldings, Virtually free groups
Group of research
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants

  • Silva, Pedro V.  (author and speaker )
  • Soler Escrivà, Xaro  (author and speaker )
  • Ventura Capell, Enric  (author and speaker )