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


Chain enumeration and non-crossing partitions
Authors:Paul H. Edelman
Affiliation:Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Abstract:A formula is established for the number of chains with designated ranks in the non-crossing partition lattice. As corollaries, certain results of Kreweras are obtained. Non-crossing partitions are then generalized in two ways, and similar problems are solved.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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