The root posets and their rich antichains
Abstract
Let be a (connected) Dynkin diagram of rank and the corresponding root poset (it consists of all positive roots with respect to a fixed root basis). The width of is . We will show that is "conical": it is the disjoint union of solid chains. The rich antichains in are the antichains of cardinality . It is well known that the number of rich antichains is equal to the cardinality of . The set of rich antichains in can itself be considered as a poset which is quite similar, but not always isomorphic, to . We will show that there always exists a unique rich antichain such that any rich antichain is contained in the ideal generated by . For all roots in have the same length, namely , where are the exponents of For , the antichain consists of four roots of length and one root of length .
Cite
@article{arxiv.1306.1593,
title = {The root posets and their rich antichains},
author = {Claus Michael Ringel},
journal= {arXiv preprint arXiv:1306.1593},
year = {2018}
}
Comments
This is a completely revised version, now with reference to the exponents. The (n-1)-antichains are now called rich antichains and there is an outline in which way the root poset can be recovered from the set of rich antichains