Bagno, Eli and Biagioli, Riccardo and Novick, Mordechai - Depth in Coxeter groups of type $B$

dmtcs:2457 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Depth in Coxeter groups of type $B$

Authors: Bagno, Eli and Biagioli, Riccardo and Novick, Mordechai

The depth statistic was defined for every Coxeter group in terms of factorizations of its elements into product of reflections. Essentially, the depth gives the minimal path cost in the Bruaht graph, where the edges have prescribed weights. We present an algorithm for calculating the depth of a signed permutation which yields a simple formula for this statistic. We use our algorithm to characterize signed permutations having depth equal to length. These are the fully commutative top-and-bottom elements defined by Stembridge. We finally give a characterization of the signed permutations in which the reflection length coincides with both the depth and the length.


Source : oai:HAL:hal-01337760v1
Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Submitted on: November 21, 2016
Keywords: length,depths,reflections,Coxeter groups,Bruhat graph,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 30 times.
This article's PDF has been downloaded 50 times.