Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board Member: Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year


CiteScore 2016: 0.35

SCImago Journal Rank (SJR) 2016: 0.372
Source Normalized Impact per Paper (SNIP) 2016: 0.517

Mathematical Citation Quotient (MCQ) 2016: 0.23

Online
ISSN
1869-6104
See all formats and pricing
More options …

Cyclic rewriting and conjugacy problems

Volker Diekert / Andrew Duncan / Alexei G. Myasnikov
Published Online: 2012-11-27 | DOI: https://doi.org/10.1515/gcc-2012-0020

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.

Keywords: Algorithmic group theory; rewriting system; conjugacy problem; HNN-extension; free product with amalgamation; Stallings pregroup

About the article

Received: 2012-06-17

Published Online: 2012-11-27

Published in Print: 2012-12-01


Citation Information: , ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2012-0020.

Export Citation

© 2012 by Walter de Gruyter Berlin Boston. Copyright Clearance Center

Comments (0)

Please log in or register to comment.
Log in