NORTHEASTERNUNIVERSITY
MATHEMATICSDEPARTMENT


Geometry-Algebra-Singularities-Combinatorics 
Seminar

 
A polytope combinatorics for semisimple group

 

Jared Anderson

(University of Massachusetts at Amherst)



 
 
 
 
 
 
 

Northeastern University

511 Lake Hall

1:30 p.m., Monday, January 28, 2002

 
 
 

Abstract: We describe a new combinatorics for representations of semisimple Lie groups, in terms of convex polytopes.  Although these polytopes arise from some geometry of Mirkovic and Vilonen in the loop Grassmannian, we will focus on the combinatorics.  We describe an explicit conjectural construction of the polytopes that also constructs the crystal graphs (where vertices are polytopes).  Weight multiplicities and tensor product multiplicities (Littlewood-Richardson numbers) may be found by counting polytopes.  We also discuss an algebra spanned by the polytopes, where the product is related to Minkowski sum.  (This is joint work with Ivan Mirkovic.) 

Home Web page: Alexandru I. Suciu Created: January 2, 2002
Maintained by:  Misha Kogan URL: http://www.math.neu.edu/~GASC/gas/anderson.html