Symmetry and unimodality in t-stack sortable permutations
From MaRDI portal
Publication:1601431
The author considers the sequence \(W_t(n,k)\) of the numbers of \(t\)-stack sortable permutations with \(k\) descents. The proof is constructive and shows that \(W_t(n,k)\) is symmetric and unimodal.
Cites work
- A bijective census of nonseparable planar maps
- A combinatorial proof of J. West's conjecture
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- A self-dual poset on objects counted by the Catalan numbers and a type-B analogue
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Sorting twice through a stack
- Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Unimodality and the reflection principle
Cited in
(23)- A simplicial complex of 2-stack sortable permutations
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
- Polyurethane toggles
- Stack-sorting preimages of permutation classes
- Counting 3-stack-sortable permutations
- Preimages under the stack-sorting algorithm
- A unified approach to polynomial sequences with only real zeros
- Descents and des-Wilf equivalence of permutations avoiding certain nonclassical patterns
- Actions on permutations and unimodality of descent polynomials
- Lattice paths and \((n - 2)\)-stack sortable permutations
- New equivalences for pattern avoiding involutions
- Revstack sort, zigzag patterns, descent polynomials of t-revstack sortable permutations, and Steingrímsson's sorting conjecture
- Pop-stack-sorting for Coxeter groups
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
- Lattice paths and pattern-avoiding uniquely sorted permutations
- Fertility, Strong Fertility, and Postorder Wilf Equivalence
- Asymptotic normality in t-stack sortable permutations
- On linear transformations preserving the Pólya frequency property
- Sorting with networks of data structures
- Fertilitopes
- Descent generating polynomials for (n - 3)- and (n - 4)-stack-sortable (pattern-avoiding) permutations
- Boolean-Narayana numbers
- On the real-rootedness of the descent polynomials of (n-2)-stack sortable permutations
This page was built for publication: Symmetry and unimodality in \(t\)-stack sortable permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601431)
