Depth in classical Coxeter groups

DOI10.1007/s10801-016-0683-9zbMath1350.05178arXiv1507.01180OpenAlexW2217932769MaRDI QIDQ345151

Eli Bagno, Alexander Woo, Riccardo Biagioli, Mordechai Novick

Publication date: 25 November 2016

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

Full work available at URL: https://arxiv.org/abs/1507.01180

zbMATH Keywords

Coxeter groupslengthreflectionsBruhat graphdepths

Mathematics Subject Classification ID

Related Items (2)

Dimension formula for the affine Deligne-Lusztig variety \(X(\mu, b)\) ⋮ Affine Deligne-Lusztig varieties and quantum Bruhat graph

Cites Work

• Unnamed Item
• Unnamed Item
• Fully commutative elements in finite and affine Coxeter groups
• Sorting orders, subword complexes, Bruhat order and total positivity
• The generating function for total displacement
• The sorting order on a Coxeter group.
• Some combinatorial properties of Schubert polynomials
• Schubert varieties and short braidedness
• The enumeration of fully commutative elements of Coxeter groups
• The depth of a permutation.
• Pattern avoidance and the Bruhat order.
• On minimal lengths of expressions of Coxeter group elements as products of reflections
• Combinatorics of Coxeter Groups
• Some combinatorial aspects of reduced words in finite Coxeter groups

This page was built for publication: Depth in classical Coxeter groups