Stack-sorting preimages and 0-1-trees
Combinatorics
2026-04-01 v4
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.
Keywords
Cite
@article{arxiv.2505.18295,
title = {Stack-sorting preimages and 0-1-trees},
author = {Miklos Bona},
journal= {arXiv preprint arXiv:2505.18295},
year = {2026}
}
Comments
7 pages, 5 figures