A weighted enumeration of maximal chains in the Bruhat order
Given a finite Weyl group \(W\) with root system \(\Phi\), assign the weight \(\alpha\in\Phi\) to each covering pair in the Bruhat order related by the reflection corresponding to \(\alpha\). Extending this multiplicatively to chains, the author shows that the sum of the weights of all maximal chains in the Bruhat order has an explicit product formula: \[ \sum\text{wt}(x_0<\cdots<x_l)=|\Phi|!\prod_{\alpha\in\Phi}\alpha/\text{ht}(\alpha), \] where the sum ranges over all maximal-length chains in the Bruhat ordering of \(W\). Moreover, he proves a similar result for a weighted sum over maximal chains in the Bruhat ordering of any parabolic quotient of \(W\): \[ \sum\text{wt}_\lambda(\mu_0<\cdots<\mu_l)=|\Phi_\lambda|!\prod_{\alpha\in\Phi_\lambda}\langle\lambda,\alpha\rangle/\text{ht}(\alpha), \] where \(\lambda\in{\mathbf E}\) is dominant and \(\Phi_\lambda:=\{\alpha\in\Phi\mid\langle\lambda,\alpha\rangle>0\}\), and the sum ranges over all maximal-length chains in the Bruhat ordering of \((W\lambda,<)\).
- Counting weighted maximal chains in the circular Bruhat order
- Bruhat order on classical Weyl groups: minimal chains and covering relation.
- Tight quotients and double quotients in the Bruhat order.
- The Maximal Chains of the Extended Bruhat Orders on the × -Orbits of an Infinite Renner Monoid
- Chains in the Bruhat order
- A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras
- Bruhat lattices, plane partition generating functions, and minuscule representations
- Combinatorial models for Weyl characters
- scientific article; zbMATH DE number 3758599 (Why is no real title available?)
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 475642 (Why is no real title available?)
- scientific article; zbMATH DE number 1181673 (Why is no real title available?)
- Introduction to Lie Algebras and Representation Theory
- Minuscule elements of Weyl groups
- Minuscule elements of Weyl groups, the numbers game, and d-complete posets
- Chains in the Bruhat order
- A bijective proof of Macdonald's reduced word formula
- Bruhat order on classical Weyl groups: minimal chains and covering relation.
- The cross-section of a spherical double cone
- On linear Hodge-Newton decomposition for reductive monoids.
- An involution on RC-graphs and a conjecture on dual Schubert polynomials by Postnikov and Stanley
- 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
- A combinatorial duality between the weak and strong Bruhat orders
- On maximum chains in the Bruhat order of A(n,2)
- Counting weighted maximal chains in the circular Bruhat order
- Weighted enumeration of Bruhat chains in the symmetric group
- scientific article; zbMATH DE number 1075005 (Why is no real title available?)
- scientific article; zbMATH DE number 2115428 (Why is no real title available?)
- scientific article; zbMATH DE number 7640031 (Why is no real title available?)
- Murnaghan-type representations for the positive elliptic Hall algebra
This page was built for publication: A weighted enumeration of maximal chains in the Bruhat order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604772)