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. (c) 2005 Elsevier B.V. All rights reserved.
Biagioli R, Chapoton F (2005). Supersolvable LL-lattices of binary trees. DISCRETE MATHEMATICS, 296, 1-13 [10.1016/j.disc.2005.03.005].
Supersolvable LL-lattices of binary trees
Biagioli R;
2005
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. (c) 2005 Elsevier B.V. All rights reserved.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
