Searcharxiv⌕ Search

arXiv · 2610.05020

Dyadic Structure of the Two-Block Odd Partition Function and Theta-Weighted Congruences for $pod(n)$

Abstract

The two-block odd partition function \(a(n)\) is the signed enumeration of partitions into exactly two distinct part sizes, each occurring an odd number of times. By separating the underlying representations according to the \(2\)-adic valuations of the two part sizes, we obtain a signed decomposition, completed by two classical theta-function evaluations, which explains the structural relation \(a(2^km)=a(m)+(2^{k-1}-1)σ(m)\), where \(m\) is odd, \(k\ge1\), and \(σ(m)\) is the sum-of-divisors function. Combined with a previously established arithmetic formula for \(a(n)\), this relation yields congruences along the dyadic progressions \(2^k(4n+3)\), as well as the families \(a\!\left(2^\alpha3^β(12n+11)\right)\equiv0\pmod3\) and \(a\!\left(2^α(18n+15)\right)\equiv0\pmod3\). We also use a factorization of the generating function of \(a(n)\) involving \(\operatorname{pod}(n)\), the number of partitions in which odd parts are distinct and even parts are unrestricted, to establish a uniform reduction modulo every odd prime of the associated auxiliary series. The resulting theta-weighted sums involving \(\operatorname{pod}(n)\) are congruent to \(a(n)\) and therefore admit explicit evaluations involving the sum-of-divisors function and the character divisor sum associated with the nonprincipal Dirichlet character modulo \(4\). As special cases, we obtain infinite families of weighted congruences modulo \(3\), \(5\), and \(13\).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mircea Merca. 2026-10-04. Dyadic Structure of the Two-Block Odd Partition Function and Theta-Weighted Congruences for $pod(n)$. https://arxiv.org/abs/2610.05020

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

New Results for Euler Sums

We present a large number of analytic evaluations of Euler sums, namely sums such as \begin{align} M(m,n_0,n_1,n_2, \ldots, n_t) &= \sum_{k=1}^\infty \frac{H(k)^m}{k^{n_0} (k+1)^{n_1} (k+2)^{n_2} \cdots (k+t)^{n_t}}, \nonumber \end{align} for nonnegative integers $m$ and $(n_i)$, with $m \geq 1$ and $n_0 + n_1 + \cdots + n_t \geq 2$, where $H(k) = \sum_{j=1}^k 1/j$ is the harmonic function. These results were obtained either by algebraic manipulations, or else by very high-precision numerical evaluations combined with an integer relation algorithm to obtain the analytic formulas. We show how many of these results can be derived from a few basic facts, and that these techniques are applicable to Euler sums of even more general forms than the above cases. We then show that these results permit the calculation of constants for Euler sums resembling the Stieltjes $γ$ constants arising in the theory of the Riemann zeta function, and we also present some preliminary results on the asymptotic behavior of these constants. A sign error has been corrected in eq. 98.

math.NT↗

The moments of split greatest common divisors

Sequences of the form $(\gcd(u_n,v_n))_{n \in \mathbb N}$, with $(u_n)_n$, $(v_n)_n$ sums of $S$-units, have been considered by several authors. The study of $\gcd(n,u_n)$ corresponds, after Silverman, to divisibility sequences arising from the algebraic group $\mathbb G_{\mathrm{a}} \times \mathbb G_{\mathrm{m}}$; in this case, Sanna determined all asymptotic moments of the arithmetic function $\log\,\gcd (n,u_n)$ when $(u_n)_n$ is a Lucas sequence. Here, we characterize the asymptotic behavior of the moments themselves $\sum_{n \leq x}\,\gcd(n,u_n)^λ$, thus solving the moment problem for $\mathbb G_{\mathrm{a}} \times \mathbb G_{\mathrm{m}}$. We give both unconditional and conditional results, the latter only relying on standard conjectures in analytic number theory.

math.NT↗