Abstract
In this paper, we provide combinatorial interpretations of certain proved Rogers–Ramanujan type identities using signed color partitions with attached weights. The approach of using the signed color partitions is interesting since negative exponents do not make an explicit appearance in these identities.
Introduction
Euler included a result in the chapter titled “De Partitio Numerorum”, given in [5], that every positive integer is uniquely represented as the sum or difference of distinct power of 3. He wrote this in terms of the generating function
which converges for no values of x. But in [2], Andrews treated (1.1) as an identity in formal Laurent series. He showed great interest in this section and asked the question: Why have we thought so little about partition generating functions in which some of the partitions might have some negative parts? He also explored Euler’s eye-catching identity (1.1) and found some new and appealing results. He called such partitions as ‘signed partitions’ in which parts may appear with \(+\) or − sign.
DEFINITION 1.1
In [8], a signed partition \(\Theta \) of an integer \(\nu \), denoted by \(\Theta \dashv \nu ,\) is a partition pair \((\theta _1, \theta _2),\) where
\(\theta _1\) (resp. \(\theta _2\)) is the positive (resp. negative) subpartition of \(\Theta \) and \(\theta _1^1, \theta _1^2, \ldots \) \(,\theta _1^{l(\theta _1)}\) (resp. \(\theta _2^1, \theta _2^2, \ldots , \theta _2^{l(\theta _2)}\)) are the positive (resp. negative) parts of \(\Theta \).
Remark 1
The unrestricted signed partitions of an integer are infinitely many. We are particularly interested in finite sets of signed partitions and this can be done by imposing some suitable restrictions on parts.
Example 1.1
Let \(\theta _1=6+3+3\) and \(\theta _2 = -3-2-1\). Then \(\Theta =(6+3+3, -3-2-1)\) is a signed partition of 6.
Signed partitions fit naturally while interpreting many classical q-series identities. For instance, refer [2] for interpretations of Göllnitz–Gordon identities using signed partition. Further in [9], Sills provided a bijection between the ordinary and signed partitions for the Göllnitz–Gordon identity.
In [7], Keith explored four combinatorial theorems by presenting bijections between restricted signed partitions and ordinary partitions. He also studied the behavior of signed partitions of zero in arithmetic progression. In [8], McLaughlin and Sills provided interpretations of Rogers–Ramanujan type identities, which belonged to the family of mod 36 with the missing member of the family in the same flavor.
Recently, Gupta and Rana [6] introduced signed color partitions and provided combinatorial interpretations of 100 Rogers–Ramanujan type identities which are listed in [4, 10]. This rich collection of combinatorial interpretations of Rogers–Ramanujan type identities allows to explore signed color partitions. But still a particular type of Rogers–Ramanujan type identities lack in their interpretations using signed partitions or signed color partitions. In this paper, we address this issue by introducing weight attached to signed color partitions. We will study the following Rogers–Ramanujan type identities:
Here we have employed the standard q-series notation
and
and also
We are going to handle these identities by using signed color partitions which have their roots in the colored partitions introduced by Agarwal and Andrews in [1] and has applications in the hard hexagon model of Baxter [3].
DEFINITION 1.2
An n-color partition is a partition where a part n can appear in n colors denoted by subscripts: \(n_1, n_2, \ldots , n_n\). The parts are ordered first by size and then by color. For any integer \(t\ge 0,\) an \((n+t)\)-color partition is a partition in which a part n can appear in \((n+t)\)-color partitions as \(n_1, n_2, \ldots , n_{n+t}\). Note that if \(t>0\), the partition can contain a part of size 0 but only one copy of zero ‘\(0_t\)’ is allowed. The weighted difference of two parts \((m_i)_{x_i}, (m_j)_{x_j}, \) \(m_i\ge m_j\) in an \((n+t)\)-color partition \((m_r)_{x_r}+(m_{r-1})_{x_{r-1}}+ \cdots + (m_1)_{x_1} \) such that \((m_r)_{x_r}\ge (m_{r-1})_{x_{r-1}}\ge \cdots \ge (m_1)_{x_1},\) is \(m_i-m_j-x_i-x_j\) and is denoted by \((((m_i)_{x_i}-(m_j)_{x_j})).\)
DEFINITION 1.3
A signed color partition \(\Theta \) is a signed partition pair \((\theta _1,\theta _2)\), where \(\theta _1\) and \(\theta _2\) are the \((n+t)\)-color partitions.
Example 1.2
\(\Theta =(9_3+4_2+1_1, -6_2-3_1-1_1)\) is an example of signed color partitions of 4, where \(\theta _1=9_3+4_2+1_1\) and \(\theta _2=-6_2-3_1-1_1.\)
Main results
In this section, we provide the signed color partition-theoretic interpretation of (1.2). We first rewrite the summation side of (1.2) as follows:
The factor \(\frac{q^{(9{\nu }^2+9\nu +4)/2}}{(q^3;q^3)_{\nu }(q^3;q^6)_{\nu +1}}\) generates the positive parts and \( (-1)^{2\nu +1}(1-q^{-3\nu -2})\prod _{j=1}^{\nu }(1-q^{-(3j-2)})(1-q^{-(3j-1)})\) generates the negative parts of the signed color partitions. Let \(g_1(\nu )\) be the generating function for the product side of (1.2). Then
Theorem 2.1
Let \(\Theta _1\) denote the signed color partition pairs \((\theta _1, \theta _2)\) and \(\theta _1\) be an \((n+5)\)-color partition such that
-
(a)
\(m_k \equiv {\left\{ \begin{array}{ll} 2~(mod ~3) &{} {\mathrm{if }}\, k=1,\\ 0~(mod ~3) &{} {\mathrm{if }}\, k>1,\\ \end{array}\right. }\)
-
(b)
\(x_1\ge 7\) and \(\equiv 1~(mod ~3),\) \(x_1 = m_1+5,\)
-
(c)
\(x_k\ge 9\) and \(\equiv 0~(mod ~3)\) for \(2\le k \le r,\)
-
(d)
\( (((m_k)_{x_k}-(m_{k-1})_{x_{k-1}}))\ge -9\) and \(\equiv 0~(mod ~3)\) for \(2\le k\le r,\)
-
(e)
Each partition is to be counted with weight \(w_{\theta _1} = 1\).
Let \(\theta _2\) be an n-color partition such that
-
(f)
\(({m_l})_{x_l}\ne ({m_{l-1}})_{x_{l-1}},\) for all l,
-
(g)
\(m_l\equiv 1\) or 2 (mod 3). If \(m_l\equiv 1\) (mod 3), then \(-3r-2\le m_l\le -2\) and if \(m_l\equiv 2\) (mod 3), then \(-3r+2\le m_l\le -1,\)
-
(h)
\(x_l=1,\) \(1\le l\le r,\)
-
(i)
The weight count for each partition is \(w_{\theta _2}= (-1)^{(\text {number of parts in}~{\theta _2+1)}}.\)
Then
Let \(g_1(\nu )\) be the weighted number of 2-colored partitions of \(\nu \) with parts \(\equiv \pm 2, 3~(mod ~6)\), where parts \(\equiv \pm 2~(mod ~6)\) are distinct and occur with color 1. Each partition is counted with weight \((-1)^{(\text {number of parts}~\equiv \pm 2~(mod ~6))}.\) Then
Example 2.1
For \(\nu =9\), the relevant partition of \(h_1(9)=8=g_1(9)\) (see Table 1).
Hence \(h_1(9)= \sum _{\Theta _1 \dashv \nu } w_{\theta _1}w_{\theta _2} = 8.\) Table 2 presents the partitions corresponding to \(g_1(\nu )=8\) for \(\nu =9\) and their weight respectively.
Proof
To generate \((n+5)\)-color partitions corresponding to
first consider the factor \(q^{({9r}^2+9r+4)/2}\) which generates \((n+5)\)-color partitions of the type \((9r)_9+(9r-9)_9+\cdots +18_9+9_9+2_7.\) It corresponds to the following two-line array where the first array depicts the parts and the second array gives the color of the corresponding part:
The factor \(\frac{1}{(q^3;q^3)_r}\) generates the r non negative numbers \(\equiv 0~(\mathrm {mod}~3)\), say \(u_1\times 3, u_2\times 6, \ldots , u_r\times 3r,\) where \(u_k\)’s are non negative. By introducing this factor, the k-th part is increased by \(3(u_r+u_{r-1}+\cdots +u_{r-k+1}).\) It modifies the above two-line array to

The factor \(\frac{1}{(q^3;q^6)_{r+1}}\) generates the \((r+1)\) non negative multiples of \(6k-3\), \(1\le k\le r+1,\) say \(v_1\times 3, v_2\times 9, \ldots , v_{r+1}\times (6r+3), \) where \(v_k\)’s are non negative. This factor increases the k-th part by \(6v_{r+1}+6v_{r}+\cdots +6v_{r-k+3}+3v_{r-k+2}\) and the corresponding subscript by \(3v_r-k+2\). The modified two-line array becomes
For \(2\le k \le r+1\), the k-th and \((k-1)\)-th parts of the \((n+5)\)-color partition are
and
Thus for \(1\le k\le r+1\),
So Theorem 2.1(d) holds.
Clearly (2.7) implies Theorem 2.1(b) and (2.3) implies Theorem 2.1(c) and from (2.2) and (2.6), we get Theorem 2.1(a).
The term \((1+q^{-3\nu -2})\prod _{j=1}^{\nu }(1-q^{-3j-2})(1-q^{-3j+1})\) clearly generates n-color partitions satisfying Theorems 2.1(f)–(i). \(\square \)
Combinatorial interpretations of (1.3)–(1.5)
In this section, we interpret three identities (1.3)–(1.5) using similar combinatorial arguments as done in Section 2. To study the identity (1.3), first consider its summation side
As a matter of fact we consider that the factor \((-1)^{\nu }\frac{q^{6\nu ^2+4\nu }}{(-q^2;q^4)_{\nu +1}(q^8;q^8)_{\nu }}\) generates the positive parts and \(\prod _{j=1}^{2\nu }(1-q^{-(2j-1)})\) generate the negative parts of the signed color partitions. Let \(g_2(\nu )\) be the generating function for the product side of (1.3). Then
Theorem 3.1
Let \(\Theta _2\) denote the signed color partition pairs \((\theta _1, \theta _2)\) and \(\theta _1\) be an \((n+4)\)-color partition such that
-
(a)
\(m_k,x_k\equiv 0~(mod ~2),\) \(\forall \) k,
-
(b)
\(m_1=x_1-4,\)
-
(c)
\((((m_k)_{x_k}-(m_{k-1})_{x_{k-1}}))\equiv 0~(mod ~8),\) \(\forall \) k,
-
(d)
The weight count for each partition is \(w_{\theta _1}= \sum _{i=1}^{r+1}x_i-2r-2.\)
Let \(\theta _2\) be an n-color partition such that
-
(e)
\(({m_l})_{x_l}\ne ({m_{l-1}})_{x_{l-1}},\) \(\forall \) l,
-
(f)
\(m_l \equiv 1~(mod ~2)\) and \(x_l=1,\) \(\forall \) l,
-
(g)
\(m_l\) \( < 2r,\)
-
(h)
The weight count for each partition is \(w_{\theta _2}= (-1)^{ (\text {number of parts in}~{\theta _2})}.\)
Then
Let \(g_2(\nu )\) be the weighted number of partitions of \(\nu \) into parts \({\ge } 2\) and \(\equiv {\pm } 2~(mod ~8)\) and distinct parts \({\equiv }\,{\pm } 1 (mod ~8)\). Each partition is counted with the weight \((-1)^{(\text {number of parts} ~\equiv \pm 2~(mod ~8))}.\) Then
Example 3.1
For \(\nu =16\), the weight calculation for signed color partitions is shown in Table 3. Hence \(h_2(16)= \sum _{\Theta _2 \dashv \nu } w_{\theta _1}w_{\theta _2} = -5\).
To study the identity (1.4), consider
In the last expression, the factor \(\frac{(-q;q)_{\nu }q^{ \nu (3\nu -1)/2}}{(q;q)_{2\nu }}\) generates the positive parts and \(\prod _{j=1}^{\nu -1}(1-q^{-j}+q^{-2j})\) generates the negative parts of the signed color partitions. Let \(g_3(\nu )\) be the generating function for the product side of (1.4). Then
where
and
Theorem 3.2
Let \(\Theta _3\) denote the signed color partition pairs \((\theta _1, \theta _2)\) and \(\theta _1\) be an n-color partition such that
-
(a)
\( (((m_k)_{x_k}-(m_{k-1})_{x_{k-1}})) \ge 1,\)
-
(b)
Each partition is to be counted with weight \(w_{\theta _1} = 1\).
Let \(\theta _2\) be the n-color partition such that
-
(c)
\(({m_l})_{x_l}\ne ({m_{l-1}})_{x_{l-1}},\) for all l,
-
(d)
\(x_l=1,2\), for all l,
-
(e)
\(m_l\) \( < r\), for all l,
-
(f)
the weight count for each partition is \(w_{\theta _2}= (-1)^{(\text {number of distinct parts of}~{\theta _2})}.\)
Then
Let \(a_3(\nu )\) denote the number of distinct partitions of \(\nu \) and \(b_3(\nu )\) denote the number of partitions of \(\nu \) such that the parts are \(\equiv \pm 2, \pm 3~(mod ~12) \). Then
Lastly, we consider the identity (1.4), where
In the above expression the factor \((-1)^{\nu }\frac{q^{6\nu ^2}}{(-q^2;q^4)_{\nu }(q^8;q^8)_{\nu }}\) generates the positive parts and \(\prod _{j=1}^{2\nu }(1-q^{-(4j-1)})(1-q^{-(4j-3)})\) generate the negative parts of the signed color partition. If the corresponding product side of (1.4) is generated by \(g_4(\nu )\), then
Theorem 3.3
Let \(\Theta _4\) denote the signed color partition pairs \((\theta _1, \theta _2)\) and \(\theta _1\) be an n-color partition such that
-
(a)
\(m_k\equiv x_k~(mod ~2)\) for all k,
-
(b)
\(x_k\ge 6\) for all k,
-
(c)
\((((m_k)_{x_k}-(m_{k-1})_{x_{k-1}}))\equiv 0~(mod ~8),\) for all k,
-
(d)
the weight count for each partition is \(w_{\theta _1}= \sum _{i=1}^{r}x_i-2r.\)
Let \(\theta _2\) be an n-color partition such that
-
(e)
\({m_l}_{x_l}\ne {m_{l-1}}_{x_{l-1}}\) for all l,
-
(f)
\(m_l \equiv \pm 1~(mod ~4)\) and \(x_l=1\) for all l,
-
(g)
\(m_l < 2r\) for all l,
-
(h)
the weight count for each partition is \(w_{\theta _2}= (-1)^{(\text {number of parts of}~{\theta _2})}.\)
Then
Let \(g_4(\nu )\) be the weighted number of partitions of \(\nu \) into parts \(\equiv \pm 2~(mod ~8)\) and distinct parts \(\equiv \pm 3~(mod ~8)\). Each partition is counted with the weight \((-1)^{(\text {number of parts} ~\pm 2~(mod ~8))}.\) Then
Proof
The proofs of Theorem 3.1–Theorem 3.3 can be proved along the lines of Theorem 2.1. \(\square \)
References
- 1.
Agarwal A K and Andrews G E, Rogers–Ramanujan identities for partitions with “\(N\) copies of \(N\)”, J. Combin. Theory, Series A45(1) (1987) 40–49
- 2.
Andrews G E, Euler’s “De partitio numerorum”, Bull. Amer. Math. Soc.44(4) (2007) 561–574
- 3.
Baxter R J, Rogers–Ramanujan identities in the hard hexagon model, J. Stat. Phys.26(3) (1981) 427–452
- 4.
Chu W and Zhang W, Bilateral bailey lemma and Rogers–Ramanujan identities. Adv. Appl. Math.42(3) (2009) 358–391
- 5.
Euler L, Introductio in analysin infinitorum, volume 2, (1748) (Marcum Michaelem Bousquet)
- 6.
Gupta V and Rana M, On some combinatorics of Rogers–Ramanujan type identities using signed color partitions, Current Trends in Mathematical Analysis and Its Interdisciplinary Applications (2019) (Springer) pp. 99–114
- 7.
Keith W J, A bijective toolkit for signed partitions, Ann. Combin.15(1) (2011) 95
- 8.
McLaughlin J and Sills A V, Combinatorics of Ramanujan–Slater type identities, Integers9(14) (2009)
- 9.
Sills A V, On the ordinary and signed Göllnitz–Gordon partitions, arXiv preprint: arXiv:1812.07550 (2018)
- 10.
Slater L J, Further identities of the Rogers–Ramanujan type, Proc. London Math. Soc.2(1) (1952) 147–167
Acknowledgements
The first and second authors are supported by the National Board for Higher Mathematics through Grant No. 2/48(18)/2016/NBHM(R.P.)/R&D II/14983. This work is supported by NBHM Grant No. 2/48(18)/2016/NBHM(R.P.)/R&DII/14983.
Author information
Affiliations
Corresponding author
Additional information
Communicating Editor: B Sury
Rights and permissions
About this article
Cite this article
Gupta, V., Rana, M. & Sharma, S. On weighted signed color partitions. Proc Math Sci 130, 10 (2020). https://doi.org/10.1007/s12044-019-0545-1
Received:
Revised:
Accepted:
Published:
Keywords
- \((n+t)\)-color partitions
- signed partitions
- combinatorial interpretation
- Rogers–Ramanujan type identities
2010 Mathematics Subject Classification
- 05A17
- 05A19
- 11P84