Shortest path poset of Bruhat intervals
DOI10.1007/S10801-012-0416-7zbMATH Open1273.05096OpenAlexW2000652571MaRDI QIDQ372833FDOQ372833
Authors: 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
Recommendations
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Reflection and Coxeter groups (group-theoretic aspects) (20F55)
Cites Work
- Combinatorics of Coxeter Groups
- Title not available (Why is that?)
- On the structure of the lattice of noncrossing partitions
- Poset topology: tools and applications
- Pattern avoidance and rational smoothness of Schubert varieties
- Quasisymmetric functions and Kazhdan-Lusztig polynomials.
- Flag enumeration in polytopes, Eulerian partially ordered sets and Coxeter groups
- Combinatorial Expansions of Kazhdan-Lusztig Polynomials
- The cd-index of fans and posets
- On minimal lengths of expressions of Coxeter group elements as products of reflections
- Counting Dyck paths by area and rank
- Strong versions of Sperner's theorem
- Decomposition theorem for the cd-index of Gorenstein posets
- Shortest path poset of Bruhat intervals
- Title not available (Why is that?)
- The complete \(\mathbf{cd}\)-index of dihedral and universal Coxeter groups
Cited In (6)
Uses Software
This page was built for publication: Shortest path poset of Bruhat intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372833)