Answers are grounded in this paper and cite their sources.
We prove Conjecture 7.5 of Beukers and Vlasenko ("Dwork crystals III: from excellent Frobenius lifts towards supercongruences", Int. Math. Res. Not. 2023) for the three families of Calabi–Yau threefolds considered there: the mirror quintic, with a_n = (5n)!/n!^5; the hypercubic family, with a_n = binomial(2n,n)^4; and the hyperoctahedral family, with a_n = binomial(2n,n) times the n-th Domb number (operator 16 in the Almkvist–van Enckevort–van Straten–Zudilin table). Let F(z) be the generating series of a_n, let F_N be its truncation at z^N, let q be the canonical coordinate and let sigma be the excellent Frobenius lift, defined by q(z^sigma) = q(z)^p. Beukers and Vlasenko conjectured that F(z)/F(z^sigma) is congruent to Fp^s(z)/F_{pˢ⁻¹}(z^sigma) modulo p²ˢ. We prove this for every prime p >= 5 and every s >= 1, in the stronger form in which pˢ⁻¹ is replaced by an arbitrary integer M >= 1 and s = 1 + v_p(M). The proof is elementary and does not use the Cartier operator. It has three ingredients: (1) a reduction lemma that expresses twisted tails of the series, with a p-adic analytic weight, through the 3-jet of the tail F - F_M plus an explicit boundary term; (2) the vanishing, on the solutions F and F log q, of the linear functional that compares the Frobenius action with the transport along sigma, which is where the defining property of the excellent lift enters; (3) an induction on s carried out in the canonical coordinate. For the hyperoctahedral family, which is not hypergeometric, the reduction is performed on a four-fold sum, and we show that its Picard–Fuchs recurrence is a formal consequence of first-order relations satisfied by the summand. The exponent 2s is optimal. Every identity and every valuation in the proofs has been verified numerically, in exact p-adic arithmetic, by two independent implementations: laboratories of the author's mathematical engine SyntheticMind and stand-alone Python scripts. The Python scripts are included in this record: lab15_reduccion.py: the four-index reduction for the hyperoctahedral family, executed as an algorithm. lab15_comprob.py: shell valuations, shell sums and the logarithmic solution, with exact rationals. lab16_gamma.py: the facts on Morita's p-adic Gamma function used in the proofs. lab17_recurrencia.py: symbolic check that the shell relations imply the Picard–Fuchs recurrence. Authorship and tools: the author conceived and directed this research. It was carried out with SyntheticMind, a mathematical engine designed and written by the author, and with Claude (Anthropic), an AI system used as an assistant; details are given in the Declarations section of the paper. The author takes full responsibility for the content.
No takes yet. Share an insight, caveat, or question.
Gómez Blanco (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: