Remarks on direct computation for P(n,k)

MaRDI QIDQ1908954zbMATH OpenFDO

Authors Qiqi Wu

Publication date 22 August 1996

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

identitypartitionsrecurrence formula

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19)

Review text

Let \(P(n, k)\) and \(P(n)\) be the number of partitions of \(n\) into \(k\) parts greater than or equal to 1, and the number of all partitions of \(n\), respectively. All results deduced in this paper are simple consequences of the equality \(P(n, m)= P(n- m)\) holding for every \(m\geq n/2\). For example, \(P(2m, m)= P(2m+ s, m+ s)\) holds for any integer \(s\geq 0\) (Theorem 2.1) since both members are equal to \(P(m)\). Another identity proposed here is \[ P(2m- r- 1, m- r- 1)= P(m)- \sum^r_{t= 0} P(t) \] for every \(m\geq 3\) and \(0\leq r\leq m/2\).

Recommendations

• scientific article; zbMATH DE number 2197937
• Polynomial identities for partitions
• scientific article; zbMATH DE number 3133625
• On the calculation of P(n,k) and its good field

Cited in

(4)

• Partition identities involving gaps and weights. II
• On the calculation of P(n,k) and its good field
• scientific article; zbMATH DE number 1829719 (Why is no real title available?)
• scientific article; zbMATH DE number 5233141 (Why is no real title available?)

This page was built for publication: Remarks on direct computation for \(P(n,k)\)

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