Supersolvable LL-lattices of binary trees

Simple item page
dc.creatorBiagioli, Riccardo
dc.creatorChapoton, Frederic
dc.date2003-04-09
dc.date.accessioned2026-07-07T04:56:45Z
dc.date.available2026-07-07T04:56:45Z
dc.descriptionSome 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.
dc.description16 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/math/0304132
dc.identifierhttp://arxiv.org/abs/math/0304132
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67037
dc.subjectCombinatorics
dc.subjectMSC : 06B, 06A08, 05C05
dc.titleSupersolvable LL-lattices of binary trees
dc.typetext

Files

Collections

arXiv