On the asymptotics of the binary partition function (Q1889699)

For integers \(k\), \(d\geq 2\), let \(b(d,k)\) denote the number of partitions of \(k\) into powers of 2 wherein no part is repeated more than \(d-1\) times. The asymptotic behaviour of \(b(\infty,k)\) as \(k\to\infty\) was studied by numerous authors, see a paper by \textit{B. Reznick} [in: Analytic Number Theory (Allerton Park, IL, 1989), Prog. Math. 85, 451--477 (1990; Zbl 0721.11037)]. For even \(d=2n\), let \(\nu_1=\lim\inf_{k\to\infty}k^{-\log_2n}b(2n,k)\) and \(\nu_2=\lim\sup_{k\to\infty}k^{-\log_2n}b(2n,k)\). By the results of B. Reznick, both \(\nu_1\) and \(\nu_2\) are positive and finite. If \(n\) is a power of 2, then \(\nu_1=\nu_2\). For \(n=3\), \(\nu_1\neq\nu_2\). In the paper under review the author proves that \(\nu_1=\nu_2\) implies that \(n\) is a power of 2 (Theorem 1). For arbitrary \(d\geq 2\), let \(p_1=\lim\inf_{k\to\infty}(\log k)^{-1}\log b(d,k)\) and \(p=\lim\sup_{k\to\infty}(\log k)^{-1}\log b(d,k)\). For even \(d\), \(p_1=p_2=\log_2(d/2)\). But \(p_1<p_2\) for \(d=3\) (Reznick) and for \(d=5,7,9,11,13\) [the author, Sb. Math. 191, No. 3, 381--414 (2000); translation from Mat. Sb. 191, No. 3, 65--98 (2000; Zbl 1004.11056]. Theorem 2 asserts that, for any odd \(d\), \(p_1<\log_2(d/2)<p_2\).