Stanley--Elder--Fine theorems for colored partitions

MaRDI QIDQ6359999zbMATH OpenFDO

Authors Hartosh Singh Bal, Gaurav Bhatnagar

Publication date 5 February 2021

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Abstract: We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous results for $b$-colored partitions, where each part occurs in $b$ colors; for $b$-colored partitions with odd parts (or distinct parts); for partitions where the part $k$ comes in $k$ colors; and, overpartitions.

Recommendations

• Generating function and combinatorial proofs of Elder's theorem
• A Fine Rediscovery
• scientific article; zbMATH DE number 7069623
• A new refinement of Fine's partition theorem
• A Stanley-Elder theorem on cranks and Frobenius symbols

This page was built for publication: Stanley--Elder--Fine theorems for colored partitions

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