AbstractThis paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams excluding E8 by constructing explicit combinatorial models of minuscule representations using only graph-theoretic ideas. This involves defining raising and lowering operators in a space of ideals of certain distributive lattices associated to sequences of vertices of the Dynkin diagram
To be a minuscule representation of a complex simple Lie algebra g is to be ‘as small as possible’: ...
Dynkin diagrams rst appeared in [20] in the connection with classication of simple Lie groups. Among...
Abstract. We prove that every Lie algebra can be decomposed into a solvable Lie algebra and a semisi...
AbstractThis paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams...
For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic ...
For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic ...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
Dynkin diagrams first appeared in [20] in the connection with classifica-tion of simple Lie groups. ...
A Lie algebra is a vector space with a bilinear form [—,—], called the Lie bracket, that satisfies t...
Constructing simply laced Lie algebras from extremal elements Jan Draisma and Jos in ’t panhuis For ...
Dynkin diagrams rst appeared in [20] in the connection with classication of simple Lie groups. Among...
AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to ...
To be a minuscule representation of a complex simple Lie algebra g is to be ‘as small as possible’: ...
Dynkin diagrams rst appeared in [20] in the connection with classication of simple Lie groups. Among...
Abstract. We prove that every Lie algebra can be decomposed into a solvable Lie algebra and a semisi...
AbstractThis paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams...
For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic ...
For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic ...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
For any finite graph G and any field K of characteristic unequal to 2, we construct an algebraic var...
Dynkin diagrams first appeared in [20] in the connection with classifica-tion of simple Lie groups. ...
A Lie algebra is a vector space with a bilinear form [—,—], called the Lie bracket, that satisfies t...
Constructing simply laced Lie algebras from extremal elements Jan Draisma and Jos in ’t panhuis For ...
Dynkin diagrams rst appeared in [20] in the connection with classication of simple Lie groups. Among...
AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to ...
To be a minuscule representation of a complex simple Lie algebra g is to be ‘as small as possible’: ...
Dynkin diagrams rst appeared in [20] in the connection with classication of simple Lie groups. Among...
Abstract. We prove that every Lie algebra can be decomposed into a solvable Lie algebra and a semisi...
DOI
Add to ORKG