9
$\begingroup$

Let $\nu_p(n)$ denote the $p$-adic valuation of $n$, i.e. the highest power of $p$ dividing $n$.

Consider the following two $q$-series formed by infinite products $$\prod_{n\geq1}\left(\frac{1+q^n}{1-q^n}\right)^2=\sum_{k\geq0}a_k\,q^k \qquad \text{and} \qquad \prod_{n\geq1}\left(\frac{1+q^n}{1-q^n}\right)^n=\sum_{k\geq0}b_k\,q^k.$$ Both $a_k$ and $b_k$ have combinatorial interpretations in the context of partitions. One reference for $b_k$ would be: Corteel, S., Savelief, C., Vuletić, M.: Plane overpartitions and cylindric partitions. J. Combin. Theory Ser. A 118(4), 1239–1269 (2011). Some references for $a_k$ include: Jeremy Lovejoy, Overpartition pairs, Annales de l'institut Fourier, vol.56, no.3, p.781-794, 2006.

I would like to ask:

QUESTION. Is this true? If $k=j^2\geq1$ is a perfect square, then we have $\nu_2(a_k)=2=\nu_2(2b_k)$.

ADDED. I thought it might be proper to record the following extension: if $$\prod_{n\geq1}\left(\frac{1+q^n}{1-q^n}\right)^r=\sum_{k\geq0}a_k^{(r)}q^k$$ and (once again) $k=j^2$, then $\nu_2(a_k^{(r)})=\nu_2(2r)$ independent of $j$.

$\endgroup$
2
  • 2
    $\begingroup$ Would you mind expanding on the combinatorial interpretation of $a_k$ and $b_k$? $\endgroup$ Commented Sep 24, 2021 at 15:17
  • $\begingroup$ @AntoineLabelle: I've included some references to the concepts related to these two sequences. $\endgroup$ Commented Sep 24, 2021 at 17:23

1 Answer 1

14
$\begingroup$

First notice that $$\frac{1+q^n}{1-q^n} = 1 + 2\frac{q^n}{1-q^n}.$$

Computing modulo $8$, we have $$\left(\frac{1+q^n}{1-q^n}\right)^2 \equiv 1 + 4\frac{q^n}{1-q^{2n}}\pmod8.$$ Correspondingly, $$\prod_{n\geq 1}\left(\frac{1+q^n}{1-q^n}\right)^2 \equiv 1+ 4\sum_{n\geq 1} \frac{q^n}{1-q^{2n}}\pmod8.$$ For $k=2^s m$ with $s\geq 0$ and odd $m$, we have $$a_k = [q^k]\ \prod_{n\geq 1}\left(\frac{1+q^n}{1-q^n}\right)^2 \equiv 4\tau(m)\pmod8,$$ where $\tau(m)$ is the number of divisors of $m$. If $k$ is a square, then $\tau(m)$ is odd, proving the result for $\nu_2(a_k)$.


Similarly, we have $$\left(\frac{1+q^n}{1-q^n}\right)^n \equiv 1 + 2n\frac{q^n}{1-q^n}\pmod4$$ and $$\prod_{n\geq 1}\left(\frac{1+q^n}{1-q^n}\right)^n\equiv 1+ 2\sum_{n\geq 1} n\frac{q^n}{1-q^{n}}\pmod4.$$ And again for $k=2^sm$, we have $$b_k = [q^k]\ \prod_{n\geq 1}\left(\frac{1+q^n}{1-q^n}\right)^n \equiv 2\tau(m)\pmod{4},$$ proving the result for $\nu_2(b_k)$.


For the ADDED part, with the help of Lemma 4.7 for $p=2$ in this paper we have $$\prod_{n\geq 1}\left(\frac{1+q^n}{1-q^n}\right)^r\equiv 1+ 2r\sum_{n\geq 1} \frac{q^n}{1-q^{(1+[t>0])n}}\pmod{2^{t+2}},$$ where $t:=\nu_2(r)$. Then $$a_k^{(r)} = [q^k]\ \prod_{n\geq 1}\left(\frac{1+q^n}{1-q^n}\right)^r \equiv 2r\cdot\tau(k)\pmod{2^{t+2}},$$ implying that $\nu_2(a_k^{(r)}) = \nu_2(2r) = t+1$ when $k$ is a square.

$\endgroup$
6
  • 1
    $\begingroup$ How do you pass from the first congruence to the second? $\endgroup$ Commented Sep 24, 2021 at 16:06
  • 3
    $\begingroup$ მამუკა ჯიბლაძე: $4$ times $4$ is divisible by $8$. Of course the congruence is meant in the ring $\mathbb{Z}[[q]]$. $\endgroup$
    – GH from MO
    Commented Sep 24, 2021 at 16:18
  • 3
    $\begingroup$ @მამუკაჯიბლაძე: Perhaps, the easiest way is to think of the coefficient 4 as $x$ satisfying $x^2\equiv 0$. Then $$\prod_i (1+xc_i) \equiv 1 + x\sum_i c_i.$$ $\endgroup$ Commented Sep 24, 2021 at 16:48
  • $\begingroup$ @GHfromMO Max I see, thanks $\endgroup$ Commented Sep 24, 2021 at 18:14
  • $\begingroup$ Sorry, one more question: in the last display, should not it be $\sigma$ rather than $\tau$? $\endgroup$ Commented Sep 25, 2021 at 5:13

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .