READING OFF KUROSH DECOMPOSITIONS
DOI10.1142/S0218196708004780zbMath1185.20028arXiv0706.0101MaRDI QIDQ3545899
Publication date: 11 December 2008
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.0101
decision problemsfinitely generated subgroupslabeled graphssubgroups of free productsKurosh subgroup theoremfree products of finite groupsgeneralized Stallings folding method
Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Topology of finite graphs
- Graphs and separability properties of groups
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
- Stallings foldings and subgroups of free groups
- A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
- STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- On fixed subgroups of maximal rank
- FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
