Constructions of representations of rank two semisimples Lie algebras with distributive lattices

被引:0
|
作者
Alverson, L. Wyatt, II [1 ]
Donnelly, Robert G. [1 ]
Lewis, Scott J. [1 ]
Pervine, Robert [1 ]
机构
[1] Murray State Univ, Dept Math & Stat, Murray, KY 42071 USA
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2006年 / 13卷 / 01期
关键词
distributive lattice; rank two semisimple Lie algebra; irreducible representation; weight basis; supporting graph; solitary basis; edge-minimal basis;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we have shown how the distributive lattices of order ideals taken from semistandard posets (we call these "semistandard lattices") can be used to obtain certain information about these irreducible representations. Here we show that some of these semistandard lattices can be used to present explicit actions of Lie algebra generators on weight bases (Theorem 5.1), which implies these particular semistandard lattices are supporting graphs. Our descriptions of these actions are explicit in the sense that relative to the bases obtained, the entries for the representing matrices of certain Lie algebra generators are rational coefficients we assign in pairs to the lattice edges. In Theorem 4.4 we show that if such coefficients can be assigned to the edges, then the assignment is unique up to products; we conclude that the associated weight bases enjoy certain uniqueness and extremal properties (the "solitary" and "edge-minimal" properties respectively). Our proof of this result is uniform and combinatorial in that it depends only on certain properties possessed by all semistandard posets. For certain families of semistandard lattices some of these results were obtained in previous papers; in Propostion 5.6 we explicitly construct new weight bases for a certain family of rank two symplectic representations. These results are used to help obtain in Theorem 5.1 the classification of those semistandard lattices which are supporting graphs.
引用
收藏
页数:44
相关论文
共 50 条