Two-stack-sorting with pop stacks
From MaRDI portal
Publication:5197592
zbMath1419.05010arXiv1801.05005MaRDI QIDQ5197592
No author found.
Publication date: 19 September 2019
Full work available at URL: https://arxiv.org/abs/1801.05005
Related Items
Crystal pop-stack sorting and type \(A\) crystal lattices ⋮ Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ Coxeter pop-tsack torsing ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ \(k\)-pop stack sortable permutations and \(2\)-avoidance ⋮ The pop-stack-sorting operator on Tamari lattices ⋮ Counting Pop-Stacked Permutations in Polynomial Time ⋮ Ungarian Markov chains ⋮ The image of the pop operator on various lattices ⋮ Semidistrim Lattices ⋮ Fertility monotonicity and average complexity of the stack-sorting map ⋮ Unnamed Item ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Passing through a stack \(k\) times with reversals
Uses Software
Cites Work
- The enumeration of permutations sortable by pop stacks in parallel
- 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)\)!)
- Pop-stacks in parallel
- Restricted permutations and the wreath product
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
- A stack and a pop stack in series
- The on-line encyclopedia of integer sequences
- Formulae for Polyominoes on Twisted Cylinders
- Sorting Using Networks of Queues and Stacks
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Unnamed Item
- Unnamed Item
- Unnamed Item
