arXiv · 1701.05319
Convexity properties of the canonical S-graphs
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.
Explore related subjects
Keep this discovery
Anthony Joseph. 2017-01-19. Convexity properties of the canonical S-graphs. https://arxiv.org/abs/1701.05319
Cite the original work for its findings. Save a collection to share your selection of sources.