Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Finite automata for Schreier graphs of virtually free groups

Autor
Silva, P.V.; Soler, X.; Ventura, E.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
Fribourg Weekend in Group Theory 2012
Any de l'edició
2012
Data de presentació
2012-05-15
Llibre d'actes
CRM preprints series
Pàgina inicial
1
Pàgina final
32
URL
http://www.crm.cat/en/Publications/Publications/2013/Pr1140.pdf Obrir en finestra nova
Resum
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.
Paraules clau
Fnitely generated subgroups, Schreier graphs, Stallings foldings, Virtually free groups
Grup de recerca
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants

  • Silva, Pedro V.  (autor ponent)
  • Soler Escrivà, Xaro  (autor ponent)
  • Ventura Capell, Enric  (autor ponent)