Monomial-count conjecture for symmetrized Mordell–Tornheim zeta values

Let ζ‾n\overline{\zeta}_n be the symmetrized Mordell–Tornheim zeta value of order nn, and let p(n)p(n) denote the partition function. A monomial has total weight nn when the sum of the weights of its zeta-function factors is nn. Monomial-count conjecture. The value of ζ‾n≥1\overline{\zeta}_{n\geq 1} is a homogeneous polynomial with p(n)−p(n−1)p(n)-p(n-1) monomials, where each monomial is a product of zeta function values with total weight equal to nn. This predicts that all such monomials occur with nonzero coefficients; its validity for arbitrary nn remains open.

References

Primary source

Przemysław Dobrowolski, “Evaluation of the symmetrized Mordell-Tornheim zeta function”, arXiv:2603.20550 (2026).

Progress summary

Refreshed
Claimed progress

The conjecture is recorded in a March 2026 paper, and an unverified submitted argument claims to prove it, but no independent confirmation was found.

The conjecture predicts that the symmetrized Mordell–Tornheim value ζ‾n\overline{\zeta}_n contains exactly p(n)−p(n−1)p(n)-p(n-1) nonzero zeta-value monomials of total weight nn. A March 2026 paper gives the underlying Bell-polynomial evaluation but presents the nonvanishing claim as unresolved.

March 2026 formula and claimed coefficient proof

The paper proves a Bell-polynomial formula for ζ‾n\overline{\zeta}_n, implying homogeneity of weight nn. A submitted argument expands that Bell polynomial and claims an explicit positive coefficient for every partition of nn with no part equal to 11, which would prove the conjectured count; this argument is unverified.

Community submission (unverified)

A submitted proof argues that the exponential generating function is exp⁡ ⁣(∑j≥22j−2jZjxj)\exp\!\left(\sum_{j\geq2}\frac{2^j-2}{j}Z_jx^j\right), so every admissible monomial has a positive coefficient and the number of monomials is p(n)−p(n−1)p(n)-p(n-1).

Current status (as of August 2026): The Bell-polynomial evaluation is established, while the monomial-count conjecture has only an unverified submitted proof and remains unconfirmed.

Sources

Solutions 1

ProofThis solution needs a summarySee full solutionHide full solution

Exact expansion and support of the symmetrized Mordell--Tornheim values

Let

ζ‾n=∑a1,…,an∈Z∖{0}a1+⋯+an=01∣a1⋯an∣(n≥1).\overline{\zeta}_n =\sum_{\substack{a_1,\ldots,a_n\in\mathbb Z\setminus\{0\}\\ a_1+\cdots+a_n=0}} \frac{1}{|a_1\cdots a_n|} \qquad(n\geq1).

We prove the stronger coefficient-level statement

ζ‾n=n!∑m2,…,mn≥02m2+3m3+⋯+nmn=n∏j=2n1mj!(2j−2j ζ(j))mj.\boxed{\displaystyle \overline{\zeta}_n =n! \sum_{\substack{m_2,\ldots,m_n\geq0\\ 2m_2+3m_3+\cdots+nm_n=n}} \prod_{j=2}^{n} \frac{1}{m_j!} \left(\frac{2^j-2}{j}\,\zeta(j)\right)^{m_j}.}

Each displayed monomial has a strictly positive integer coefficient, and the monomials are indexed bijectively by the partitions of nn having no part equal to 11. Consequently, their number is exactly

p(n)−p(n−1).p(n)-p(n-1).

Here monomials are understood in the source's formal Bell-polynomial expansion, not modulo algebraic relations among numerical zeta values.

Proof

Dobrowolski's Theorem 2.2, equivalently equation (4.9) of the cited paper, establishes the identity

ζ‾n=Bn(0,(22−2)Γ(2)ζ(2),…,(2n−2)Γ(n)ζ(n)),\overline{\zeta}_n =B_n\left( 0, (2^2-2)\Gamma(2)\zeta(2), \ldots, (2^n-2)\Gamma(n)\zeta(n) \right),

where BnB_n is the complete exponential Bell polynomial. We use this existing theorem as the starting point; the remaining task is to determine every coefficient and prove that none vanishes.

Introduce independent formal indeterminates Z2,Z3,…Z_2,Z_3,\ldots with weighted degrees

wt⁡(Zj)=j.\operatorname{wt}(Z_j)=j.

Define P0=1P_0=1 and, for n≥1n\geq1, define

Pn(Z2,…,Zn)=Bn(0,(22−2)(2−1)!Z2,…,(2n−2)(n−1)!Zn).P_n(Z_2,\ldots,Z_n) =B_n\left( 0, (2^2-2)(2-1)!Z_2, \ldots, (2^n-2)(n-1)!Z_n \right).

The defining exponential generating function of the complete Bell polynomials gives

