Convexity properties of the canonical S-graphs
Representation Theory
2017-01-20 v1
Abstract
Let n be a positive integer and c an n-tuple of natural numbers. A convex set in Euclidean n-space given by a family of linear relations in the elements of c and depending on their natural order is defined. The extremal elements of this convex set are shown to be the S-set obtained from the S-graph defined by c constructed in studying the Kashiwara crystal B associated to a Verma module for a Kac-Moody algebra. The result has applications to the precise description of B.
Keywords
Cite
@article{arxiv.1701.05319,
title = {Convexity properties of the canonical S-graphs},
author = {Anthony Joseph},
journal= {arXiv preprint arXiv:1701.05319},
year = {2017}
}