Goto Chapter: Top 1 2 3 4 Bib Ind
 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 

4 Related Algorithms
 4.1 Matrix groups
 4.2 Free groups

4 Related Algorithms

4.1 Matrix groups

4.1-1 ConjugacyGL2Z
‣ ConjugacyGL2Z( A, B )( function )

Decides whether two \(2 \times 2\) matrices in \(\mathrm{GL}_2(\mathbb{Z})\) are conjugate. If so, returns the element \(C\) such that \(A = C^{-1} B C\).

4.1-2 CentralizerGL2Z
‣ CentralizerGL2Z( A, B )( function )

Given a matrix \(A\), computes a matrix \(C\) and an integer \(n\) such that \(\mathrm{Cent}_{\mathrm{GL}_2(\mathbb{Z})}(A) = \langle -C, C \rangle\) and \(C^n = A\).

4.1-3 MembershipSubgroupSL2Z
‣ MembershipSubgroupSL2Z( gens, A )( function )

Given a matrix \(A\), decides whether \(A \in \langle \mathrm{gens} \rangle\) and, if so, computes a word \(w\) in the generators representing \(A\).

4.2 Free groups

4.2-1 AreAutomorphicEquivalent
‣ AreAutomorphicEquivalent( F, u, v )( operation )

Decides whether \(u\) and \(v\) are automorphically equivalent in \(F\).

4.2-2 IsCyclicalyReducedWord
‣ IsCyclicalyReducedWord( u )( property )

Returns: true or false

4.2-3 IsSubword
‣ IsSubword( u, v )( operation )

Returns whether the word v is a subword of u or not.

4.2-4 IsPrefix
‣ IsPrefix( u, v )( operation )

Returns whether the word \(v\) is a prefix of \(u\).

4.2-5 IsSuffix
‣ IsSuffix( u, v )( operation )

Returns whether the word \(v\) is a suffix of \(u\).

4.2-6 RootFreeGroup
‣ RootFreeGroup( v )( operation )

Returns a word \(w\) and an integer \(r\) such that \(w^r = v\) and \(r\) is maximal.

4.2-7 NielsenReducedSet
‣ NielsenReducedSet( V )( function )

Given a sequence of elements \(V\) of a free group, returns a Nielsen reduced set \(W\) that is equivalent to \(V\).

4.2-8 IsNielsenReducedSet
‣ IsNielsenReducedSet( V )( function )

Given a sequence of elements \(V\) of a free group, returns whether \(V\) is a Nielsen reduced set.

4.2-9 InFreeSubgroup
‣ InFreeSubgroup( V, w )( function )

Given a sequence of elements \(V\) of a free group and a word \(w\), returns whether \(w\) is in the subgroup generated by \(V\).

4.2-10 IsSubgroupOfFreeSubgroup
‣ IsSubgroupOfFreeSubgroup( V, W )( function )

Given two sequences of elements \(V,W\) of a free group, returns whether the subgroup generated by \(W\) is a subgroup of the group generated by \(V\).

4.2-11 IsNormalSubgroupOfFreeSubgroup
‣ IsNormalSubgroupOfFreeSubgroup( V, W )( function )

Given two sequences of elements \(V,W\) of a free group, returns whether the subgroup generated by \(W\) is a normal subgroup of the group generated by \(V\).

4.2-12 AreEquivalent
‣ AreEquivalent( V, W )( function )

Given two sequences of elements \(V,W\) of a free group, returns whether \(V\) and \(W\) are equivalent.

 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
Goto Chapter: Top 1 2 3 4 Bib Ind

generated by GAPDoc2HTML