Combinatorial enumeration of weighted Catalan numbers
Author(s)
An, Junkyu
DownloadFull printable version (2.250Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Mathematics.
Advisor
Alexander Postnikov.
Terms of use
Metadata
Show full item recordAbstract
This thesis is devoted to the divisibility property of weighted Catalan and Motzkin numbers and its applications. In Chapter 1, the definitions and properties of weighted Catalan and Motzkin numbers are introduced. Chapter 2 studies Wilf conjecture on the complementary Bell number, the alternating sum of the Stirling number of the second kind. Congruence properties of the complementary Bell numbers are found by weighted Motkin paths, and Wilf conjecture is partially proved. In Chapter 3, Konvalinka conjecture is proved. It is a conjecture on the largest power of two dividing weighted Catalan number, when the weight function is a polynomial. As a corollary, we provide another proof of Postnikov and Sagan of weighted Catalan numbers, and we also generalize Konvalinka conjecture for a general weight function.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010. Cataloged from PDF version of thesis. Includes bibliographical references (p. 69-70).
Date issued
2010Department
Massachusetts Institute of Technology. Department of MathematicsPublisher
Massachusetts Institute of Technology
Keywords
Mathematics.