The depth of a permutation.

DOI10.4310/JOC.2015.v6.n1.a9zbMath1317.20040arXiv1202.4765OpenAlexW2963127579MaRDI QIDQ2345773

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

symmetric groupsCoxeter groupsfactorizationsproducts of reflectionsreflection lengthsdepth of permutations

Mathematics Subject Classification ID

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

Related Items (13)

Labelled well-quasi-order for permutation classes ⋮ Depth in classical Coxeter groups ⋮ Combinatorics of diagrams of permutations ⋮ Degenerate 0-Schur algebras and nil-Temperley-Lieb algebras ⋮ Network coding with flags ⋮ Structure of single-peaked preferences ⋮ The range of repetition in reduced decompositions ⋮ On permutations with bounded drop size ⋮ The generating function for total displacement ⋮ Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations ⋮ Unknotted cycles ⋮ Affine Deligne-Lusztig varieties and quantum Bruhat graph ⋮ Pattern-functions, statistics, and shallow permutations

Uses Software

• OEIS

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