Formulas for the number of k-colored partitions and the number of plane partitions of n in terms of the Bell polynomials

2020/09/09 by Sumit Kumar Jha, Jha, Sumit Kumar
Computer Science · Mathematics · #05A17 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Bayesian Methods and Mixture Models #FOS: Mathematics #General Mathematics (math.GM)

paper · pdf · doi:10.48550/arxiv.2009.04889

openalex publication_date 2020/09/09 · openalex created_date 2022/07/23 · openalex updated_date 2026/07/28

Abstract

We derive closed formulas for the number of k-coloured partitions and the number of plane partitions of n in terms of the Bell polynomials.

Related

• On partition polynomials and partition functions
• Asymptotics of various partitions
• Unordered Factorizations with k Parts
• Some identities on Lin-Peng-Toh's partition statistic of k-colored partitions
• The combinatorics of some two-color partition identities