COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS

DOI10.1142/S021819671000542XzbMath1203.20032arXiv0908.0569MaRDI QIDQ3578449

Jeremy Macdonald

Publication date: 20 July 2010

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.0569

zbMATH Keywords

automorphism groupslimit groupsfully residually free groupscompressed word problem

Mathematics Subject Classification ID

Geometric group theory (20F65) Automorphisms of infinite groups (20E36) Automorphism groups of groups (20F28) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Residual properties and generalizations; residually finite groups (20E26)

Related Items (8)

LINEAR ESTIMATES FOR SOLUTIONS OF QUADRATIC EQUATIONS IN FREE GROUPS ⋮ Logspace and compressed-word computations in nilpotent groups ⋮ Compressed word problems in HNN-extensions and amalgamated products ⋮ Compressed Membership in Automata with Compressed Labels ⋮ COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS ⋮ The complexity of compressed membership problems for finite automata ⋮ Unnamed Item ⋮ Compression techniques in group theory

Cites Work

• The isomorphism problem for finitely generated fully residually free groups.
• Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups

This page was built for publication: COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS