An observation on crystal graphsAlgebra & Discrete Mathematics
|Speaker:||Monica Vazirani, U C Davis|
|Start time:||Mon, May 9 2005, 3:10PM|
A crystal graph is a colored directed graph satisfying certain axioms. Stembridge gave a "local characterization" of those crystal graphs attached to highest weight modules of Lie algebras of simply laced type. In other words, he gave a purely graph-theoretic way of recognizing those graphs. In this talk, we observe another property these graphs have. Although not a characterizing property, it is surprising in its rigidity.