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

zbMATH Keywords

finitely generated subgroupsmembership probleminfinite wordsfinitely generated fully residually free groupsfinitely generated limit groupsfolded graphs

Mathematics Subject Classification ID

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 (10)

Groups with free regular length functions in $\mathbb{Z}^{n}$ ⋮ Elementary theory of free non-abelian groups. ⋮ Irreducible affine varieties over a free group. I: Irreducibility of quadratic equations and Nullstellensatz ⋮ STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS ⋮ On Some Finiteness Properties in Infinite Groups ⋮ Membership problem in groups acting freely on \(\mathbb N^n\)-trees. ⋮ FINITE INDEX SUBGROUPS OF FULLY RESIDUALLY FREE GROUPS ⋮ ACTIONS, LENGTH FUNCTIONS, AND NON-ARCHIMEDEAN WORDS ⋮ A list of applications of Stallings automata ⋮ Knapsack problems in groups

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

This page was built for publication: FULLY RESIDUALLY FREE GROUPS AND GRAPHS LABELED BY INFINITE WORDS