Infinite families of arithmetic identities for self-conjugate 5-cores and 7-cores (Q394545)

Considering the Ferrers-Young diagram of an integer partition, the hook number of a node is defined as the number of nodes directly below and to the right of the node including the node itself. A \(t\)-core is a partition with no hook number divisible by \(t\). Let \(\text{asc}_t(n)\) denote the number of self-conjugate \(t\)-cores of \(n\). Among several results on \(\text{asc}_t(n)\), \textit{F. Garvan} et al. [Invent. Math. 101, No. 1, 1--17 (1990; Zbl 0721.11039)] gave bijective proofs of \(\text{asc}_5(2n+1)= \text{asc}_5(n)\), \(\text{asc}_7(4n+6)= \text{asc}_7(n)\). Let \(r_k(n)\) denote the number of representations of \(n\) as a sum of \(k\) squares. In the paper under review, the authors employ Ramanujan's simple theta function identities for proving identities of the following type \[ 8\text{asc}_5(n)= \begin{cases} r_2(5(n+1)),\quad &\text{if }n\equiv 0,1,2,3\pmod 5,\\ r_2(5(n_1 + 1))- r_2((n+ 1)/5),\quad &\text{if }n\equiv 4\pmod 4;\end{cases} \] \[ 48\text{asc}_7(n)= \begin{cases} r_3(7(n+2)),\quad &\text{if }n\equiv 0,1,2,3,4,6\pmod 7,\\ r_3(7(n+2))- r_3((n+2)/7),\quad &\text{if }n\equiv 5\pmod 7;\end{cases} \] \(\text{asc}_5(n)= \text{asc}_5(p^{2k}(n+1)-1)\) for any prime \(p\equiv3\mod 4\).