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: | Colin Defant |
---|---|
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 |
Similar Items
-
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
by: Colin Defant
Published: (2021-04-01) -
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
by: Colin Defant
Published: (2019-10-01) -
Patterns in Inversion Sequences I
by: Sylvie Corteel, et al.
Published: (2016-03-01) -
Row bounds needed to justifiably express flagged Schur functions with Gessel-Viennot determinants
by: Robert A. Proctor, et al.
Published: (2021-04-01) -
Growing and Destroying Catalan-Stanley Trees
by: Benjamin Hackl, et al.
Published: (2018-02-01)