Pattern recognition and minimal words in free groups of rank 2

Robert M. Haralick, Alexei D. Miasnikov, Alexei G. Myasnikov

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We describe a linear time probabilistic algorithm to recognize Whitehead minimal elements (elements of minimal length in their automorphic orbits) in free groups of rank 2. For a non-minimal element the algorithm gives an automorphism that is most likely to reduce the length of the element. This method is based on linear regression and pattern recognition techniques.

Original languageEnglish
Pages (from-to)523-538
Number of pages16
JournalJournal of Group Theory
Volume8
Issue number4
DOIs
StatePublished - Jul 2005

Fingerprint

Dive into the research topics of 'Pattern recognition and minimal words in free groups of rank 2'. Together they form a unique fingerprint.

Cite this