A Dynkin diagram classification theorem arising from a combinatorial problem
- 30 November 1986
- journal article
- Published by Elsevier in Advances in Mathematics
- Vol. 62 (2) , 103-117
- https://doi.org/10.1016/0001-8708(86)90095-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Bruhat Lattices, Plane Partition Generating Functions, and Minuscule RepresentationsPublished by Elsevier ,2013
- Morphisms for the strong Sperner property of Stanley and GriggsLinear and Multilinear Algebra, 1984
- Quotients of peck posetsOrder, 1984
- Solution of Two Difficult Combinatorial Problems with Linear AlgebraThe American Mathematical Monthly, 1982
- Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner PropertySIAM Journal on Algebraic Discrete Methods, 1982
- Product partial orders with the sperner propertyDiscrete Mathematics, 1980
- On chains and Sperner k-families in ranked posets, IIJournal of Combinatorial Theory, Series A, 1980
- A sperner property preserved by productLinear and Multilinear Algebra, 1980
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner PropertySIAM Journal on Algebraic Discrete Methods, 1980