Some missed congruences modulo powers of 2 for \(t\)-colored overpartitions (Q2677690)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some missed congruences modulo powers of 2 for \(t\)-colored overpartitions
scientific article

    Statements

    Some missed congruences modulo powers of 2 for \(t\)-colored overpartitions (English)
    0 references
    5 January 2023
    0 references
    An overpartition of a positive integer \(n\) is a partition of \(n\) where the first occurrence of parts of each size may be overlined. For their number \(\overline{p}(n)\), \[ \sum_{n=0}^{\infty} \overline{p}(n)q^n= \prod_{n=1}^{\infty}\frac{1+q^n}{1-q^n}, \quad |q|<1 \] (see \textit{S. Corteel} and \textit{J. Lovejoy} [Trans. Am. Math. Soc. 356, No. 4, 1623--1635 (2004; Zbl 1040.11072)]). Let \(\overline{p}_{-t}(n)\) denote the number of \(t\)-coloured overpartitions of \(n\): \[ \sum_{n=0}^{\infty} \overline{p}_{-t}(n)q^n=\prod_{n=1}^{\infty}\frac {(1+q^n)^t}{(1-q^n)^t}, \quad |q|<1. \] \textit{S. S. Nayaka} and \textit{M. S. M. Naika} [Bol. Soc. Mat. Mex., III. Ser. 28, No. 3, Paper No. 66, 19 p. (2022; Zbl 07585487)] established several congruences modulo 16 and 32 for \(\overline{p}_{-t}(n)\) with \(t\)=5, 7, 11, and 13. E. g., they proved that, for nonnegative integer \(n\), \begin{align*} \overline{p}_{-5}(8n+7)&\equiv 0 \mod 32,\\ \overline{p}_{-7}(8n+5)&\equiv 0 \mod 32,\\ \overline{p}_{-11}(8n+6)&\equiv 0 \mod 16,\\ \overline{p}_{-11}(8n+7)&\equiv 0 \mod 32,\\ \overline{p}_{-13}(8n+7)&\equiv 0 \mod 32. \end{align*} In the paper under review the author proves algorithmically several missed congruences modulo powers of 2 for \(\overline{p}_{-t}(n)\) with \(t\)=5, 7, 11, and 13, in certain cases improving the congruences found by Nayaka and Naika [loc. cit.]. E. g., the author proves that, for nonnegative integer \(n\), \begin{align*} \overline{p}_{-5}(8n+5)&\equiv 0 \mod 8,\\ \overline{p}_{-5}(8n+7)&\equiv 0 \mod 128,\\ \overline{p}_{-7}(8n+7)&\equiv 0 \mod 128,\\ \overline{p}_{-11}(8n+3)&\equiv 0 \mod 16,\\ \overline{p}_{-11}(8n+7)&\equiv 0 \mod 64,\\ \overline{p}_{-13}(8n+7)&\equiv 0 \mod 256. \end{align*} The results are proved using \textit{N. A. Smoot}'s [J. Symb. Comput. 104, 276--311 (2021; Zbl 1462.11093)] implementation of an algorithm of \textit{C.-S. Radu} [ibid. 68, Part 1, 225--253 (2015; Zbl 1356.11072)].
    0 references
    overpartitions
    0 references
    \(t\)-coloured overpartitions
    0 references
    Ramanujan-type congruences
    0 references
    Radu's algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references