permlib::AbstractPermutationGroup Class Reference

A high level interface for a permutation group. More...

#include <abstract_permutation_group.h>

Inheritance diagram for permlib::AbstractPermutationGroup:

Public Types
typedef std::list< std::set < dom_int > >	OrbitList
	typedef for a list of orbits, each of which is a set

Public Member Functions
virtual	~AbstractPermutationGroup ()
	destructor
template<typename Integer >
Integer	order () const
	order of the group
boost::uint64_t	order () const
	order of the group
virtual AbstractPermutationGroup *	setStabilizer (const std::vector< dom_int > &s) const =0
	computes the stabilizer of a set
virtual OrbitList *	orbits () const =0
	computes all orbits
virtual OrbitList *	orbits (const std::vector< dom_int > &s) const =0
	computes all orbits which contain a given set of elements
virtual bool	isLexMinSet (const std::vector< dom_int > &setIndices, const std::vector< dom_int > &rankIndices) const =0
	checks whether a set is lexicographically minimal with respect to a given ordering of indices
virtual AbstractGroupType	type () const =0
	implementation type of this abstract class

Protected Member Functions
virtual void	transversalSizes (std::vector< unsigned long > &sizes) const =0
	fills a list with sizes of transversals along a stabilizer chain

Detailed Description

A high level interface for a permutation group.

Member Function Documentation

virtual bool permlib::AbstractPermutationGroup::isLexMinSet ( const std::vector< dom_int > &  setIndices, const std::vector< dom_int > &  rankIndices  ) const

pure virtual

checks whether a set is lexicographically minimal with respect to a given ordering of indices

Parameters

setIndices	indices of the set for which minimality has to checked
rankIndices	list of indices; the order of these indices defines a partial order on {1..n}

Returns

true iff set is minimal with respect to given ordering

Implemented in permlib::AbstractBSGS< TRANS >, and permlib::AbstractSymmetricProduct.

virtual OrbitList* permlib::AbstractPermutationGroup::orbits ( const std::vector< dom_int > &  s ) const

pure virtual

computes all orbits which contain a given set of elements

Parameters

s	set of elements of which orbit has to be computed; vector must be sorted

Returns

all orbits of the group which contain an elements from s

Implemented in permlib::AbstractBSGS< TRANS >, and permlib::AbstractSymmetricProduct.

virtual AbstractPermutationGroup* permlib::AbstractPermutationGroup::setStabilizer ( const std::vector< dom_int > &  s ) const

pure virtual

computes the stabilizer of a set

Parameters

s	set to be stabilized

Returns

stabilizer; may return this if set is already stabilized

Implemented in permlib::AbstractBSGS< TRANS >, and permlib::AbstractSymmetricProduct.

---

The documentation for this class was generated from the following file:

• include/permlib/abstract_permutation_group.h