English

Two covering polynomials of a finite poset, with applications to root systems and ad-nilpotent ideals

Combinatorics 2012-05-22 v4 Representation Theory

Abstract

We introduce two polynomials (in qq) associated with a finite poset PP that encode some information on the covering relation in PP. If PP is a distributive lattice, and hence PP is isomorphic to the poset of dual order ideals in a poset LL, then these polynomials coincide and the coefficient of qq equals the number of kk-element antichains in LL. In general, these two covering polynomials are different, and we introduce a deviation polynomial of PP, which measures the difference between these two. We then compute all these polynomials in the case, where PP is one of the posets associated with an irreducible root system. These are 1) the posets of positive roots, 2) the poset of ad-nilpotent ideals, and 3) the poset of Abelian ideals.

Keywords

Cite

@article{arxiv.math/0502386,
  title  = {Two covering polynomials of a finite poset, with applications to root systems and ad-nilpotent ideals},
  author = {Dmitri I. Panyushev},
  journal= {arXiv preprint arXiv:math/0502386},
  year   = {2012}
}

Comments

23 pp, v3: considerable revision; v4: final version, to appear in" Journal of Combinatorics"