Stack-sorting preimages and 0-1-trees
arXiv:2505.18295 · doi:10.46298/dmtcs.16393
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.
7 pages, 5 figures