On a Subposet of the Tamari Lattice
Combinatorics
2019-07-25 v2
Abstract
We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within an interval of the comb poset: rotation distance, meets and joins, and the common parse words function for a pair of trees. We relate this poset to a partial order on the symmetric group studied by Edelman.
Keywords
Cite
@article{arxiv.1108.5690,
title = {On a Subposet of the Tamari Lattice},
author = {Sebastian A. Csar and Rik Sengupta and Warut Suksompong},
journal= {arXiv preprint arXiv:1108.5690},
year = {2019}
}
Comments
21 pages