On a Subposet of the Tamari Lattice
- 140 Downloads
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 a number of 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.
KeywordsTamari lattice Poset Four Color Theorem Semilattice
Unable to display preview. Download preview PDF.
- 1.Cooper, B., Rowland, E., Zeilberger, D.: Toward a language theoretic proof of the Four Color Theorem (2010). arXiv:1006.1324v1 [math.CO]
- 6.Knuth, D.E.: The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley Publishing Company, Reading, Massachusetts (1973)Google Scholar
- 12.Tamari, D.: Associativity theory and the theory of lists. Their applications from abstract algebra to the four-colour-map problem. In: Proceedings of the Seventeenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Fla., 1986), vol. 54, pp. 39–53 (1986)Google Scholar