Deterministic stack-sorting for set partitions
From MaRDI portal
(Redirected from Publication:6659993)
Deterministic stack-sorting for set partitions (scientific article; zbMATH DE number 7964449)
Deterministic stack-sorting for set partitions (scientific article; zbMATH DE number 7964449)
Recommendations
Cites work
- 2-stack sorting is polynomial
- A stack and pop stack in series
- A survey of stack-sorting disciplines
- Counting 3-stack-sortable permutations
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Generatingfunctionology
- scientific article; zbMATH DE number 3722110 (Why is no real title available?)
- Permutations sortable by \(n - 4\) passes through a stack
- Pop-stack-sorting for Coxeter groups
- Pop-stacks in parallel
- Restricted stacks as functions
- Sorting Cayley permutations with pattern-avoiding machines
- Stack sorting with restricted stacks
- Stack-sorting for Coxeter groups
- Stack-sorting for words
- Stack-sorting with consecutive-pattern-avoiding stacks
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Treatise on the approximation of functions of very large numbers and on a class comprising series expansions.
- Troupes, cumulants, and stack-sorting
Cited in
(2)
This page was built for publication: Deterministic stack-sorting for set partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659993)