atlas::bruhat::BruhatOrder Class Reference

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:

[legend]List of all members.

Public Member Functions
	BruhatOrder (const std::vector< set::SetEltList > &Hasse_diagram)
size_t	size () const
const set::SetEltList &	hasse (size_t x) const
	Returns row |x| of the Hasse diagram for the order.
unsigned long	n_comparable () const
	Returns the number of comparable pairs in the order.
const poset::Poset &	poset ()
	Returns the full poset relation.
Private Member Functions
void	fillPoset ()
	Computes the full poset from the stored Hasse diagram.
Private Attributes
std::vector< set::SetEltList >	d_hasse
	Hasse diagram for a Bruhat order.
poset::Poset	d_poset
	Poset relation.

---

Detailed Description

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

[Not seriously used in the present code; I'm not sure whether it is instantiated. The classes KGB and Block have manipulators fillBruhat that would create BruhatOrder classes, but they seem not to be called. DV 7/21/06]

[In fact the kgb::KGB and blocks::Block classes do contain members of type (pointer to) BruhatOrder, and methods fillBruhat that will create instances of BruhatOrder accessible from those classes, but these methods are never called. MvL 8 Nov 2006]

[Now instantiated by the new commands blockorder and kgborder.]

Definition at line 48 of file bruhat.h.

---

Constructor & Destructor Documentation

atlas::bruhat::BruhatOrder::BruhatOrder (  const std::vector< set::SetEltList > &  Hasse_diagram  )  [inline, explicit]

Definition at line 69 of file bruhat.h.

---

Member Function Documentation

void atlas::bruhat::BruhatOrder::fillPoset (   )  [private]

Computes the full poset from the stored Hasse diagram. Definition at line 32 of file bruhat.cpp. References d_hasse, d_poset, and atlas::poset::Poset::size().

const set::SetEltList& atlas::bruhat::BruhatOrder::hasse (  size_t  x  )  const [inline]

Returns row |x| of the Hasse diagram for the order. Definition at line 79 of file bruhat.h. Referenced by atlas::kgb_io::printBruhatOrder().

unsigned long atlas::bruhat::BruhatOrder::n_comparable (   )  const [inline]

Returns the number of comparable pairs in the order. Definition at line 86 of file bruhat.h. References atlas::poset::n_comparable_from_Hasse(). Referenced by atlas::kl_io::printAllKL(), and atlas::kgb_io::printBruhatOrder().

const poset::Poset& atlas::bruhat::BruhatOrder::poset (   )  [inline]

Returns the full poset relation. Definition at line 94 of file bruhat.h. Referenced by atlas::kgb::KGB::bruhatPoset(), and atlas::kl_io::printPrimitiveKL().

size_t atlas::bruhat::BruhatOrder::size (   )  const [inline]

Definition at line 75 of file bruhat.h. References atlas::poset::Poset::size(). Referenced by atlas::kgb_io::printBruhatOrder(), and atlas::kgb::KGB::size().

---

Member Data Documentation

std::vector<set::SetEltList> 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. Definition at line 57 of file bruhat.h. Referenced by fillPoset().

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. Definition at line 64 of file bruhat.h. Referenced by fillPoset().

---

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

• /home/r0/dav/atlas.dir/atlas3/sources/gkmod/bruhat.h
• /home/r0/dav/atlas.dir/atlas3/sources/gkmod/bruhat.cpp

---