 |
Discrete Mathematics & Theoretical Computer Science |
Miklos Bona - Stack-sorting preimages and 0-1-trees
dmtcs:16393 - Discrete Mathematics & Theoretical Computer Science, March 26, 2026, vol. 28:1, Permutation Patterns 2025 - https://doi.org/10.46298/dmtcs.16393Stack-sorting preimages and 0-1-treesArticle
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
Source: arXiv.org:arXiv:2505.18295
Volume: vol. 28:1, Permutation Patterns 2025
Section: Special issues
Published on: March 26, 2026
Accepted on: February 28, 2026
Submitted on: August 22, 2025
Keywords: Combinatorics, 05A05, 05A15, 05A19
Consultation statistics
This page has been seen 75 times.
This article's PDF has been downloaded 51 times.