permlib
0.2.9
Library for permutation computations
|
representation of a symmetric group More...
#include <symmetric_group.h>
Public Types | |
typedef SymmetricGroupTransversal< PERM > | TRANS |
transversal type used for the BSGS representation | |
![]() | |
typedef PERM | PERMtype |
permutation type used by this BSGS | |
typedef SymmetricGroupTransversal< PERM > | TRANStype |
transversal type used by this BSGS | |
typedef std::list< typename PERM::ptr > | PERMlist |
Public Member Functions | |
SymmetricGroup (unsigned int n) | |
constructs a symmetric group of degree n | |
SymmetricGroup (const SymmetricGroup< PERM > &symGroup) | |
copy constructor | |
SymmetricGroup & | operator= (const SymmetricGroup< PERM > &symGroup) |
assignment operator | |
virtual bool | isSymmetricGroup () const |
true if this structure represents a symmetric group | |
![]() | |
virtual | ~BSGSCore () |
empty destructor | |
virtual bool | operator== (const BSGSCore< PERM, SymmetricGroupTransversal< PERM > > &bsgs) const |
checks for equality by internal id only More... | |
Additional Inherited Members | |
![]() | |
std::vector< dom_int > | B |
base ![]() | |
PERMlist | S |
strong generating set ![]() | |
std::vector< SymmetricGroupTransversal< PERM > > | U |
transversals ![]() | |
dom_int | n |
degree of group | |
![]() | |
BSGSCore (unsigned int id) | |
constructs empty data structure with given group id | |
BSGSCore (unsigned int id, dom_int n_, dom_int bSize) | |
constructs empty data structure with given group id, group degree n and base size n | |
BSGSCore (unsigned int id, const std::vector< dom_int > &B_, const std::vector< SymmetricGroupTransversal< PERM > > &U_, dom_int n_) | |
kind of copy constructor, initializes data structure with given data | |
![]() | |
int | m_id |
id of this BSGS instance | |
representation of a symmetric group
Dedicated data structure for a symmetric group because base and transversals are known in advance and easily computed. This group implementation uses a special transversal that computes transversal elements on demand.