betaFeedback

WorksMathematics

Partitions with designated summands: kk-tuples and their congruences

Abstract

Let Ak(n)A_k(n) and Bk(n)B_k(n) be the numbers of ordered kk-tuples of partitions with designated summands, respectively with designated summands and all parts odd, of total size nn. Using an exact description of the generating function of designated partitions after a 33-dissection, we classify for every ee the values of kk for which Ak(3n+2)A_k(3n+2) is divisible by 3e3^e: this happens exactly when k≡0k\equiv0 or −5(mod3e)-5\pmod{3^e} if e≤4e\le4, and when 3e∣k3^e\mid k if e≥5e\ge5. We obtain the corresponding exact 33-adic and several 22-adic results for BkB_k and for AkA_k along the progressions 4n+34n+3, a recursion for the classes 3b(3n+s)3^b(3n+s), and for k=2k=2 the congruences A2(12n+10)≡27f14f63/f2(mod81)A_2(12n+10)\equiv 27f_1^4f_6^3/f_2\pmod{81} in generating-function form. We relate the numbers Ak(n)A_k(n) modulo 33 and 99 to overpartitions, sums of squares and triangular numbers, give group-action proofs of some of the congruences, and close with several conjectures supported by computation.

Introduction

Since Ramanujan’s famous partition congruences p(5n+4)≡0(mod5)p(5n+4) \equiv0 \pmod{5}, p(7n+5)≡0(mod7)p(7n+5) \equiv0 \pmod{7}, and p(11n+6)≡0(mod11)p(11n+6) \equiv0 \pmod{11}, the arithmetic properties of restricted partition families have been a central focus in number theory. While traditional methods often rely on generating functions, modular forms, or combinatorial statistics like Dyson’s rank and the Andrews–Garvan crank, looking at kk-tuples (multipartitions) reveals deeper structures whose properties depend heavily on the pp-adic valuation of kk.

A prominent family in this area is partitions with designated summands, PD⁡(n)\operatorname{PD}(n), introduced by Andrews, Lewis, and Lovejoy, where exactly one part of each size is marked. Their generating function is given by ∑PD⁡(n)qn=f6/(f1f2f3)\sum\operatorname{PD}(n)q^n = f_6/(f_1f_2f_3), where fk:=∏n=1∞(1−qkn)f_k := \prod_{n=1}^{\infty}(1-q^{kn}) denotes the standard eta-quotient. Figure 1 illustrates this combinatorial structure through Young diagrams for n=4n=4, where every block of equal rows contains a designated marked cell. Over time, these objects have been extensively studied using 3-dissections, cranks, and various congruence families. Similarly, restricting parts to be odd gives PDO⁡(n)\operatorname{PDO}(n), explored by Baruah and Ojah and later refined by Fu and Sellers.

Figure 1. The ten partitions with designated summands of n=4n = 4 (PD(4) = 10) represented via Young diagrams with designated dotted cells.

For bipartitions with designated summands, A2(n)=PD⁡−2(n)A_2(n)=\operatorname{PD}_{-2}(n), Naika and Shivashankar along with Hao and Shen proved several deep congruences modulo powers of 2 and 3. Motivated by these works, we study the families Ak(n)=PD⁡−k(n)A_k(n)=\operatorname{PD}_{-k}(n) and Bk(n)=PDO⁡−k(n)B_k(n)=\operatorname{PDO}_{-k}(n), which count ordered kk-tuples of designated partitions and odd-part designated partitions. Our approach starts with the 3-dissection of f1f2f_1f_2 using Hirschhorn’s classical methods, writing the main generating function as F=f6/(f1f2f3)=ΘP(u)F=f_6/(f_1f_2f_3)=\Theta P(u) with a quartic polynomial PP and explicit eta-quotients Θ\Theta and uu. This turns questions about Fk(mod3e)F^k \pmod{3^e} into finite checks on the coefficients of P(u)kP(u)^k.

Throughout this paper, we give a complete classification for every e≥1e \ge1 of the parameters kk where Ak(3n+2)≡0(mod3e)A_k(3n+2) \equiv0 \pmod{3^e} for all nn, and we provide level-wise recursions. We also prove exact formulas and new congruences for k=2k=2 that improve earlier results, such as $A_2(24n+23) \equiv 0 (mod 64) and A2(18n+15)≡0A_2(18n+15)\equiv0 (mod 32), alongside general congruences for Ak(4n+3)A_k(4n+3) and the exact 3-adic valuation v3(k)+1v_3(k)+1 for Bk(3n+2)B_k(3n+2) when 3∣k3\mid k. The rest of the paper explores combinatorial interpretations using Young diagrams, links to overpartitions and sums of squares, group-action proofs, and computational conjectures, all using elementary tools like Frobenius congruences and Lucas’ theorem.

Preliminaries and the structure of FF

In this section, we review basic notation. Let fm=(qm;qm)∞=∏j≥1(1−qmj)f_m=(q^m;q^m)_\infty=\prod_{j\geq1}(1-q^{mj}) for m≥1m\geq1. Products of the form ∏δ∣dfδrδ\prod_{\delta\mid d}f_\delta^{r_\delta} are called eta-quotients, which we use mainly for notation and dissection identities. We also frequently use standard product relations such as (−q;q)∞=f2/f1(-q;q)_\infty=f_2/f_1, (q;q2)∞=f1/f2(q;q^2)_\infty=f_1/f_2, and (−q;q2)∞=f22/(f1f4)(-q;q^2)_\infty=f_2^2/(f_1f_4).

