ASYNCHRONOUS COMBINGS OF GROUPS

DOI10.1142/S0218196792000116MaRDI QIDQ4039447zbMATH OpenOpenAlexFDO

Authors Walter D. Neumann

Publication date 1 June 1993

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

Full work available at URL https://doi.org/10.1142/s0218196792000116

zbMATH Keywords

biautomatic groupscentralizers of finite setsconjugacy problemfinitely presentedpolycyclic subgroupsquasigeodesic asynchronous biautomaticitysynchronous automaticityvirtually abelian

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65) Global geometric and topological methods (à la Gromov); differential geometric analysis on metric spaces (53C23)

Recommendations

• Quasiconvexity and asynchronously combable groups.
• Sol geometry groups are not asynchronously automatic
• Quasi-automatic groups are asynchronously automatic
• scientific article; zbMATH DE number 850246
• Automatic groups and amalgams

Cited in

(5)

• Quasiconvex subgroups of negatively curved groups
• Quasiconvexity and asynchronously combable groups.
• Annular Dehn functions of groups
• A REMARK ABOUT COMBINGS OF GROUPS
• On endomorphisms of automatic groups

This page was built for publication: ASYNCHRONOUS COMBINGS OF GROUPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039447)