Algorithmic and asymptotic properties of groups

Simple item page
dc.creatorSapir, Mark
dc.date2006-02-10
dc.date.accessioned2026-07-07T07:03:17Z
dc.date.available2026-07-07T07:03:17Z
dc.descriptionThis 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).
dc.descriptionTo appear in the Proceedings of ICM in Madrid, 22 pages
dc.identifierhttps://arxiv.org/abs/math/0602215
dc.identifierhttp://arxiv.org/abs/math/0602215
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/108915
dc.subjectGroup Theory
dc.subjectGeometric Topology
dc.titleAlgorithmic and asymptotic properties of groups
dc.typetext

Files

Collections

arXiv