The depth of a permutation.

DOI10.4310/JOC.2015.V6.N1.A9MaRDI QIDQ2345773zbMATH OpenOpenAlexFDO

Authors T. Kyle Petersen, Bridget Eileen Tenner

Publication date 20 May 2015

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

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

zbMATH Keywords

Coxeter groupsdepth of permutationsfactorizationsproducts of reflectionsreflection lengthssymmetric groups

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Abstract: For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection length. In this article, we focus on the case of the symmetric group, where we show that depth is equal to sum_i max{w(i)-i, 0}. We characterize those permutations for which depth equals length: these are the 321-avoiding permutations (and hence are enumerated by the Catalan numbers). We also characterize those permutations for which depth equals reflection length: these are permutations avoiding both 321 and 3412 (also known as boolean permutations, which we can hence also enumerate). In this case, it also happens that length equals reflection length, leading to a new perspective on a result of Edelman.

Recommendations

• Depth in Coxeter groups of type B
• Depth in classical Coxeter groups
• Pattern-functions, statistics, and shallow permutations
• Expected length of a product of random reflections.
• The enumeration of fully commutative elements of Coxeter groups

Cited in

(21)

• Network coding with flags
• Unknotted cycles
• Affine Deligne-Lusztig varieties and quantum Bruhat graph
• Pattern-functions, statistics, and shallow permutations
• Degenerate 0-Schur algebras and nil-Temperley-Lieb algebras
• The range of repetition in reduced decompositions
• Depth in Coxeter groups of type B
• Depth in classical Coxeter groups
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Labelled well-quasi-order for permutation classes
• On permutations with bounded drop size
• Structure of single-peaked preferences
• Bargain hunting in a Coxeter group
• Canonical reduced words and signed descent length enumeration in Coxeter groups
• Homomesy on permutations with toggling actions
• Bijective enumeration and sign-imbalance for permutation depth and excedances
• Some shallow elements of Coxeter groups of type B
• Coherent domains and improved lower bounds for the maximum size of Condorcet domains
• Coincidences between intervals in two partial orders on complex reflection groups
• The generating function for total displacement
• Combinatorics of diagrams of permutations

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: The depth of a permutation.

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