Algorithmic and asymptotic properties of groups.

MaRDI QIDQ5489374zbMATH OpenFDO

Authors Mark Sapir

Publication date 26 September 2006

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

zbMATH Keywords

algorithmic problemsamenable groupsconjugacy problemDehn functionsfinitely generated groupsfinitely presented groupsHigman embeddingsrecursively presented groupsTuring machinesword problem

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) Asymptotic properties of groups (20F69)

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

Cited in

(18)

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

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)