Algorithmic and asymptotic properties of groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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).
To appear in the Proceedings of ICM in Madrid, 22 pages

Keywords

Group Theory, Geometric Topology

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/108915

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0602215
 http://arxiv.org/abs/math/0602215

Collections

arXiv