Permutations sortable by n - 4 passes through a stack
From MaRDI portal
Publication:659583
Abstract: We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a polynomial expression.
Recommendations
- Passing through a stack k times
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Passing through a stack \(k\) times with reversals
- Enumeration of permutations sorted with two passes through a stack and \(D_{8}\) symmetries
Cites work
Cited in
(16)- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
- Passing through a stack k times
- Passing through a stack \(k\) times with reversals
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
- \(k\)-pop stack sortable permutations and \(2\)-avoidance
- Fertility monotonicity and average complexity of the stack-sorting map
- Enumeration of permutations sorted with two passes through a stack and \(D_{8}\) symmetries
- Asymptotic normality in \(t\)-stack sortable permutations
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Deterministic stack-sorting for set partitions
- Counting 3-stack-sortable permutations
- Promotion sorting
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Highly sorted permutations and Bell numbers
- Stack-sorting with consecutive-pattern-avoiding stacks
This page was built for publication: Permutations sortable by \(n - 4\) passes through a stack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659583)
