The n-color partition function and some counting theorems
From MaRDI portal
Publication:4958970
Recommendations
Cites work
- scientific article; zbMATH DE number 3887638 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- A note on a method of Erdős and the Stanley-Elder theorems
- A partition identity related to Stanley's theorem
- Enumerative combinatorics. Volume 2.
- Rogers-Ramanujan identities for partitions with n copies of n
- The partition function \(p(n)\) in terms of the classical Möbius function
- Theory and Application of Plane Partitions. Part 2
- Theory and Application of Plane Partitions: Part 1
Cited in
(5)- Partitions with multiplicities associated with divisor functions
- scientific article; zbMATH DE number 7692844 (Why is no real title available?)
- Number of distinguishing colorings and partitions
- Multicolor containers, extremal entropy, and counting
- scientific article; zbMATH DE number 6999835 (Why is no real title available?)
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)