On the complete cd-index of a Bruhat interval.
Let \((W,S)\) be a Coxeter system and \(u<v\) two elements in \(W\) related in the Bruhat order. \textit{L. J. Billera} and \textit{F. Brenti} define a polynomial \(\widetilde\Psi_{u,v}(c,d)\) in the non-commuting variables \(c,d\), called the complete \(\mathbf{cd}\)-index of the interval \([u,v]\) [Isr. J. Math. 184, 317-348 (2011; Zbl 1269.20030)]. The author investigates if the coefficients of the polynomial \(\widetilde\Psi_{u,v}(c,d)\) are nonnegative by constructing for each interval \([u,v]\) in the Bruhat order and each \(\mathbf{cd}\)-monomial \(M\) a set of paths \(T_M(u,v)\), such that if a condition, called the flip condition, is satisfied, then the number of paths in \(T_M(u,v)\) is equal to the coefficient of \(M\) in the complete \(\mathbf{cd}\)-index \(\widetilde\Psi_{u,v}(c,d)\). He conjectures that the flip condition is true for all intervals and all monomials.
- Combinatorics of Coxeter Groups
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 529983 (Why is no real title available?)
- Proof of Cellini's conjecture on self-avoiding paths in Coxeter groups.
- Quasisymmetric functions and Kazhdan-Lusztig polynomials.
- The cd-index of fans and posets
- The cd-index of Bruhat intervals.
- Flip posets of Bruhat intervals
- Balanced and Bruhat graphs
- On the non-negativity of the complete \(cd\)-index
- Monomial nonnegativity and the Bruhat order
- Shortest path poset of Bruhat intervals
- Shortest path poset of Bruhat intervals
- The complete \(\mathbf{cd}\)-index of Boolean lattices
- The cd-index: a survey
- The complete \(\mathbf{cd}\)-index of dihedral and universal Coxeter groups
This page was built for publication: On the complete \(\mathbf{cd}\)-index of a Bruhat interval.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372824)