scientific article; zbMATH DE number 7524066
From MaRDI portal
Publication:5074767
Cydril Banderier, Benjamin Hackl, Andrei Asinowski
Publication date: 10 May 2022
Full work available at URL: https://arxiv.org/abs/2003.04912
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 by shuffling methods and a queue, Sorting Cayley permutations with pattern-avoiding machines, Highly sorted permutations and Bell numbers, The pop-stack-sorting operator on Tamari lattices, Promotion sorting, Ungarian Markov chains, The image of the pop operator on various lattices, Semidistrim Lattices, Stack-sorting with consecutive-pattern-avoiding stacks, Meeting covered elements in \(\nu\)-Tamari lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Separable \(d\)-permutations and guillotine partitions
- Sorting twice through a stack
- 2N noncollinear points determine at least 2N directions
- Bounds for sorting by prefix reversal
- Generating functions for generating trees
- A combinatorial proof of J. West's conjecture
- Basic analytic combinatorics of directed lattice paths
- Pop-stacks in parallel
- The statistic ``number of udu's in Dyck paths
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
- Counting 3-stack-sortable permutations
- Théorie géométrique des polynômes eulériens
- Two-stack-sorting with pop stacks
- Eulerian Numbers
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Enumerating permutations sortable by \(k\) passes through a pop-stack
