Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Friends and relatives of BS(1,2)

Friends and relatives of BS(1,2) Abstract Algorithms, constructions and examples are of central interest in combinatorial and geometric group theory. Teaching experience and, more recently, preparing a historical essay have led me to think the familiar group BS(1,2) is an example of fundamental importance. The purpose of this note is to make a case for this point of view. We recall several interesting constructions and important examples of groups related to BS(1,2), and indicate why certain of these groups played a key role in showing the word problem for finitely presented groups is unsolvable. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Friends and relatives of BS(1,2)

Groups Complexity Cryptology , Volume 6 (2) – Nov 1, 2014

Loading next page...
 
/lp/de-gruyter/friends-and-relatives-of-bs-1-2-AOVxQP70u4
Publisher
de Gruyter
Copyright
Copyright © 2014 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2014-0006
Publisher site
See Article on Publisher Site

Abstract

Abstract Algorithms, constructions and examples are of central interest in combinatorial and geometric group theory. Teaching experience and, more recently, preparing a historical essay have led me to think the familiar group BS(1,2) is an example of fundamental importance. The purpose of this note is to make a case for this point of view. We recall several interesting constructions and important examples of groups related to BS(1,2), and indicate why certain of these groups played a key role in showing the word problem for finitely presented groups is unsolvable.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2014

There are no references for this article.