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 等数据库收录! |
|