Article
Licensed
Unlicensed
Requires Authentication
Pattern recognition and minimal words in free groups of rank 2
-
Robert M. Haralick
Published/Copyright:
November 18, 2005
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.
:
Published Online: 2005-11-18
Published in Print: 2005-07-20
Walter de Gruyter GmbH & Co. KG
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Tri-extraspecial groups
- On commutators in p-groups
- Capability of nilpotent products of cyclic groups
- Products of characters and derived length. II
- Character degree graphs, blocks and normal subgroups
- Reflection triangles in Coxeter groups and biautomaticity
- On algebraic sets over metabelian groups
- Bounded automorphisms and quasi-isometries of finitely generated groups
- Pattern recognition and minimal words in free groups of rank 2
Articles in the same Issue
- Tri-extraspecial groups
- On commutators in p-groups
- Capability of nilpotent products of cyclic groups
- Products of characters and derived length. II
- Character degree graphs, blocks and normal subgroups
- Reflection triangles in Coxeter groups and biautomaticity
- On algebraic sets over metabelian groups
- Bounded automorphisms and quasi-isometries of finitely generated groups
- Pattern recognition and minimal words in free groups of rank 2
