Algorithmic and asymptotic properties of groups
Group Theory
2007-05-23 v1 Geometric Topology
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).
Cite
@article{arxiv.math/0602215,
title = {Algorithmic and asymptotic properties of groups},
author = {Mark Sapir},
journal= {arXiv preprint arXiv:math/0602215},
year = {2007}
}
Comments
To appear in the Proceedings of ICM in Madrid, 22 pages