∑n=0∞Pnxnn!=exp⁡(∑j=2∞2j−2j Zjxj).\sum_{n=0}^{\infty}P_n\frac{x^n}{n!} =\exp\left( \sum_{j=2}^{\infty} \frac{2^j-2}{j}\,Z_jx^j \right).

Expanding the exponential as a product of formal power series yields

∑n=0∞Pnxnn!=∏j=2∞exp⁡(2j−2jZjxj)=∏j=2∞∑mj=0∞1mj!(2j−2jZjxj)mj.\begin{aligned} \sum_{n=0}^{\infty}P_n\frac{x^n}{n!} &= \prod_{j=2}^{\infty} \exp\left(\frac{2^j-2}{j}Z_jx^j\right)\\ &= \prod_{j=2}^{\infty} \sum_{m_j=0}^{\infty} \frac{1}{m_j!} \left(\frac{2^j-2}{j}Z_jx^j\right)^{m_j}. \end{aligned}

Therefore, for every multiplicity vector satisfying ∑j=2njmj=n\sum_{j=2}^n jm_j=n, the coefficient of its associated monomial is

[∏j=2nZjmj]Pn=n!∏j=2nmj!∏j=2n(2j−2j)mj>0.\left[\prod_{j=2}^{n}Z_j^{m_j}\right]P_n =\frac{n!}{\prod_{j=2}^{n}m_j!} \prod_{j=2}^{n} \left(\frac{2^j-2}{j}\right)^{m_j}>0.

In fact, this coefficient is an integer: equivalently, it factors as

[∏j=2nZjmj]Pn=n!∏j=2n(j!)mjmj!∏j=2n((2j−2)(j−1)!)mj.\left[\prod_{j=2}^{n}Z_j^{m_j}\right]P_n = \frac{n!}{\prod_{j=2}^{n}(j!)^{m_j}m_j!} \prod_{j=2}^{n} \big((2^j-2)(j-1)!\big)^{m_j}.

The first factor counts the set partitions of an nn-element set having exactly mjm_j blocks of size jj for every jj; it is therefore a positive integer. Every factor in the second product is a positive integer as well. Thus every allowed formal monomial occurs exactly once and has a strictly positive integer coefficient.

Its weighted degree is

wt⁡(∏j=2nZjmj)=∑j=2njmj=n,\operatorname{wt}\left(\prod_{j=2}^n Z_j^{m_j}\right) =\sum_{j=2}^n jm_j=n,

so PnP_n is weighted-homogeneous. The multiplicity vector corresponds bijectively to the integer partition

n=2+⋯+2⏟m2 times+3+⋯+3⏟m3 times+⋯+n+⋯+n⏟mn times.n=\underbrace{2+\cdots+2}_{m_2\text{ times}} +\underbrace{3+\cdots+3}_{m_3\text{ times}} +\cdots +\underbrace{n+\cdots+n}_{m_n\text{ times}}.

Among the p(n)p(n) partitions of nn, those containing a part 11 correspond bijectively to the p(n−1)p(n-1) partitions of n−1n-1 by deleting one part 11. Hence the number containing no part 11, and therefore the exact formal monomial count, is

#supp⁡(Pn)=p(n)−p(n−1).\#\operatorname{supp}(P_n)=p(n)-p(n-1).

More precisely, if pk(s)p_k(s) denotes the number of partitions of ss into exactly kk positive parts, the number of monomials containing exactly kk zeta factors, counted with multiplicity, is

#{(m2,…,mn):∑j=2njmj=n,∑j=2nmj=k}=pk(n−k),\#\left\{ (m_2,\ldots,m_n): \sum_{j=2}^n jm_j=n,\quad \sum_{j=2}^n m_j=k \right\} =p_k(n-k),

because subtracting 11 from each of the kk parts gives a partition of n−kn-k into exactly kk positive parts.

For n=1n=1, the defining sum is empty and ζ‾1=P1=0\overline{\zeta}_1=P_1=0. Since p(1)=p(0)=1p(1)=p(0)=1, the claimed number of monomials is correctly 00.

Finally, evaluating Zj=ζ(j)Z_j=\zeta(j) recovers the boxed identity. This evaluation does not assert that the numerical zeta monomials are algebraically independent. For example,

P4(Z2,Z3,Z4)=12Z22+84Z4,ζ(4)=25ζ(2)2.P_4(Z_2,Z_3,Z_4)=12Z_2^2+84Z_4, \qquad \zeta(4)=\frac25\zeta(2)^2.

Although the two evaluated terms can subsequently be combined numerically, the source itself lists both as distinct monomials, exactly as required by its conjecture.

This proves Conjecture A.2 of Przemysław Dobrowolski, Evaluation of the symmetrized Mordell--Tornheim zeta function, https://arxiv.org/abs/2603.20550. The separate Conjectures A.1 and A.3 are not addressed.