Algorithmic and asymptotic properties of groups

2006/02/10 by Sapir, Mark
#FOS: Mathematics #Geometric Topology (math.GT) #Group Theory (math.GR)

paper · doi:10.48550/arxiv.math/0602215

Abstract

This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme properties (monsters).

Related

• Asymptotic invariants, complexity of groups and related problems
• Complexity of some algorithmic problems in groups: a survey
• Functions on groups and computational complexity
• Space functions of groups
• Isoperimetric and isodiametric functions of groups