Title of article
Classes of Minimal Words of Small Lengths in a Finitely Generated Free Group
Author/Authors
Anabanti ، Chimere - University of Nigeria
Pages
7
From page
1
To page
7
Abstract
Let F_n denote the free group of finite rank n. A word w\in F_n is called minimal if no type 2 Whitehead automorphism can reduce its length. We explore the Whitehead algorithm in classifying minimal words of small lengths in F_n up to equivalence.
Keywords
Whitehead automorphisms , Minimal words , Equivalence
Journal title
General Mathematics Notes
Serial Year
2015
Journal title
General Mathematics Notes
Record number
2457738
Link To Document