STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS
DOI10.1142/S0218196707003846zbMath1185.20027arXiv0705.0754MaRDI QIDQ3502838
Publication date: 20 May 2008
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.0754
decision problems; finitely generated subgroups; membership problem; labeled graphs; subgroups of free products; Kurosh subgroup theorem; free products of finite groups; generalized Stallings folding method
20E07: Subgroup theorems; subgroup growth
20F05: Generators, relations, and presentations of groups
20E06: Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- A combination theorem for negatively curved groups
- Topology of finite graphs
- Computing automatic coset systems and subgroup presentations
- Computing presentations for subgroups of polycyclic groups and of context-free groups
- Graphs and separability properties of groups
- On quasiconvex subgroups of negatively curved groups
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
- Stallings foldings and subgroups of free groups
- Coxeter groups, 2-completion, perimeter reduction and subgroup separability.
- Computing subgroup presentations, using the coherence arguments of McCammond and Wise.
- Coherence, local quasiconvexity, and the perimeter of 2-complexes.
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- Quasiconvexity and Amalgams
- Bounded rank subgroups of Coxeter groups, Artin groups and one-relator groups with torsion
- FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY
- FULLY RESIDUALLY FREE GROUPS AND GRAPHS LABELED BY INFINITE WORDS