Skip to Main content Skip to Navigation
Journal articles

Vertex links and the Grushko decomposition

Abstract : We develop an algorithm of polynomial time complexity to construct the Grushko decomposition of fundamental groups of graphs of free groups with cyclic edge groups. Our methods rely on analysing vertex links of certain CAT(0) square complexes naturally associated with a special class of the above groups. Our main result transforms a one-ended CAT(0) square complex of the above type to one whose vertex links satisfy a strong connectivity condition, as first studied by Brady and Meier.
Document type :
Journal articles
Complete list of metadata
Contributor : Suraj Krishna Meda Satish Connect in order to contact the contributor
Submitted on : Thursday, January 13, 2022 - 11:10:01 PM
Last modification on : Friday, January 14, 2022 - 3:24:04 PM

Links full text


  • HAL Id : hal-03525600, version 1
  • ARXIV : 1807.06186



Suraj Krishna Meda Satish. Vertex links and the Grushko decomposition. Annales de la Faculté des Sciences de Toulouse. Mathématiques., Université Paul Sabatier _ Cellule Mathdoc In press. ⟨hal-03525600⟩



Les métriques sont temporairement indisponibles