首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Supersolvable LL-lattices of binary trees
Authors:Riccardo Biagioli
Institution: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.
Keywords:Supersolvable lattice  Shellability  Charateristic polynomial
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号