Generalized Andrews mod 8 identity for indexed partitions

From papers

For integers k>i0k>i\geq 0, call a part λm\lambda_m in a partition (k,i)(k,i)-indexed if mi(modk)m\equiv i\pmod{k}. Let P(t1,t2,,ti;k)\mathcal{P}_{(t_1,t_2,\ldots,t_i;k)} be the set of partitions such that, for every 1ji1\leq j\leq i, the (tj,k)(t_j,k)-indexed parts are even and the odd parts are distinct. Writing λ=λ1+λ2+\lambda=\lambda_1+\lambda_2+\cdots and letting Xn=xnX_n=x^n, the proposed identity is

Generalized Andrews identity.

λP(t1,t2,,ti;k)xλ=n=111Xn2n≢t1,,ti(modk)(1+Xn1Xn).\sum_{\lambda\in\mathcal{P}_{(t_1,t_2,\ldots,t_i;k)}}x^{\lambda}=\prod_{n=1}^{\infty}\frac{1}{1-X_n^2}\prod_{n\not\equiv t_1,\ldots,t_i\pmod{k}}(1+X_{n-1}X_n).

This is presented as a proposed generalization of Andrews' mod 88 identity and its companions, motivated by the computation in the paper; the general identity is left as a problem for further study.

Progress summary

Open

No public discussion or published progress on this proposed identity was found.

No public discussion or published progress was found for the proposed generalized identity.

Current status (as of August 2026): The identity appears open, with no recorded public activity or verification.

Sources & referencesView supporting material

Primary source

Runqiao Li, “Partition analysis and the little Göllnitz identites”, arXiv:2510.23233 (2025).

Solutions 1

Proof

The conjecture holds in the stronger setting of an arbitrary prescribed set of positions, not merely a union of residue classes.

Let TN>0T\subseteq\mathbb N_{>0}, and let PT\mathcal P_T consist of partitions λ\lambda with distinct odd parts for which λj\lambda_j is even whenever jTj\in T. For independent variables x1,x2,x_1,x_2,\ldots, put

xλ=j1xjλj,Xj=x1xj,X0=1.x^\lambda=\prod_{j\ge1}x_j^{\lambda_j}, \qquad X_j=x_1\cdots x_j,\qquad X_0=1.

Then

λPTxλ=j111Xj2j1\jT(1+Xj1Xj).\boxed{\displaystyle \sum_{\lambda\in\mathcal P_T}x^\lambda = \prod_{j\ge1}\frac1{1-X_j^2} \prod_{\substack{j\ge1\j\notin T}} (1+X_{j-1}X_j).}

To prove this, extend every partition by trailing zeros and write

λj=2μj+εj,εj{0,1}.\lambda_j=2\mu_j+\varepsilon_j, \qquad \varepsilon_j\in\{0,1\}.

Weak decrease together with distinctness of odd parts is equivalent to

μjμj+1εj+1(j1).(1)\mu_j-\mu_{j+1}\ge\varepsilon_{j+1} \qquad(j\ge1). \tag{1}

Indeed, if εj+1=0\varepsilon_{j+1}=0, weak decrease is equivalent to μjμj+1\mu_j\ge\mu_{j+1}. If εj+1=1\varepsilon_{j+1}=1, either weak decrease against an even preceding part or strict decrease between distinct odd parts forces μjμj+1+1\mu_j\ge\mu_{j+1}+1. Conversely, (1) gives weak decrease and excludes repeated odd parts.

Define

ej=μjμj+1εj+1.e_j=\mu_j-\mu_{j+1}-\varepsilon_{j+1}.

Then the eje_j are arbitrary independent nonnegative integers, while the εj\varepsilon_j are arbitrary independent bits subject only to

εj=0(jT).\varepsilon_j=0\qquad(j\in T).

The inverse bijection is explicit:

μj=rj(er+εr+1),λj=2μj+εj.\mu_j=\sum_{r\ge j}(e_r+\varepsilon_{r+1}), \qquad \lambda_j=2\mu_j+\varepsilon_j.

Its weight factors as

xλ=r1Xr2erj1(Xj1Xj)εj.x^\lambda = \prod_{r\ge1}X_r^{2e_r} \prod_{j\ge1}(X_{j-1}X_j)^{\varepsilon_j}.

Summing the independent nonnegative-integer and binary choices proves the boxed identity. One can first impose a finite length cutoff and then pass coefficientwise to the limit, making the formal-series argument exact.

Finally, choose

T={j1:jt1,,ti(modk)}.T=\{j\ge1:j\equiv t_1,\ldots,t_i\pmod k\}.

This gives precisely the conjectured product for every admissible modulus and every prescribed set of residue classes, including residue zero. The specialization xj=qx_j=q also yields

λPTqλ=jT(1+q2j1)j1(1q2j).\sum_{\lambda\in\mathcal P_T}q^{|\lambda|} = \frac{\prod_{j\notin T}(1+q^{2j-1})} {\prod_{j\ge1}(1-q^{2j})}.

Source: R. Li, arXiv:2510.23233, Conjecture 8.1, equation (8.1).

0 endorsements
Shivam Patel ·