A Combinatorial Construction for Simply–laced Lie Algebras

  title={A Combinatorial Construction for Simply–laced Lie Algebras},
  author={N. J. Wildberger},
This 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. 
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
20 Citations
15 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 15 references

The mutation game and Coxeter graphs

  • N. J. Wildberger
  • 2001
1 Excerpt

Dynkin diagram classification of λ-minuscule Bruhat lattices and of d-complete posets

  • R. A. Proctor
  • J. Algebraic Combin. 9,
  • 1999
2 Excerpts

Minuscule elements of Weyl groups, the numbers game, and d-complete posets

  • R. A. Proctor
  • J. Algebra 213,
  • 1999
2 Excerpts

Integrable boundaries, conformal boundary conditions and A−D −E fusion rules

  • R Behrend, P Pearce, Zuber, J-B
  • J. Phys. A,
  • 1998

Root lattices and weight lattices of exceptional simple Lie algebras of type

  • O. Hiroyuki
  • E Comment. Math. Univ. St. Paul 46,
  • 1997
1 Excerpt

Kronecker products, minuscule representations, and polynomial identities

  • M. Iosifescu, H. Scutaru
  • J. Math. Phys. 31,
  • 1990
1 Excerpt

Heaps of pieces I: Basic definitions and combinatorial lemmas, in ‘Combinatoire Énumérative

  • G. X. Viennot
  • (G. Labelle and P. Leroux, eds.),
  • 1985
1 Excerpt

Geometry of Coxeter groups, Research Notes in Mathematics, 54 Pitman(Advanced Publishing Program)

  • H. Hiller
  • 1982
2 Excerpts

Similar Papers

Loading similar papers…