Geodesic
Postorder Preimages
Discrete mathematics & theoretical computer science, Tome 19 (2017-2018) no. 1

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2017_19_1_a0,
     author = {Defant, Colin},
     title = {Postorder {Preimages}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2017-2018},
     doi = {10.23638/DMTCS-19-1-3},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-1-3/}
}
TY  - JOUR
AU  - Defant, Colin
TI  - Postorder Preimages
JO  - Discrete mathematics & theoretical computer science
PY  - 2017-2018
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-1-3/
DO  - 10.23638/DMTCS-19-1-3
LA  - en
ID  - DMTCS_2017_19_1_a0
ER  - 
%0 Journal Article
%A Defant, Colin
%T Postorder Preimages
%J Discrete mathematics & theoretical computer science
%D 2017-2018
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-1-3/
%R 10.23638/DMTCS-19-1-3
%G en
%F DMTCS_2017_19_1_a0
Defant, Colin. Postorder Preimages. Discrete mathematics & theoretical computer science, Tome 19 (2017-2018) no. 1. doi: 10.23638/DMTCS-19-1-3

Cité par Sources :