Bijections and recurrences for integer partitions into a bounded number of parts

DOI10.1016/j.aml.2008.03.025zbMath1180.05014OpenAlexW2036330955MaRDI QIDQ1003857

Matteo Silimbani, Flavio Bonetti, Marilena Barnabei

Publication date: 4 March 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2008.03.025

zbMATH Keywords

generating functioninteger partitionFerrers diagram

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83) Elementary theory of partitions (11P81)

Related Items (3)

Unnamed Item ⋮ A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts ⋮ Quasipolynomials and maximal coefficients of Gaussian polynomials

Uses Software

• OEIS

Cites Work

• Partition bijections, a survey
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• A Note on Partitions and Triangles With Integer Sides
• Triangles with Integer Sides
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bijections and recurrences for integer partitions into a bounded number of parts