permlib
0.2.6
Library for permutation computations
|
permlib::AlternatingGroupType | Group type for alternating groups |
permlib::AnonymousGroupType< IntegerType > | Group type for a permutation group whose type could not be determined |
permlib::partition::BacktrackRefinement< PERM > | Backtrack refinement |
permlib::classic::BacktrackSearch< BSGSIN, TRANSRET > | Searching in a group with classical backtracking |
permlib::BaseChange< PERM, TRANS > | Abstract base class for base change algorithms |
permlib::BaseConstruction< PERM, TRANS > | Base class for BSGS construction algorithms |
permlib::BaseSearch< BSGSIN, TRANSRET > | Base class for searching in a group |
permlib::BaseSorter | A sorter that sorts a sequence (e.g. ![]() |
permlib::BaseSorterByReference | A sorter that sorts a sequence (e.g. ![]() |
permlib::BaseTranspose< PERM, TRANS > | Abstract base class for base transposition |
binary_function | |
permlib::BSGS< PERM, TRANS > | Represents a base and strong generating set (BSGS) |
permlib::BSGSCore< PERM, TRANS > | Core data of a base and strong generating set (BSGS) |
permlib::BSGSGenerator< TRANS > | Stateful generator of BSGS elements |
permlib::BSGSRandomGenerator< PERM, TRANS > | Generates uniformly distributed random group elements based on an existing BSGS |
permlib::exports::BSGSSchreierBase | Base class for import/export of a BSGS based on SchreierTreeTransversal |
permlib::exports::BSGSSchreierData | Data structure with elementary data types to represent a BSGS based on SchreierTreeTransversal |
permlib::exports::BSGSSchreierExport | Export of a BSGS based on SchreierTreeTransversal |
permlib::exports::BSGSSchreierImport | Import of a BSGS based on SchreierTreeTransversal |
permlib::ConjugatingBaseChange< PERM, TRANS, BASETRANSPOSE > | Base change by conjugation and, if necessary, transpositions |
permlib::CyclicGroupConstruction< TRANS > | BSGS construction for a cyclic group of given order |
permlib::CyclicGroupType | Group type for cyclic groups |
permlib::DadeInvariants< BSGSIN > | Computes some invariants of a permutation group with Dade's algorithm |
permlib::delete_object | Callable object to delete a pointer |
permlib::DeterministicBaseTranspose< PERM, TRANS > | Implementation of a deterministic base transposition algorithm |
permlib::DirectProductGroupType | Group type for a direct product of two groups |
permlib::DSetAction< PERM > | Action of a permutation on a dynamic bitset |
permlib::ExplicitTransversal< PERM > | Transversal class that stores all transversal elements explicitly |
permlib::FirstRedundantBasePointInsertionStrategy< PERM, TRANS > | Insertion position at first position i such that ![]() |
permlib::Generator< PERM > | Interface for group element generators |
permlib::GiantTest< PERM > | Tests a group given by generators for being an Alternating Group or a Symmetric Group |
permlib::GiantTestBase | |
permlib::GroupIntersectionPredicate< PERM, TRANS > | Predicate for the subgroup that arises as the intersection of two given groups |
permlib::partition::GroupRefinement< PERM, TRANS > | Concrete ![]() |
permlib::partition::GroupRefinementFamily< PERM, TRANS > | ![]() |
permlib::GroupSorter< PERM > | A sorter that sorts a sequence of permutations with respect to a ordering induced by a base |
permlib::GroupType | Abstract base class for permutation group types |
permlib::IdentityPredicate< PERM > | Predicate matching a permutation if it stabilizes a given list of points pointwise |
permlib::classic::IntersectionSearch< BSGSIN, TRANSRET > | Subgroup search for a group intersection based on classical backtracking |
permlib::partition::IntersectionSearch< BSGSIN, TRANSRET > | Subgroup search for a group intersection based on partition backtracking |
permlib::KnownBSGSConstruction< PERM, TRANS > | BSGS construction from a known base and strong generating set |
permlib::LexSmallerImagePredicate< PERM > | Coset-type predicate for group elements that map one set of zeros and ones to a lex-smaller set (w.r.t. to the indices) |
permlib::classic::LexSmallerImageSearch< BSGSIN, TRANSRET > | Coset representative search for a lex-smaller set images |
permlib::LinearFormAction< PERM > | Action of a permutation on a linear form |
permlib::LinearFormList | List of linear forms |
permlib::MatrixAutomorphismPredicate< PERM, MATRIX > | Predicate for the automorphisms of a symmetric matrix |
permlib::partition::MatrixAutomorphismRefinementFamily< PERM, MATRIX > | ![]() |
permlib::partition::MatrixAutomorphismSearch< BSGSIN, TRANSRET > | Subgroup search for the automorphism group of a symmetric matrix based on partition backtracking |
permlib::partition::MatrixRefinement1< PERM, MATRIX > | Concrete ![]() |
permlib::partition::MatrixRefinement2< PERM, MATRIX > | Concrete ![]() |
permlib::NamedGroupType | Abstract base class for named groups (such as cyclic and symmetric groups) |
permlib::NewBaseChange< PERM, TRANS > | Base change by constructing a new base with random schreier sims |
permlib::Orbit< PERM, PDOMAIN > | Abstract base class for orbit computation |
permlib::OrbitLexMinSearch< BSGSIN > | Algorithm to find the lexicographically minimal set in an orbit |
permlib::OrbitList< PERM, PDOMAIN > | Stores an orbit in a sorted list |
permlib::OrbitSet< PERM, PDOMAIN > | Stores an orbit in a set for fast contains() operation |
permlib::OrderedSorter< ORDER > | A sorter that sorts a sequence with respect to a given input ordering |
permlib::partition::Partition | Partition |
permlib::Permutation | Permutation class storing all values explicitly |
permlib::PermutationWord | Permutation class storing permutations as words of elementary Permutation 's |
permlib::PointwiseStabilizerPredicate< PERM > | Predicate matching a permutation if it stabilizes a given list of points pointwise |
permlib::PrimeHelper | Helper class for primality checks |
permlib::PrimitivitySGSTest< TRANS > | Tests a transitive group for which a strong generating set is availble for primitivity |
permlib::PrimitivityTest< PERM > | Tests a transitive group is availble for primitivity |
permlib::ProductReplacementGenerator< PERM > | Generates nearly-uniformly distributed random group elements using the product replacement algorithm |
permlib::RandomBaseTranspose< PERM, TRANS > | Implementation of a randomized base transposition algorithm |
permlib::RandomGenerator< PERM > | Abstract base class for random group element generators |
permlib::RandomSchreierGenerator< PERM, TRANS > | Generates a uniformly distributed random element of ![]() |
permlib::RandomSchreierSimsConstruction< PERM, TRANS, Integer > | BSGS construction with Random Schreier-Sims algorithm |
permlib::partition::RBase< BSGSIN, TRANSRET > | R-base for partition backtracking |
permlib::RedundantBasePointInsertionStrategy< PERM, TRANS > | Strategy for redundant base point insertion |
permlib::partition::Refinement< PERM > | Base class for a ![]() |
permlib::partition::RefinementFamily< PERM > | Class of ![]() |
permlib::SchreierGenerator< PERM, TRANS > | Stateful generator of Schreier generators |
permlib::SchreierSimsConstruction< PERM, TRANS > | BSGS construction with classic Schreier-Sims algorithm |
permlib::SchreierTreeTransversal< PERM > | Transversal class that stores transversal elements in a Schreier tree |
permlib::SetImagePredicate< PERM > | Coset-type predicate for group elements that map one set of points onto another given set of points |
permlib::partition::SetImageRefinement< PERM > | |
permlib::partition::SetImageRefinementFamily< PERM > | ![]() |
permlib::classic::SetImageSearch< BSGSIN, TRANSRET > | Coset representative search for a set image based on classical backtracking |
permlib::partition::SetImageSearch< BSGSIN, TRANSRET > | Coset representative search for a set image based on partition backtracking |
permlib::partition::SetStabilizeRefinement< PERM > | Concrete ![]() |
permlib::partition::SetStabilizeRefinementFamily< PERM > | ![]() |
permlib::classic::SetStabilizerSearch< BSGSIN, TRANSRET > | Subgroup search for a set stabilizer based on classical backtracking |
permlib::partition::SetStabilizerSearch< BSGSIN, TRANSRET > | Subgroup search for a set stabilizer based on partition backtracking |
permlib::SetwiseStabilizerPredicate< PERM > | Predicate for the subgroup that stabilizes a given point set |
permlib::ShallowSchreierTreeTransversal< PERM > | Transversal class that stores elements in a shallow Schreier tree |
permlib::SimpleBaseChange< PERM, TRANS, BASETRANSPOSE > | Base change by a sequence of point insertions and transpositions |
permlib::StabilizesPointPredicate< PERM > | Predicate matching points that are stabilized by given permutations |
permlib::SubgroupPredicate< PERM > | Abstract base class for subgroup (and coset) predicates |
permlib::SymmetricGroup< PERM > | Representation of a symmetric group |
permlib::SymmetricGroupTransversal< PERM > | Transversal of a symmetric group |
permlib::SymmetricGroupType | Group type for symmetric groups |
permlib::Transversal< PERM > | Transversal base class corresponding to a base element ![]() |
permlib::Transversal< PERM >::TrivialAction | Action of a PERM on unsigned long element |
permlib::TrivialGroupType | Group type for a trivial permutation group |
permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS > | Insertion position after first non-trivial transversal |
permlib::TrivialSorter | A sorter that sorts a sequence in natural numerical order (1 < 2 < 3 < ...) |
permlib::TypeRecognition< PERM, TRANSVERSAL > | Class for a basic type recognition of permutation groups |
permlib::VectorStabilizerPredicate< PERM > | Predicate for the subgroup that stabilizes a given integer vector |
permlib::partition::VectorStabilizerSearch< BSGSIN, TRANSRET > | Subgroup search for a stabilizer of an integer vector based on partition backtracking |
permlib::WreathSymmetricGroupType | Group type for a wreath product of symmetric groups |