On the number of partitions with designated summands

From MaRDI portal
Publication:740844

DOI10.1016/J.JNT.2013.02.010zbMATH Open1295.05044arXiv1208.2210OpenAlexW2963457572MaRDI QIDQ740844FDOQ740844


Authors: William Y. C. Chen, Hai-Tao Jin, Erin Y. Y. Shen, Kathy Q. Ji Edit this on Wikidata


Publication date: 9 September 2014

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of n with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is divisible by 3. We obtain a Ramanujan type identity for the generating function of PD(3n+2) which implies the congruence of Andrews, Lewis and Lovejoy. For PD(3n), Andrews, Lewis and Lovejoy showed that the generating function can be expressed as an infinite product of powers of (1q2n+1) times a function F(q2). We find an explicit formula for F(q2), which leads to a formula for the generating function of PD(3n). We also obtain a formula for the generating function of PD(3n+1). Our proofs rely on Chan's identity on Ramanujan's cubic continued fraction and some identities on cubic theta functions. By introducing a rank for the partitions with designed summands, we give a combinatorial interpretation of the congruence of Andrews, Lewis and Lovejoy.


Full work available at URL: https://arxiv.org/abs/1208.2210




Recommendations




Cites Work


Cited In (24)





This page was built for publication: On the number of partitions with designated summands

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