Plectis

Short paper

Hankel Determinants of Geometric Moments and Rational Lambert Values

Summary. Positive geometric moments and a uniform partition-sum bound give the fixed-base asymptotic of Zudilin’s normalised Hankel determinants, including its constant and power correction. A separate calculation of degrees after cancellation in his 2004 forms extends the rational-base irrationality region. It includes every positive integral power of 31/4 and excludes 3/2.

This paper covers the fixed-base Hankel asymptotic and rational-base irrationality theorem; the long paper develops exact orders, content and endpoint obstructions, and the remaining problem at 3/2.

It does not establish the validity of claims tagged Lean, which belongs to the cited kernel-checked source, or a solution to Erdős #1049, which remains open.

In this paper

The first nonzero formal term

The order of a nonzero formal series is the least exponent with nonzero coefficient. We now fix N and determine the first term in the formal q-expansion. The shifted term in (8) then has an extra factor of q. More generally, every nonempty partition has positive displacement exponent. Thus a single tuple determines the first formal term, although all partitions were needed for the fixed-base constant.

Theorem 3.2 (the first nonzero term of the Hankel determinant). For every N≥1,

ordq⁡VN∗=N(N−1)(2N−1)6,

and the coefficient of the first nonzero monomial is

[qN(N−1)(2N−1)/6]VN∗=(N!)2(N+1)!2N.

Proof. At q=0, the t=0 term of Gq(w) is (1−w2)/(1−w)5, while the remaining terms sum to w/(1−w)4. Thus

G0(w)=1+2w(1−w)4,ak(0)=ck>0.

We compute modulo qM+1 by truncating each moment sum in (12) at k=M. Since all omitted terms are divisible by qM+1, multilinearity leaves the determinant unchanged modulo that power. Applying finite Cauchy–Binet and then allowing M to increase, we obtain the coefficientwise identity

VN∗=∑k0<⋯<kN−1(∏i<Naki(q)qki)∏i<j<N(qki−qkj)2.

The order of the summand indexed by (ki) is ∑i<N(2N−1−2i)ki. Because ki≥i and all the weights 2N−1−2i are positive, we obtain the unique minimum at ki=i, with order and coefficient

∑i<N(2N−1−2i)i=BN,∏i<Nci=CN.

No other tuple has this order, so no coefficient from another tuple can cancel it. This argument needs the positive constant terms ak(0)=ck, not nonnegativity of all their formal coefficients. For N=2, the pair (0,1) contributes 6q+O(q2), and every other increasing pair has order at least two. ◻

This proves equality in Zudilin’s bound [5]. An alternative argument, which computes the first nonzero term of every transformed row, is given in the companion paper.

About this paper

Authorship and AI use. Will Cook built and directed the research infrastructure and maintains the public release. He reviewed claims when he could. AI agents did most of the research and drafting. Cook did not independently verify every claim.

Cite and contact. Cite this paper by its title, author and date above, with its PDF; cite the earlier sources it uses for a mathematical result. For software, use the release citation and give the commit used. Contact Will with questions or corrections.

Prefer the manuscript?

Equations typeset from the exact TeX. Rendered from the LaTeX manuscript source with file fingerprint sha256:7d9bf99ea6b7e699. Its file fingerprint matched the published source record, so the PDF above, the LaTeX, and this page are one manuscript. Redeploying the site regenerates this page from whatever the public repository holds at that moment.