Supersolvable LL-lattices of binary trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
16 pages, 6 figures

Keywords

Combinatorics, MSC : 06B, 06A08, 05C05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/67037

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0304132
 http://arxiv.org/abs/math/0304132

Collections

arXiv