Deterministic stack-sorting for set partitions
From MaRDI portal
Publication:6659993
DOI10.54550/ECA2024V4S3R23MaRDI QIDQ6659993FDOQ6659993
Authors: Janabel Xia
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Recommendations
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Asymptotic enumeration (05A16)
Cites Work
- Generatingfunctionology
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- A survey of stack-sorting disciplines
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Title not available (Why is that?)
- Permutations sortable by \(n - 4\) passes through a stack
- Pop-stacks in parallel
- Stack-sorting with consecutive-pattern-avoiding stacks
- Stack sorting with restricted stacks
- 2-stack sorting is polynomial
- Counting 3-stack-sortable permutations
- Stack-sorting for words
- Restricted stacks as functions
- Troupes, cumulants, and stack-sorting
- Sorting Cayley permutations with pattern-avoiding machines
- Pop-stack-sorting for Coxeter groups
- Stack-sorting for Coxeter groups
- A stack and pop stack in series
- Treatise on the approximation of functions of very large numbers and on a class comprising series expansions.
Cited In (1)
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)