Ramanujan’s theta functions are defined by φ(q)=∑m∈Zqm2=f52/(f2f42)\varphi(q)=\sum_{m\in\mathbb{Z}}q^{m^2}=f_5^2/(f_2f_4^2) and ψ(q)=∑m≥0qm(m+1)/2=f22/f1\psi(q)=\sum_{m\geq0}q^{m(m+1)/2}=f_2^2/f_1. We also use the Borwein cubic theta functions a(q)=∑m,nqm2+mn+n2a(q)=\sum_{m,n}q^{m^2+mn+n^2} and b(q)=f13/f3=12(3a(q3)−a(q))b(q)=f_1^3/f_3=\frac{1}{2}(3a(q^3)-a(q)) [2]. For comparison, we consider overpartitions p‾(n)\overline{p}(n) with generating function f2/f12=1/φ(−q)f_2/f_1^2=1/\varphi(-q), and cubic partitions a(n)a(n) with generating function 1/(f1f2)1/(f_1f_2). For any partition family XX, we write X−k(n)X_{-k}(n) to denote the number of kk-tuples of total size nn, whose generating function is the kk-th power of the original one.

Recall that a partition with designated summands is defined by marking exactly one part of each size, which corresponds on its Young diagram to having exactly one row marked with a dot in each block of equal rows (Figure 1). Since a block of mm equal rows can be marked in mm ways, the generating function is given by

∑n≥0PD⁡(n)qn=∏t≥1(1+∑m≥1mqtm)=∏t≥1(1+qt(1−qt)2)=f6f1f2f3.\sum_{n\geq0}\operatorname{PD}(n)q^n=\prod_{t\geq1}\left(1+\sum_{m\geq1}mq^{tm}\right)=\prod_{t\geq1}\left(1+\frac{q^t}{(1-q^t)^2}\right)=\frac{f_6}{f_1f_2f_3}.

Similarly, when all parts are restricted to be odd, we obtain PDO⁡(n)\operatorname{PDO}(n), whose generating function is ∑n≥0PDO⁡(n)qn=f4f22/(f1f3f12)\sum_{n\geq0}\operatorname{PDO}(n)q^n=f_4f_2^2/(f_1f_3f_{12}).

Definition 2.1. For k≥1k\geq1, let Ak(n)=PD⁡−k(n)A_k(n)=\operatorname{PD}_{-k}(n) and Bk(n)=PDO⁡−k(n)B_k(n)=\operatorname{PDO}_{-k}(n), defined by their generating functions:

∑n≥0Ak(n)qn=Fk,F=f6f1f2f3=1+q+3q2+5q3+10q4+⋯ .\sum_{n\geq0}A_k(n)q^n=F^k,\qquad F=\frac{f_6}{f_1f_2f_3}=1+q+3q^2+5q^3+10q^4+\cdots.
∑n≥0Bk(n)qn=Gk,G=f4f62f1f3f12=1+q+2q2+4q3+5q4+⋯ .\sum_{n\geq0}B_k(n)q^n=G^k,\qquad G=\frac{f_4f_6^2}{f_1f_3f_{12}}=1+q+2q^2+4q^3+5q^4+\cdots.

The mm-dissection of a series ∑cnqn\sum c_nq^n splits it into ∑r=0m−1qrDr(qm)\sum_{r=0}^{m-1}q^rD_r(q^m), where Dr(qm)=∑n≡r (m)cnqn−rD_r(q^m)=\sum_{n\equiv r\ (m)}c_nq^{n-r}. For m=2m=2, this gives the even and odd parts. We use the classical 2- and 3-dissections of eta-quotients due to Hirschhorn [3], which we cite as needed.

References

  1. [1]G. E. Andrews, R. P. Lewis, J. Lovejoy, Partitions with designated summands, Acta Arith. 105 (2002), 51–66.DOI
  2. [2]J. M. Borwein, P. B. Borwein, F. G. Garvan, Some cubic modular identities of Ramanujan, Trans. Amer. Math. Soc. 343 (1994), 35–47.DOI
  3. [3]M. D. Hirschhorn, The Power of q, Developments in Mathematics 49, Springer, 2017.
  4. [4]N. D. Baruah, K. K. Ojah, Partitions with designated summands in which all parts are odd, Integers 15 (2015), #A9.DOI
  5. [5]W. Y. C. Chen, K. Q. Ji, H.-T. Jin, E. Y. Y. Shen, On the number of partitions with designated summands, J. Number Theory 133 (2013), 2929–2938.arxiv.org/abs/1208.2210
  6. [6]R. X. J. Hao, E. Y. Y. Shen, W. J. T. Zang, A rank of partitions with overline designated summands, Discrete Math. 344 (2021), no. 11, 112556.arxiv.org/abs/2004.03122
  7. [7]R. X. J. Hao, Combinatorial proofs of the Ramanujan type congruences modulo 3, Discrete Math. 345 (2022), no. 5, 112809.arxiv.org/abs/2103.02135
  8. [8]E. Y. Y. Shen, A crank of partitions with designated summands, Ramanujan J. 57 (2022), no. 2, 785–802.DOI
  9. [9]R. X. J. Hao, E. Y. Y. Shen, Congruences modulo 9 for bipartitions with designated summands, Turkish J. Math. 42 (2018), 2325–2335.DOI
  10. [10]M. S. Mahadeva Naika, C. Shivashankar, Arithmetic properties of bipartitions with designated summands, Bol. Soc. Mat. Mex. 24 (2018), 37–60.
  11. [11]M. S. Mahadeva Naika, T. Harishkumar, M. Prasad, T. N. Veeranayaka, Congruences for bipartitions with odd designated summands, South East Asian J. Math. Math. Sci. 19 (2023), no. 2, 1–26.DOI
  12. [14]S. Fu, J. A. Sellers, A refined view of a curious identity for partitions into odd parts with designated summands, arXiv:2505.21111 (2025).arxiv.org/abs/2505.21111

Paper details

vlnc:W_xb6683uy
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents