Given a set $Y$ of decreasing plane trees and a permutation $\pi$, how manytrees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometricconstructions, we provide a method for answering this question for certain sets$Y$ and all permutations $\pi$. We then provide applications of our results tothe study of the deterministic stack-sorting algorithm.Comment: 15 pages, 4 figure
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
\u3cp\u3eWe consider the following question: How many edgedisjoint plane spanning trees are containe...
In this paper we find the generating function for the number of vertices that have k elements in the...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
Defant, Engen, and Miller defined a permutation to be uniquely sorted if ithas exactly one preimage ...
International audienceWe study preimages of permutations under the bubblesort operator $\mathbf{B}$....
There exists a bijection between one-stack sortable permutations (permutations which avoid the patte...
© 2018 Dr Andrew Elvey PriceIn this thesis we consider a number of enumerative combinatorial problem...
Abstract. At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutatio...
AbstractThe problem of counting plane trees with n edges and an even or an odd number of leaves has ...
We study the polytopes that arise from the convex hulls of stack-sorting on particular permutations....
International audienceThe number of embeddings of a partially ordered set $S$ in a partially ordered...
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As ...
Abstract. The problem of counting plane trees with n edges and an even or an odd number of leaves wa...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
\u3cp\u3eWe consider the following question: How many edgedisjoint plane spanning trees are containe...
In this paper we find the generating function for the number of vertices that have k elements in the...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
Defant, Engen, and Miller defined a permutation to be uniquely sorted if ithas exactly one preimage ...
International audienceWe study preimages of permutations under the bubblesort operator $\mathbf{B}$....
There exists a bijection between one-stack sortable permutations (permutations which avoid the patte...
© 2018 Dr Andrew Elvey PriceIn this thesis we consider a number of enumerative combinatorial problem...
Abstract. At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutatio...
AbstractThe problem of counting plane trees with n edges and an even or an odd number of leaves has ...
We study the polytopes that arise from the convex hulls of stack-sorting on particular permutations....
International audienceThe number of embeddings of a partially ordered set $S$ in a partially ordered...
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As ...
Abstract. The problem of counting plane trees with n edges and an even or an odd number of leaves wa...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
\u3cp\u3eWe consider the following question: How many edgedisjoint plane spanning trees are containe...
In this paper we find the generating function for the number of vertices that have k elements in the...
DOI
Add to ORKG