a LaCIM, Université du Québec à Montréal, CP 8888 Succ. Centre Ville, Montréal, Canada H3C 3P8 b Institut Camille Jordan Université, Claude Bernard Lyon 1 21 Av., Claude Bernard, F-69622 Villeurbanne, France
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.