Descents in \(t\)-sorted permutations

DOI10.4310/JOC.2020.v11.n3.a5zbMath1441.05005arXiv1904.02613OpenAlexW3024133592MaRDI QIDQ2188743

Colin Defant

Publication date: 11 June 2020

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

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

zbMATH Keywords

stack-sortingvalid hook configurationdescent permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (11)

Highly sorted permutations and Bell numbers ⋮ Polyurethane toggles ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ A lift of West's stack-sorting map to partition diagrams ⋮ Preimages under the Queuesort algorithm ⋮ Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ Counting 3-stack-sortable permutations ⋮ Troupes, cumulants, and stack-sorting

This page was built for publication: Descents in \(t\)-sorted permutations