FULLY RESIDUALLY FREE GROUPS AND GRAPHS LABELED BY INFINITE WORDS
DOI10.1142/S0218196706003141zbMath1106.20027OpenAlexW2045705351MaRDI QIDQ5493858
D. E. Serbin, Alexei G. Myasnikov, Vladimir N. Remeslennikov
Publication date: 16 October 2006
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196706003141
finitely generated subgroupsmembership probleminfinite wordsfinitely generated fully residually free groupsfinitely generated limit groupsfolded graphs
Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Residual properties and generalizations; residually finite groups (20E26)
Related Items
Cites Work
- Covering theory for graphs of groups
- Topology of finite graphs
- Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups
- Stallings foldings and subgroups of free groups
- Bounding the complexity of simplicial group actions on trees
- EXPONENTIAL GROUPS 2: EXTENSIONS OF CENTRALIZERS AND TENSOR COMPLETION OF CSA-GROUPS
- FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM