TL;DR
This paper introduces a class of partially labeled trees to provide simple proofs for enumeration results related to stack-sorting preimages of permutation classes.
Contribution
It offers a novel combinatorial approach using partially labeled trees to simplify proofs of recent enumeration results.
Findings
Provided simplified proofs for two enumeration results
Introduced a new class of partially labeled trees
Enhanced understanding of stack-sorting preimages
Abstract
We define a class of partially labeled trees and use them to find simple proofs for two recent enumeration results of Colin Defant concerning stack-sorting preimages of permutation classes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.