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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…