Depth in classical Coxeter groups

DOI10.1007/S10801-016-0683-9zbMATH Open1350.05178arXiv1507.01180OpenAlexW2217932769MaRDI QIDQ345151FDOQ345151

Eli Bagno, Alexander Woo, Riccardo Biagioli, Mordechai Novick

Publication date: 25 November 2016

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

Abstract: The depth statistic was defined by Petersen and Tenner for an element of an arbitrary Coxeter group in terms of factorizations of the element into a product of reflections. It can also be defined as the minimal cost, given certain prescribed edge weights, for a path in the Bruhat graph from the identity to an element. We present algorithms for calculating the depth of an element of a classical Coxeter group that yield simple formulas for this statistic. We use our algorithms to characterize elements having depth equal to length. These are the short-braid-avoiding elements. We also give a characterization of the elements for which the reflection length coincides with both the depth and the length. These are the boolean elements.

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

zbMATH Keywords

reflectionsCoxeter groupslengthBruhat graphdepths

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Combinatorics of Coxeter Groups
• Some combinatorial aspects of reduced words in finite Coxeter groups
• Some combinatorial properties of Schubert polynomials
• The sorting order on a Coxeter group.
• On minimal lengths of expressions of Coxeter group elements as products of reflections
• 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.
• Title not available (Why is that?)
• Fully commutative elements in finite and affine Coxeter groups
• Sorting orders, subword complexes, Bruhat order and total positivity
• The generating function for total displacement

Cited In (4)

• Affine Deligne-Lusztig varieties and quantum Bruhat graph
• Dimension formula for the affine Deligne-Lusztig variety \(X(\mu, b)\)
• Bargain hunting in a Coxeter group
• Canonical reduced words and signed descent length enumeration in Coxeter groups

   Recommendations

• Depth in Coxeter groups of type \(B\)
• The depth of a permutation.
• The generating function for the number of roots of a Coxeter group
• Computing reflection length in an affine Coxeter group
• Lengths of subsets in Coxeter groups.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345151)