Postorder Preimages
Given a set $Y$ of decreasing plane trees and a permutation $\pi$, how many trees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometric constructions, we provide a method for answering this question for certain sets $Y$ and all permutations $\pi$. We then provide applications of ou...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2017-02-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/1428/pdf |
| _version_ | 1827323750578651136 |
|---|---|
| author | Colin Defant |
| author_facet | Colin Defant |
| author_sort | Colin Defant |
| collection | DOAJ |
| description | Given a set $Y$ of decreasing plane trees and a permutation $\pi$, how many
trees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometric
constructions, we provide a method for answering this question for certain sets
$Y$ and all permutations $\pi$. We then provide applications of our results to
the study of the deterministic stack-sorting algorithm. |
| first_indexed | 2024-04-25T01:58:37Z |
| format | Article |
| id | doaj.art-7d62ab1f51e04c698252bee0799fae30 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:58:37Z |
| publishDate | 2017-02-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-7d62ab1f51e04c698252bee0799fae302024-03-07T15:32:47ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502017-02-01Vol. 19 no. 1Combinatorics10.23638/DMTCS-19-1-31428Postorder PreimagesColin DefantGiven a set $Y$ of decreasing plane trees and a permutation $\pi$, how many trees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometric constructions, we provide a method for answering this question for certain sets $Y$ and all permutations $\pi$. We then provide applications of our results to the study of the deterministic stack-sorting algorithm.https://dmtcs.episciences.org/1428/pdfmathematics - combinatorics05a19, 05c05 |
| spellingShingle | Colin Defant Postorder Preimages Discrete Mathematics & Theoretical Computer Science mathematics - combinatorics 05a19, 05c05 |
| title | Postorder Preimages |
| title_full | Postorder Preimages |
| title_fullStr | Postorder Preimages |
| title_full_unstemmed | Postorder Preimages |
| title_short | Postorder Preimages |
| title_sort | postorder preimages |
| topic | mathematics - combinatorics 05a19, 05c05 |
| url | https://dmtcs.episciences.org/1428/pdf |
| work_keys_str_mv | AT colindefant postorderpreimages |