Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last update: 30 November 2012
Paths
Let .
The straight line path to is the map
Let .
The concatention of maps
and is the map
given by
Let .
The r-stretch of a map
is the map given by
The reverse of a map
is the map given by
The weight of a map
is the endpoint of p,
Let
be the set of maps generated by the straight line paths by operations of concatenation,
stretching and reversing.
A path is an element of in .
Let be a set of paths (a subset of
). The character of
is the element of
given by
A crystal is the set of paths that is closed
under the action of the root operators
which are defined and constructed below, in Proposition 5.7 and Theorem 5.8.
The crystal graph of B is the graph with
i-strings
Let be a crystal. Let
and fix ,
().
The i-string of is the set of paths
generated from by applications of the operators
and .
The head of
is
such that .
The tail of
is
such that .
The weights of the paths in
are
and the crystal graph of
is
where
so that
and .
Notes and References
These notes are intended to supplement various lecture series given by Arun Ram.
This is a typed version of sections 5.2 and 5.3 of the paper [Ram2006].