Supersolvable LL-lattices of binary trees
Combinatorics
2007-05-23 v1
Abstract
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
Keywords
Cite
@article{arxiv.math/0304132,
title = {Supersolvable LL-lattices of binary trees},
author = {Riccardo Biagioli and Frederic Chapoton},
journal= {arXiv preprint arXiv:math/0304132},
year = {2007}
}
Comments
16 pages, 6 figures