permlib
0.2.9
Library for permutation computations
|
base change by conjugation and, if necessary, transpositions More...
#include <conjugating_base_change.h>
Public Member Functions | |
ConjugatingBaseChange (const BSGSCore< PERM, TRANS > &) | |
constructor | |
template<class InputIterator > | |
unsigned int | change (BSGS< PERM, TRANS > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const |
changes base of bsgs so that it starts with the sequence given by baseBegin to baseEnd More... | |
template<class InputIterator > | |
unsigned int | change (SymmetricGroup< PERM > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const |
changes base of symmetric group so that it starts with the sequence given by baseBegin to baseEnd | |
![]() | |
BaseChange () | |
constructor | |
Additional Inherited Members | |
![]() | |
unsigned int | m_statTranspositions |
nuber of base transpositions needed since construction | |
unsigned int | m_statScheierGeneratorsConsidered |
nuber of Schreier generators considered in transposition since construction | |
![]() | |
bool | isRedundant (const BSGSCore< PERM, TRANS > &bsgs, unsigned int baseTargetPos, unsigned long alpha) const |
checks if insertion of a base point at given position is redundant More... | |
base change by conjugation and, if necessary, transpositions
unsigned int permlib::ConjugatingBaseChange< PERM, TRANS, BASETRANSPOSE >::change | ( | BSGS< PERM, TRANS > & | bsgs, |
InputIterator | baseBegin, | ||
InputIterator | baseEnd, | ||
bool | skipRedundant = false |
||
) | const |
changes base of bsgs so that it starts with the sequence given by baseBegin to baseEnd
true iff we multiply c with another permutation (and thus c is no longer with absolute certainty the identity)