A simple and direct derivation for the number of noncrossing partitions

S. C. Liaw, H. G. Yeh, F. K. Hwang, G. J. Chang

研究成果: 雜誌貢獻期刊論文同行評審

6 引文 斯高帕斯(Scopus)

摘要

Kreweras considered the problem of counting noncrossing partitions of the set {1,2, ..., n}, whose elements are arranged into a cycle in its natural order, into p parts of given sizes n1,n2, ... ,np (but not specifying which part gets which size). He gave a beautiful and surprising result whose proof resorts to a recurrence relation. In this paper we give a direct, entirely bijective, proof starting from the same initial idea as Kreweras' proof.

原文???core.languages.en_GB???
頁(從 - 到)1579-1581
頁數3
期刊Proceedings of the American Mathematical Society
126
發行號6
DOIs
出版狀態已出版 - 1998

指紋

深入研究「A simple and direct derivation for the number of noncrossing partitions」主題。共同形成了獨特的指紋。

引用此