The partial order of dominant weights (Q1269462): Difference between revisions

The weight lattice of a crystallographic root system is partially ordered by the rule that \(\lambda>\mu\) if \(\lambda-\mu\) is a nonnegative integer linear combination of positive roots. The paper under review is devoted to combinatorial properties of the subposet \(\Lambda^+\) formed by the dominant weights. It is proved that \(\lambda\) covers \(\mu\) in \(\Lambda^+\) only if \(\lambda-\mu\) belongs to a distinguished subset of the positive roots. Also, if the root system is irreducible, it is proved that the Möbius function of \(\Lambda^+\) takes on only the values \(\{0, \pm 1, \pm 2\}\).