Home / Events / Talk: "Stallings graphs and pullbacks for Z^m ×Fn " (J. Delgado, UPC)

Talk: "Stallings graphs and pullbacks for Z^m ×Fn " (J. Delgado, UPC)

Abstract: We extend to the family of free-abelian-times-free groups (Z^m x F_n) the classical Stallings theory for describing subgroups of the free group as automata. This approach provides a geometric way of understanding several algorithmic results already proved in [Delgado, Ventura, Algorithmic problems for free-abelian times free groups. J. Algebra 391 (2013), 256-283], and naturally reveals some unexpected facts about this apparently naive family. In particular, I will discuss an adaptation to this new framework of the well- known pullback technique to deal with intersections of finitely generated subgroups.
This is joint work with Enric Ventura.

More information about this event…