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

Learn More →

Cyclic rewriting and conjugacy problems

Cyclic rewriting and conjugacy problems Abstract. Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length elements of conjugacy classes in the group. These techniques are applied to the universal groups of Stallings pregroups and in particular to free products with amalgamation, HNN-extensions and virtually free groups, to yield simple and intuitive algorithms and proofs of conjugacy criteria. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Loading next page...
 
/lp/de-gruyter/cyclic-rewriting-and-conjugacy-problems-hQFB0rWL1K
Publisher
de Gruyter
Copyright
Copyright © 2012 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2012-0020
Publisher site
See Article on Publisher Site

Abstract

Abstract. Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length elements of conjugacy classes in the group. These techniques are applied to the universal groups of Stallings pregroups and in particular to free products with amalgamation, HNN-extensions and virtually free groups, to yield simple and intuitive algorithms and proofs of conjugacy criteria.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: Dec 1, 2012

There are no references for this article.