Shortest path poset of Bruhat intervals

DOI10.1007/s10801-012-0416-7zbMath1273.05096MaRDI QIDQ372833

Saúl A. Blanco

Publication date: 21 October 2013

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

Full work available at URL: https://hal.inria.fr/hal-01215085/file/dmAO0118.pdf

zbMATH Keywords

shortest paths; Bruhat order; Bruhat graph; \(\widetilde{R}\) -polynomials; complete cd-index

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

20F55: Reflection and Coxeter groups (group-theoretic aspects)

05C38: Paths and cycles

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

The 𝑐𝑑-index: A survey, Flip posets of Bruhat intervals, Balanced and Bruhat graphs, On the non-negativity of the complete \(cd\)-index

Uses Software

• coxeter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting Dyck paths by area and rank
• The complete \(\mathbf{cd}\)-index of dihedral and universal Coxeter groups
• On the structure of the lattice of noncrossing partitions
• Strong versions of Sperner's theorem
• Pattern avoidance and rational smoothness of Schubert varieties
• Quasisymmetric functions and Kazhdan-Lusztig polynomials.
• Decomposition theorem for the cd-index of Gorenstein posets
• On minimal lengths of expressions of Coxeter group elements as products of reflections
• Combinatorics of Coxeter Groups
• Combinatorial Expansions of Kazhdan-Lusztig Polynomials
• The cd-index of fans and posets