Stack-sorting preimages and 0-1-trees
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914434823225344 |
|---|---|
| author | Bona, Miklos |
| author_facet | Bona, Miklos |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_18295 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Stack-sorting preimages and 0-1-trees Bona, Miklos Combinatorics 05A05, 05A15, 05A19 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. |
| title | Stack-sorting preimages and 0-1-trees |
| topic | Combinatorics 05A05, 05A15, 05A19 |
| url | https://arxiv.org/abs/2505.18295 |