ePrints

Cyclic rewriting and conjugacy problems

Lookup NU author(s): Dr Andrew Duncan

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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.

Publication metadata

Author(s): Diekert V, Duncan A, Myasnikov AG

Publication type: Article

Publication status: Published

Journal: Groups Complexity Cryptology

Year: 2012

Volume: 4

Issue: 2

Pages: 321-355

Print publication date: 27/11/2012

ISSN (print): 1867-1144

ISSN (electronic): 1869-6104

Publisher: Walter de Gruyter GmbH & Co. KG

URL: http://dx.doi.org/10.1515/gcc-2012-0020

DOI: 10.1515/gcc-2012-0020

Altmetrics

Share