On certain weighted 7-colored partitions (Q2631616)

We first introduce some notations. For a given partition \(\lambda\), let \(\ell(\lambda)\) denote the number of parts in \(\lambda\) and \(\sigma(\lambda)\) denote the sum of all parts in \(\lambda\) with the convention \(\ell(\lambda)=\sigma(\lambda)=0\) for empty partition \(\lambda\) of 0. Let \(\mathcal{P}\) denote the set of all ordinary partitions, and \(\mathcal{O}\) (resp. \(\mathcal{DE}, \mathcal{DO}\)) denote the set of all partitions into odd parts (resp. distinct even parts, distinct odd parts). Inspired by 2-colored generalized Frobenius partitions defined by [\(\textit{G. E. Andrews}\), Mem. Am. Math. Soc. 301, 44 p. (1984; Zbl 0544.10010)], in this paper under review, the authors consider certain weighted 7-colored partition functions. A weighted 7-colored partition is a weighted vector partition \[\vec{\lambda}=(\lambda_1,\lambda_2,\lambda_3,\lambda_4,\lambda_5,t\lambda_6,t\lambda_7)\] where \(\lambda_1,\lambda_2,\lambda_3,\lambda_4,\lambda_5,\lambda_6,\lambda_7\) satisfy certain restrictions. Define the sum of parts function \(s\) by \[ s(\vec{\lambda})=\sum_{i=1}^5\sigma(\lambda_i)+t\sigma(\lambda_6)+t\sigma(\lambda_7), \] we say \(\vec{\lambda}\) is a weighted 7-colored partition of \(n\) if \(s(\vec{\lambda})=n\). Let \(\mathcal{V}_t\) be the set of weighted 7-colored partitions \(\vec{\lambda}=(\lambda_1,\lambda_2,\lambda_3,\lambda_4,\lambda_5,t\lambda_6,t\lambda_7)\) satisfying \(\lambda_1\in\mathcal{DE},\lambda_2,\lambda_3,\lambda_4,\lambda_5\in\mathcal{O},\lambda_6,\lambda_7\in\mathcal{P}\). Define the weight function \(wt\) by \(wt(\vec{\lambda})=(-1)^{\ell(\lambda_1)}\). Let \(w_t(n)=\sum\limits_{\vec{\lambda}\in\mathcal{V_t},s(\vec{\lambda})=n}wt(\vec{\lambda})\), then the generating function of \(w_t(n)\) is given by \[\sum_{n=0}^{\infty}w_t(n)q^n:=\frac{(q^2;q^2)_{\infty}}{(q;q^2)_{\infty}^4(q^t;q^t)^2_{\infty}}.\] When \(t=4\), it reduces to the generating function of 2-colored generalized Frobenius partitions. The first part of this paper obtains several Ramanujan type equalities and congruences for \(w_t(n)\). For example, the authors prove that Theorem. For all \(n\geq 0\), \[ w_t(5n+3)\equiv w_t(5n+4)\equiv 0\pmod 5,\quad\text{ if }t\equiv 0\pmod 5, \] \[ w_t(5n+4)\equiv 0\pmod 5,\quad\text{ if }t\equiv 1\pmod 5, \] \[ w_t(5n+3)\equiv 0\pmod 5,\quad\text{ if }t\equiv4\pmod 5. \] Theorem. For all \(n\geq 0\), \[w_2(7n+4)\equiv 0\pmod 7. \] The second part of the paper is devoted to give combinatorial interpretations of the congruences in the above two theorems. A multirank for weighted 7-colored partitions in \(\mathcal{V}_t\) and a vector crank for weighted 7-colored partitions in another set are introduced to do so. Moreover, the authors also consider weighted 7-colored partitions weighted by the parity of certain partition statistics. They obtain some Ramanujan-type congruences. The paper closes with further remarks and questions for further study.