PIE-sums: A combinatorial tool for partition theory

DOI10.1016/0097-3165(81)90057-1zbMath0466.10006OpenAlexW1986088805MaRDI QIDQ1155081

Daniel I. A. Cohen

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90057-1

zbMATH Keywords

partition identitiesrestricted partition functioninclusion-exclusion methodMöbius function identities

Mathematics Subject Classification ID

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

Related Items (8)

Partition bijections, a survey ⋮ Bijections for partition identities ⋮ A class of lattices with Möbius function \(\pm 1,0\) ⋮ A generalization of Sylvester's identity ⋮ The chromatic generating function ⋮ Bijective proofs of some classical partition identities ⋮ Complementary Schur asymptotics for partitions ⋮ Sieve equivalence in generalized partition theory

Cites Work

• Some sieves for partition theory
• On representations of the braid group
• Unnamed Item
• Unnamed Item

This page was built for publication: PIE-sums: A combinatorial tool for partition theory