A weighted enumeration of maximal chains in the Bruhat order

DOI10.1023/A:1015068609503zbMath1008.20037MaRDI QIDQ1604772

John R. Stembridge

Publication date: 8 July 2002

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

root systemsfinite Weyl groupsmaximal chainsBruhat orderssums of weights

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Related Items

An involution on RC-graphs and a conjecture on dual Schubert polynomials by Postnikov and Stanley ⋮ Counting weighted maximal chains in the circular Bruhat order ⋮ On linear Hodge-Newton decomposition for reductive monoids. ⋮ Weighted enumeration of Bruhat chains in the symmetric group ⋮ A bijective proof of Macdonald's reduced word formula ⋮ Unnamed Item ⋮ An analogue of the Robinson-Schensted-Knuth correspondence and non-symmetric Cauchy kernels for truncated staircases ⋮ Power sum decompositions of defining equations of reflection arrangements ⋮ Unnamed Item ⋮ The cross-section of a spherical double cone ⋮ A combinatorial duality between the weak and strong Bruhat orders ⋮ Chains in the Bruhat order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial models for Weyl characters
• Minuscule elements of Weyl groups, the numbers game, and \(d\)-complete posets
• A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras
• Bruhat lattices, plane partition generating functions, and minuscule representations
• Introduction to Lie Algebras and Representation Theory
• Minuscule elements of Weyl groups