Algorithmic and asymptotic properties of groups.

zbMATH Open1110.20033arXivmath/0602215MaRDI QIDQ5489374FDOQ5489374

Authors: Mark Sapir 

Publication date: 26 September 2006

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

Recommendations

• The conjugacy problem and Higman embeddings
• The conjugacy problem for groups, and Higman embeddings
• Group Embeddings with Algorithmic Properties
• scientific article; zbMATH DE number 3875526
• Isoperimetric functions of groups and computational complexity of the word problem

zbMATH Keywords

amenable groupsfinitely generated groupsconjugacy problemrecursively presented groupsDehn functionsword problemfinitely presented groupsTuring machinesalgorithmic problemsHigman embeddings

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Asymptotic properties of groups (20F69) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited In (17)

• Generalized algorithm for modeling periodic groups.
• Conjugacy problem in groups with quadratic Dehn function
• A Higman embedding preserving asphericity.
• Algorithmically finite groups.
• Finding non-trivial elements and splittings in groups.
• The isoperimetric spectrum of finitely presented groups
• Asymptotic invariants, complexity of groups and related problems.
• Polynomially-bounded Dehn functions of groups
• The Higman operations and embeddings of recursive groups
• A survey of recent results in groups and orderings: word problems, embeddings and amalgamations
• On torsion in finitely presented groups.
• LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
• Turing degrees and the word and conjugacy problems for finitely presented groups.
• The conjugacy problem for groups, and Higman embeddings
• The conjugacy problem and Higman embeddings
• Magnus embedding and algorithmic properties of groups \(F/N^{(d)}\)
• Group Embeddings with Algorithmic Properties

This page was built for publication: Algorithmic and asymptotic properties of groups.

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