A high level interface implementing a group represented by a BSGS data structure. More...

#include <abstract_bsgs.h>

Inheritance diagram for permlib::AbstractBSGS< TRANS >:

Public Types
typedef BSGS< typename TRANS::PERMtype, TRANS >	PermutationGroup
	typedef for the BSGS type associated with this group

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

Public Member Functions
	AbstractBSGS (const boost::shared_ptr< PermutationGroup > &bsgs_, bool computeSupport=true)
	constructor

virtual AbstractPermutationGroup *	setStabilizer (const std::vector< dom_int > &s) const
	computes the stabilizer of a set

virtual OrbitList *	orbits () const
	computes all orbits

virtual OrbitList *	orbits (const std::vector< dom_int > &s) const
	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
	checks whether a set is lexicographically minimal with respect to a given ordering of indices

virtual AbstractGroupType	type () const
	implementation type of this abstract class

std::list< typename TRANS::PERMtype::ptr >	generators () const
	strong generating set of this permutation group

const boost::shared_ptr< PermutationGroup >	bsgs () const
	BSGS data structure for this permutation group.

template<typename Iterator >
AbstractPermutationGroup::OrbitList *	orbits (Iterator begin, Iterator end) const

Public Member Functions inherited from permlib::AbstractPermutationGroup
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
	fills a list with sizes of transversals along a stabilizer chain

template<typename Iterator >
OrbitList *	orbits (Iterator begin, Iterator end) const

helpers::BaseSupportRestriction *	supportRestriction (const std::vector< dom_int > &s) const
	returns a strategy to decide whether the action of this group is trivial on /s/

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

Detailed Description

template<typename TRANS>
class permlib::AbstractBSGS< TRANS >

A high level interface implementing a group represented by a BSGS data structure.

Constructor & Destructor Documentation

◆ AbstractBSGS()

template<typename TRANS >

permlib::AbstractBSGS< TRANS >::AbstractBSGS	(	const boost::shared_ptr< PermutationGroup > &	bsgs_,
		bool	computeSupport = `true`
	)

constructor

Parameters

bsgs_	the BSGS data structure that represents this group
computeSupport	if true, the support of the group is computed to accelerate stabilizer and lexMin computations

Member Function Documentation

◆ isLexMinSet()

template<class TRANS >

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

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

Implements permlib::AbstractPermutationGroup.

◆ orbits() [1/2]

template<class TRANS >

AbstractPermutationGroup::OrbitList * permlib::AbstractBSGS< TRANS >::orbits ( ) const

virtual

computes all orbits

Implements permlib::AbstractPermutationGroup.

◆ orbits() [2/2]

template<class TRANS >

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

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

Implements permlib::AbstractPermutationGroup.

◆ setStabilizer()

template<class TRANS >

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

virtual

computes the stabilizer of a set

Parameters

s	set to be stabilized

Returns: stabilizer; may return this if set is already stabilized

Implements permlib::AbstractPermutationGroup.

◆ transversalSizes()

template<class TRANS >

void permlib::AbstractBSGS< TRANS >::transversalSizes ( std::vector< unsigned long > & sizes ) const

protectedvirtual

fills a list with sizes of transversals along a stabilizer chain

Implements permlib::AbstractPermutationGroup.

◆ type()

template<typename TRANS >

virtual AbstractGroupType permlib::AbstractBSGS< TRANS >::type ( ) const

inlinevirtual

implementation type of this abstract class

Implements permlib::AbstractPermutationGroup.

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

include/permlib/abstract_bsgs.h

Public Types

Public Member Functions

Protected Member Functions

Detailed Description

Constructor & Destructor Documentation

◆ AbstractBSGS()

Member Function Documentation

◆ isLexMinSet()

◆ orbits() [1/2]

◆ orbits() [2/2]

◆ setStabilizer()

◆ transversalSizes()

◆ type()