The n-color partition function and some counting theorems

zbMATH Open1483.11223MaRDI QIDQ4958970FDOQ4958970

Nayandeep Deka Baruah, Subhajit Bandyopadhyay

Publication date: 15 September 2021

Full work available at URL: http://math.colgate.edu/~integers/v83/v83.pdf

Recommendations

• scientific article; zbMATH DE number 5233141
• scientific article; zbMATH DE number 7692844
• General congruences modulo 5 and 7 for colour partitions
• Another way to count colored Frobenius partitions
• scientific article; zbMATH DE number 2188470

zbMATH Keywords

arithmetic functioninteger partition\(n\)-color partition function

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Elementary theory of partitions (11P81)

Cites Work

• Enumerative combinatorics. Volume 2.
• Title not available (Why is that?)
• Rogers-Ramanujan identities for partitions with n copies of n
• Theory and Application of Plane Partitions. Part 2
• Theory and Application of Plane Partitions: Part 1
• Title not available (Why is that?)
• The partition function \(p(n)\) in terms of the classical Möbius function
• A Partition Identity Related to Stanley’s Theorem
• A note on a method of Erdős and the Stanley-Elder theorems

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Number of distinguishing colorings and partitions
• Multicolor containers, extremal entropy, and counting

This page was built for publication: The \(n\)-color partition function and some counting theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958970)