Highest Weight Crystals

class sage.categories.highest_weight_crystals.HighestWeightCrystals(s=None)

Bases: sage.categories.category.Category

The category of highest weight crystals.

A crystal is highest weight if it is acyclic; in particular, every connected component has a unique highest weight element, and that element generate the component.

EXAMPLES:

sage: C = HighestWeightCrystals()
sage: C
Category of highest weight crystals
sage: C.super_categories()
[Category of crystals]
sage: C.example()
Highest weight crystal of type A_3 of highest weight omega_1

TESTS:

sage: TestSuite(C).run()
sage: B = HighestWeightCrystals().example()
sage: TestSuite(B).run(verbose = True)
running ._test_an_element() . . . pass
running ._test_category() . . . pass
running ._test_elements() . . .
  Running the test suite of self.an_element()
  running ._test_category() . . . pass
  running ._test_eq() . . . pass
  running ._test_not_implemented_methods() . . . pass
  running ._test_pickling() . . . pass
  pass
running ._test_elements_eq() . . . pass
running ._test_enumerated_set_contains() . . . pass
running ._test_enumerated_set_iter_cardinality() . . . pass
running ._test_enumerated_set_iter_list() . . . pass
running ._test_eq() . . . pass
running ._test_fast_iter() . . . pass
running ._test_not_implemented_methods() . . . pass
running ._test_pickling() . . . pass
running ._test_some_elements() . . . pass
class ElementMethods
to_highest_weight(list=[], index_set=None)

Yields the highest weight element u and a list [i_1,...,i_k] such that self = f_{i_1} ... f_{i_k} u, where i_1,...,i_k are elements in index_set. By default the index set is assumed to be the full index set of self.

EXAMPLES:

sage: T = CrystalOfTableaux(['A',3], shape = [1])
sage: t = T(rows = [[3]])
sage: t.to_highest_weight()
[[[1]], [2, 1]]
sage: t.to_highest_weight()
[[[1]], [2, 1]]
sage: T = CrystalOfTableaux(['A',3], shape = [2,1])
sage: t = T(rows = [[1,2],[4]])
sage: t.to_highest_weight()
[[[1, 1], [2]], [1, 3, 2]]
sage: t.to_highest_weight(index_set = [3])
[[[1, 2], [3]], [3]]
class HighestWeightCrystals.ParentMethods
highest_weight_vector()

Returns the highest weight vector if there is a single one; otherwise, raises an error.

Caveat: this assumes that highest_weight_vector() returns a list or tuple.

EXAMPLES:

sage: C = CrystalOfLetters(['A',5])
sage: C.highest_weight_vector()
1
highest_weight_vectors(*args, **kwds)

Returns the highest weight vectors of self

This default implementation selects among the module generators those that are highest weight, and cache the result.

EXAMPLES:

sage: C = CrystalOfLetters(['A',5])
sage: C.highest_weight_vectors()
[1]
sage: C = CrystalOfLetters(['A',2])
sage: T = TensorProductOfCrystals(C,C,C,generators=[[C(2),C(1),C(1)],[C(1),C(2),C(1)]])
sage: T.highest_weight_vectors()
[[2, 1, 1], [1, 2, 1]]
HighestWeightCrystals.example()

Returns an example of highest weight crystals, as per Category.example().

EXAMPLES:

sage: B = HighestWeightCrystals().example(); B
Highest weight crystal of type A_3 of highest weight omega_1
HighestWeightCrystals.super_categories(*args, **kwds)

EXAMPLES:

sage: HighestWeightCrystals().super_categories()
[Category of crystals]

Previous topic

Hecke modules

Next topic

HopfAlgebras

This Page