English

The poset of positive roots and its relatives

Combinatorics 2007-05-23 v1 Representation Theory

Abstract

Let Δ\Delta be a root system with a subset of positive roots, Δ+\Delta^+. We consider edges of the Hasse diagrams of some posets associated with Δ+\Delta^+. For each edge one naturally defines its type, and we study the partition of the set of edges into types. For Δ+\Delta^+, the type is a simple root, and for the posets of ad-nilpotent and Abelian ideals the type is an affine simple roots. We give several descriptions of the set of edges of given type and uniform expressions for the number of edges. By a result of Peterson, the number of Abelian ideals is 2n2^n, where nn is the rank of Δ\Delta. We prove that the number of edges of the corresponding Hasse diagram is (n+1)2n2(n+1)2^{n-2}. For Δ+\Delta^+ and the Abelian ideals, we compute the number of edges of each type and prove that the number of edges of type α\alpha depends only on the length of α\alpha.

Keywords

Cite

@article{arxiv.math/0502385,
  title  = {The poset of positive roots and its relatives},
  author = {Dmitri I. Panyushev},
  journal= {arXiv preprint arXiv:math/0502385},
  year   = {2007}
}

Comments

24 pages