Depth in classical Coxeter groups

DOI10.1007/S10801-016-0683-9MaRDI QIDQ345151zbMATH OpenOpenAlexFDO

Authors Eli Bagno, Riccardo Biagioli, Mordechai Novick, Alexander Woo

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

reflectionsCoxeter groupslengthBruhat graphdepths

Mathematics Subject Classification ID

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

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.

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.

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• Combinatorics of Coxeter Groups
• Fully commutative elements in finite and affine Coxeter groups
• On minimal lengths of expressions of Coxeter group elements as products of reflections
• Pattern avoidance and the Bruhat order.
• Schubert varieties and short braidedness
• Some combinatorial aspects of reduced words in finite Coxeter groups
• Some combinatorial properties of Schubert polynomials
• Sorting orders, subword complexes, Bruhat order and total positivity
• The depth of a permutation.
• The enumeration of fully commutative elements of Coxeter groups
• The generating function for total displacement
• The sorting order on a Coxeter group.

Cited in

(6)

• The depth of a permutation.
• Affine Deligne-Lusztig varieties and quantum Bruhat graph
• Dimension formula for the affine Deligne-Lusztig variety \(X(\mu, b)\)
• Depth in Coxeter groups of type \(B\)
• Bargain hunting in a Coxeter group
• Canonical reduced words and signed descent length enumeration 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)