permlib
0.2.8
Library for permutation computations
|
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | A high level interface implementing a group represented by a BSGS data structure |
![]() ![]() ![]() | A high level interface for a permutation group |
![]() ![]() ![]() | A high level interface implementing a direct product of symmetric groups |
![]() ![]() ![]() | Represents a base and strong generating set (BSGS) |
![]() ![]() ![]() | Class that can be used to sort a strong generating set |
![]() ![]() ![]() | Core data of a base and strong generating set (BSGS) |
![]() ![]() ![]() | Abstract base class for base change algorithms |
![]() ![]() ![]() | Abstract base class for base transposition |
![]() ![]() ![]() | Base change by conjugation and, if necessary, transpositions |
![]() ![]() ![]() | Implementation of a deterministic base transposition algorithm |
![]() ![]() ![]() | Base change by constructing a new base with random schreier sims |
![]() ![]() ![]() | Implementation of a randomized base transposition algorithm |
![]() ![]() ![]() | Base change by a sequence of point insertions and transpositions |
![]() ![]() ![]() | Callable object to delete a pointer |
![]() ![]() ![]() | Base class for BSGS construction algorithms |
![]() ![]() ![]() | BSGS construction for a cyclic group of given order |
![]() ![]() ![]() | BSGS construction from a known base and strong generating set |
![]() ![]() ![]() | BSGS construction with Random Schreier-Sims algorithm |
![]() ![]() ![]() | BSGS construction with classic Schreier-Sims algorithm |
![]() ![]() ![]() | Stateful generator of BSGS elements |
![]() ![]() ![]() | Generates uniformly distributed random group elements based on an existing BSGS |
![]() ![]() ![]() | Interface for group element generators |
![]() ![]() ![]() | Generates nearly-uniformly distributed random group elements using the product replacement algorithm |
![]() ![]() ![]() | Abstract base class for random group element generators |
![]() ![]() ![]() | Generates a uniformly distributed random element of ![]() |
![]() ![]() ![]() | Stateful generator of Schreier generators |
![]() ![]() ![]() | Permutation class storing all values explicitly |
![]() ![]() ![]() | Permutation class storing permutations as words of elementary Permutation 's |
![]() ![]() ![]() | Predicate for the subgroup that arises as the intersection of two given groups |
![]() ![]() ![]() | Predicate matching a permutation if it stabilizes a given list of points pointwise |
![]() ![]() ![]() | 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) |
![]() ![]() ![]() | Predicate for the automorphisms of a symmetric matrix |
![]() ![]() ![]() | Predicate matching a permutation if it stabilizes a given list of points pointwise |
![]() ![]() ![]() | Coset-type predicate for group elements that map one set of points onto another given set of points |
![]() ![]() ![]() | Predicate for the subgroup that stabilizes a given point set |
![]() ![]() ![]() | Predicate matching points that are stabilized by given permutations |
![]() ![]() ![]() | Abstract base class for subgroup (and coset) predicates |
![]() ![]() ![]() | Predicate for the subgroup that stabilizes a given integer vector |
![]() ![]() ![]() | Helper class for primality checks |
![]() ![]() ![]() | Strategy for redundant base point insertion |
![]() ![]() ![]() | Insertion position after first non-trivial transversal |
![]() ![]() ![]() | Insertion position at first position i such that ![]() |
![]() ![]() ![]() | Base class for searching in a group |
![]() ![]() ![]() | Action of a permutation on a dynamic bitset |
![]() ![]() ![]() | Algorithm to find the lexicographically minimal set in an orbit |
![]() ![]() ![]() | A sorter that sorts a sequence with respect to a given input ordering |
![]() ![]() ![]() | A sorter that sorts a sequence (e.g. ![]() |
![]() ![]() ![]() | A sorter that sorts a sequence (e.g. ![]() |
![]() ![]() ![]() | A sorter that sorts a sequence of permutations with respect to a ordering induced by a base |
![]() ![]() ![]() | A sorter that sorts a sequence in natural numerical order (1 < 2 < 3 < ...) |
![]() ![]() ![]() | Representation of a symmetric group |
![]() ![]() ![]() | |
![]() ![]() ![]() | Tests a group given by generators for being an Alternating Group or a Symmetric Group |
![]() ![]() ![]() | Abstract base class for permutation group types |
![]() ![]() ![]() | Group type for a trivial permutation group |
![]() ![]() ![]() | Group type for a permutation group whose type could not be determined |
![]() ![]() ![]() | Abstract base class for named groups (such as cyclic and symmetric groups) |
![]() ![]() ![]() | Group type for symmetric groups |
![]() ![]() ![]() | Group type for alternating groups |
![]() ![]() ![]() | Group type for cyclic groups |
![]() ![]() ![]() | Group type for a wreath product of symmetric groups |
![]() ![]() ![]() | Group type for a direct product of two groups |
![]() ![]() ![]() | Tests a transitive group for which a strong generating set is availble for primitivity |
![]() ![]() ![]() | Tests a transitive group is availble for primitivity |
![]() ![]() ![]() | Class for a basic type recognition of permutation groups |
![]() ![]() ![]() | |
![]() ![]() ![]() | Fast recognition of symmetric group subgroups |
![]() ![]() ![]() | Transversal class that stores all transversal elements explicitly |
![]() ![]() ![]() | Abstract base class for orbit computation |
![]() ![]() ![]() | Stores an orbit in a sorted list |
![]() ![]() ![]() | Stores an orbit in a set for fast contains() operation |
![]() ![]() ![]() | Transversal class that stores transversal elements in a Schreier tree |
![]() ![]() ![]() | Transversal class that stores elements in a shallow Schreier tree |
![]() ![]() ![]() | Transversal of a symmetric group |
![]() ![]() ![]() | Transversal base class corresponding to a base element ![]() |
![]() ![]() | STL namespace |
![]() ![]() |