Implements a greedy procedure of reducing a word to its minimal length. More...
Public Member Functions
|WhiteheadMinimization (int n)|
|bool||isMinimal (const Word &w) const|
|Test if the word is minimal. |
|Word||findMinimal (const Word &w, ostream *out=NULL) const|
|Find a word of the minimal length. |
|const WhiteheadAutoSetType2 &||getSet () const|
|Get the Whitehead set of type II. |
Implements a greedy procedure of reducing a word to its minimal length.
Greedy procedure applies automorphisms from a Whitehead set of type II to a word until its length is reduced. If a shorter image is found, procedure is applied to the shorten word. If none of the automorphisms can reduce the length, procedure stops and the shortest word is returned.
Find a word of the minimal length.
Applies automorphisms from the Whitehead set to find a word of the minimal length in the automorphic orbit of a given word.
|w||- initial word.|
|const WhiteheadAutoSetType2& WhiteheadMinimization::getSet||(||)|| const
|bool WhiteheadMinimization::isMinimal||(||const Word &||w||)||const|
Test if the word is minimal.
Applies automorphisms from the Whitehead set to test if a given word has minimal length.
|w||- word to be tested.|
whas the minimal length,