permlib::AbstractSymmetricProduct Class Reference

A high level interface implementing a direct product of symmetric groups. More...

#include <abstract_symmetric_product.h>

Inheritance diagram for permlib::AbstractSymmetricProduct:

List of all members.

Public Member Functions
template<typename InputIterator >
	AbstractSymmetricProduct (InputIterator begin, InputIterator end)
	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
Protected Member Functions
virtual void	transversalSizes (std::vector< unsigned long > &sizes) const
	fills a list with sizes of transversals along a stabilizer chain

---

Detailed Description

A high level interface implementing a direct product of symmetric groups.

---

Constructor & Destructor Documentation

template<typename InputIterator >

permlib::AbstractSymmetricProduct::AbstractSymmetricProduct	(	InputIterator	begin,
		InputIterator	end
	)		[inline]

constructor

The group is constructed from a list of lists. Each inner list contains an orbit of indices on which a symmetric group acts.

Parameters:

begin	begin iterator which in turn points to iterators
end	end iterator which in turn points to iterators

---

Member Function Documentation

bool permlib::AbstractSymmetricProduct::isLexMinSet	(	const std::vector< dom_int > &	setIndices,
		const std::vector< dom_int > &	rankIndices
	)		const [inline, 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.

AbstractPermutationGroup::OrbitList * permlib::AbstractSymmetricProduct::orbits

(

const std::vector< dom_int > &

s

)

const [inline, 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.

AbstractPermutationGroup * permlib::AbstractSymmetricProduct::setStabilizer

(

const std::vector< dom_int > &

s

)

const [inline, 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.

---

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

• include/permlib/abstract_symmetric_product.h