Abstract
Let Ct(n) denote the number of partition quadruples of n with t-cores for t = 3,5,7,25. We establish some Ramanujan type congruences modulo 5, 7, 8 for Ct(n). For example, n ≥ 0, we have
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
A partition of a positive integer n is a non-increasing sequence of positive integers whose sum is n. The Ferrers-Young diagram of the partition λ of n is obtained by arranging n nodes in k left aligned rows so that the i th row has λi nodes. The nodes are labeled by row and column coordinates as one would label the entries of a matrix. Let \(\lambda ^{\prime }_{j}\) denote the number of nodes in column j. The hook number H(i,j) of the (i,j) node is defined as the number of nodes directly below and to the right of the node including the node itself, i.e., \(H(i, j)=\lambda _{i}+\lambda ^{\prime }_{j}-j-i+1\). A t-core is a partition with no hook number that are divisible by t.
For example, the Ferrers-Young diagram of the partition λ = (5,3,2) of 10 is
The nodes (1, 1), (1, 2), (1, 3), (1, 4), (1,5), (2, 1), (2, 2), (2, 3), (3, 1), and (3, 2) have hook numbers 7, 6, 4, 2, 1, 4, 3, 1, 2, and 1, respectively. Therefore, λ is a t-core partition for t = 5 and for all t ≥ 8.
Let at(n) be the number of partitions of n that are t-cores. Then, its generating function is given by [4, Eq. (2.1)]
Ramanujan’s three famous congruences of p(n) are as follows:
In [5, 6], Hischhorn and Sellers have studied the 4-core partition (i.e., a4(n)) and established some infinite families of arithmetic relations for a4(n). Baruah and Nath [1] have proved some more infinite families of arithmetic identities for a4(n).
A bipartition of n is a pair of partitions (λ1,λ2) such that the sum of all parts of λ1 and λ2 equals n. A bipartition with t-core of n is a bipartition (λ1,λ2) of n such that λ1 and λ2 are both t-cores. Let At(n) denote the number of bipartitions with t-cores of n. The generating function for At(n) is given by
Recently, Lin [8] has established some congruence and infinite families for A3(n). In [2], Baruah and Nath have found three infinite families of A3(n).
A partition \((\lambda _{1},\lambda _{2},\dots ,\lambda _{k})\) of a positive integer n is a k-tuple of partitions such that the sum of all the parts equals to n. A partition k-tuple of n with t-cores is a partition k-tuple \((\lambda _{1}, \lambda _{2},\dots , \lambda _{k})\) of n where each λi is t-core for \(i=1, 2, 3,\dots ,k\).
In 2015, Wang [10] has found several infinite families of arithmetic identities and congruences for partition triples with t-cores.
Motivated by the above works, we define Ct(n) to be the number of partition quadruples of n with t-cores. The generating function is given by
In this paper, we establish several congruences modulo 5, 7, and 8 for Ct(n). The main results can be found in Theorems 3.2, 3.3, 4.1, and 5.1.
2 Preliminaries
In this section, we list some identities which play a vital role in proving our main results.
For |ab| < 1, Ramanujan’s general theta function f(a,b) is defined as
The product representation of f(a,b) arises from Jacobi’s triple product identity [3, p. 35, Entry 19] as
Some special cases of f(a,b), known as Ramanujan’s theta functions, are
and
Lemma 2.1
[9, p. 212] We have the following 5-dissection
where
Lemma 2.2
For any prime p and positive integer n,
Lemma 2.3
The following 2-dissections hold:
Hirschhorn, Garvan, and Borwein [4] proved (2.3). Xia and Yao [12] gave a proof of (2.4) and in [11], they also proved (2.5) by employing an addition formula for theta functions.
Lemma 2.4
[3, p. 345, Entry 1 (iv)] We have the following 3-dissection
Lemma 2.5
The following 3-dissection holds:
One can find this identity in [7].
Lemma 2.6
[3, 3, p. 303, Entry 17 (v)] We have
where \(A(q):=\frac {f(-q^{3}, -q^{4})}{f(-q^{2})}\), \(B(q):=\frac {f(-q^{2}, -q^{5})}{f(-q^{2})}\) and \(C(q):=\frac {f(-q, -q^{6})}{f(-q^{2})}\).
In the following sections, with the aid of preliminary results, we prove our main results.
3 Congruence Modulo 8 for C3(n)
Theorem 3.1
For each n ≥ 0, we have
Proof
Setting t = 3 in (1.1), we have
Substituting (2.3) into (3.5), we get
Extracting the even terms of the above equation, one obtains
which yields
Substituting (2.5) into (3.7) and extracting the terms involving q2n and q2n+ 1, we get (3.1) and (3.3).
From (3.6), one gets
which implies that
Substituting (2.5) into (3.8) and extracting the even and odd terms of the above equation, we obtain (3.2) and (3.4). □
Theorem 3.2
For each α ≥ 0 and n ≥ 1, we have
Proof
From (3.3), we have
Using (2.2) in (3.12), one gets
Substituting (2.5) into (3.13), we have
Extracting the terms involving q2n+ 1 from (3.14), dividing by q and then replacing q2 by q,
Invoking (2.2) in (3.15), one obtains
Congruence (3.9) follows from (3.16).
From (3.16), we have
Congruence (3.10) easily follows from the above equation.
From (3.1), one gets
Invoking (2.2) in (3.18), we have
Substituting (2.3) into the second term of (3.19) and extracting the odd terms of the required equation
Using (2.2) in (3.20), one checks that
Extracting the terms involving q2n from (3.21) and then replacing q2 by q,
Invoking (2.2) in (3.22), we have
Using (3.23) and (3.19), one gets
By using mathematical induction on α, we obtain (3.11). □
Theorem 3.3
For α, β, and γ ≥ 0, we have
Proof
Extracting the terms involving q2n from (3.17) and replacing q2 by q,
(3.29) is the α = β = γ = 0 case of (3.24). Let us consider the case β = γ = 0. Suppose that the congruence (3.24) holds for some integer α ≥ 0. Substituting (2.6) in (3.24) with β = γ = 0,
which implies,
Therefore
which implies that (3.24) is true for α + 1. Hence, by induction, (3.24) is true for any non-negative integer α and β = γ = 0. Let us consider the case γ = 0. Suppose that the congruence (3.24) holds for some integer α, β ≥ 0. Substituting (2.1) in (3.24), we have
Extracting the terms involving q5n+ 3 from (3.30), we have
which yields
This implies that (3.24) is true for β + 1. Hence, by induction, (3.24) is true for α,β ≥ 0 and γ = 0. Now, suppose that the congruence (3.24) holds for some integers α, β, and γ ≥ 0. Substituting (2.7) in (3.24), we find that
Extracting the terms involving q7n+ 6 from (3.31), we get
which prove (3.25). Extracting the coefficient of q7n in (3.32), we arrive
which implies that (3.24) is true for γ + 1. Hence, by induction, (3.24) is true for any non-negative integers α, β, and γ. This completes the proof. Substituting (2.1) in (3.24), we get (3.26). Substituting (2.6) in (3.24) and then extracting q3n+ 1 and q3n, we obtain (3.27) and (3.28), respectively. □
Corollary 1
For α, β, and γ ≥ 0, p ∈{30,46,62,78,94,110}, q ∈{34,66}, r ∈{26,42, 58,74}, and s ∈{22,38}, we have
4 Congruence Modulo 5 for C5(n)
Theorem 4.1
For each n ≥ 0, we have
Proof
Setting t = 5 in (1.1), we get
Substituting (2.1) into (4.5), we have
Then, congruences (4.1) and (4.2) follow from (4.6).
Extracting the terms involving q5n+ 1 from (4.6), dividing by q and then replacing q5 by q,
Invoking (2.2) in (4.7), one gets
Again substituting (2.1) into (4.8), one gets
5 Congruence Modulo 7 for C7(n)
Theorem 5.1
For each n ≥ 0, we have
Proof
Setting t = 7 in (1.1),
Substituting (2.7) into (5.3), we get
6 Congruence Modulo 5 for C25(n)
Theorem 6.1
For each n ≥ 0, we have
Proof
Setting t = 25 in (1.1), we have
The rest of the proof is similar to the proof of Theorem 4.1. Therefore, we omitted the details. □
References
Baruah, N.D., Nath, K.: Infinite families of arithmetic identities for 4-cores. Bull. Aust. Math. Soc. 87(2), 304–315 (2013)
Baruah, N.D., Nath, K.: Infinite families of arithmetic identities and congruences for bipartitions with 3-cores. J. Number Theory 149, 92–104 (2015)
Berndt, B.C.: Ramanujan’s Notebooks Part, vol. III. Springer, New York (1991)
Hirschhorn, M.D., Garvan, F., Borwein, J.: Cubic analogs of the Jacobian cubic theta function 𝜃(z,q). Canad. J. Math. 45, 673–694 (1993)
Hirschhorn, M.D., Sellers, J.A.: Some amazing facts about 4-cores. J. Number Theory 60, 51–69 (1996)
Hirschhorn, M.D., Sellers, J.A.: Two congruences involving 4-cores. Electron J. Combin. 3(2), R 10 (1996)
Hirschhorn, M.D., Sellers, J.A.: A congruence modulo 3 for partitions into distinct non-multiples of four. J. Integer Sequen 17, Article 14.9.6 (2014)
Lin, B.L.S.: Some results on bipartitions with 3-core. J. Number Theory 139, 41–52 (2014)
Ramanujan, S.: Collected papers. Cambridge University Press, Cambridge (2000). reprinted by Chelsea, New York (1962), reprinted by the American mathematical society, Providence RI
Wang, L.: Arithmetic identities and congruences for partition triples with 3-cores. Int. J. Number Theory 12, 995 (2016)
Xia, E.X.W., Yao, O.X.M.: Analogues of Ramanujan’s partition identities. Ramanujan J. 31, 373–396 (2013)
Xia, E.X.W., Yao, O.X.M.: New Ramanujan-like congruences modulo powers of 2 and 3 for overpartitions. J. Number Theory 133, 1932–1949 (2013)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Naika, M.S.M., Nayaka, S.S. Congruences for Partition Quadruples with t-Cores. Acta Math Vietnam 45, 795–806 (2020). https://doi.org/10.1007/s40306-019-00356-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40306-019-00356-z