Intended to represent the Bruhat order on K orbits on G/B, or on a block of representations. More...

#include <bruhat.h>

Collaboration diagram for atlas::bruhat::BruhatOrder:

Public Member Functions
	BruhatOrder (const std::vector< set::EltList > &Hasse_diagram)

size_t	size () const

const set::EltList &	hasse (size_t x) const
	Returns row \|x\| of the Hasse diagram for the order. More...

unsigned long	n_comparable () const
	Returns the number of comparable pairs in the order. More...

const poset::Poset &	poset ()
	Returns the full poset relation. More...

Private Member Functions
void	fillPoset ()
	Computes the full poset from the stored Hasse diagram. More...

Private Attributes
std::vector< set::EltList >	d_hasse
	Hasse diagram for a Bruhat order. More...

poset::Poset	d_poset
	Poset relation. More...

Detailed Description

Intended to represent the Bruhat order on K orbits on G/B, or on a block of representations.

In fact just stores any given relation as the Hasse diagram, and is capable of expanding the full poset by transitivity.

Constructor & Destructor Documentation

atlas::bruhat::BruhatOrder::BruhatOrder ( const std::vector< set::EltList > & Hasse_diagram )

inlineexplicit

void atlas::bruhat::BruhatOrder::fillPoset ( )

private

Computes the full poset from the stored Hasse diagram.

const set::EltList& atlas::bruhat::BruhatOrder::hasse ( size_t x ) const

inline

Returns row |x| of the Hasse diagram for the order.

unsigned long atlas::bruhat::BruhatOrder::n_comparable ( ) const

inline

Returns the number of comparable pairs in the order.

const poset::Poset& atlas::bruhat::BruhatOrder::poset ( )

inline

Returns the full poset relation.

size_t atlas::bruhat::BruhatOrder::size ( ) const

inline

std::vector<set::EltList> atlas::bruhat::BruhatOrder::d_hasse

private

Hasse diagram for a Bruhat order.

Entry #j lists the numbers of the immediate predecessors of element #j in the order.

poset::Poset atlas::bruhat::BruhatOrder::d_poset

private

Poset relation.

It is assumed that element #i can precede element #j in the poset only if i < j.

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