Submitted works

Advanced search

math.NT — Number Theory

The 2-adic valuation of the symmetric Prouhet-Tarry-Escott constant at sizes 13 and 15

Contributed by David Niedbala Giraudin

For symmetric ideal solutions of the Prouhet-Tarry-Escott problem of odd size n over the 2-adic integers, the associated constant C was known to satisfy v_2(C) >= 12 at n = 13, with a best known solution at v_2(C) = 17, and v_2(C) >= 14 at n = 15, with no solution recorded. We show that the minimum is exactly 13 at n = 13 and exactly 14 at n = 15. The lower bounds are computer-assisted: an exhaustive 2-adic lifting, driven by the row law taken as an exact equality (units included) together with the vanishing of the odd power sums, eliminates every valuation profile below these values. The upper bounds are explicit 2-adic solutions, certified by the multivariate Hensel lemma. The same procedure reproduces exactly the known values 4, 6, 9, 11 at n = 5, 7, 9, 11. A self-contained verifier accompanies the note.

Primarily AI-generated textHuman understanding: no parts$2$-adic valuationHensel lemmaProuhet-Tarry-Escott problemcomputer-assisted proofideal solutions
Nov 18, 20265 pages
PDFView work

math.NT — Number Theory

An upper bound 0.4893562 for the upper density of the integers p+2^k

Contributed by David Niedbala Giraudin

Let A be the set of odd integers of the form p + 2^k with p prime and k >= 0. We prove that the upper density of A is less than 0.489356157186869, improving the bound 0.489440909905826 announced by Patankar in November 2026. The proof uses the finite obstruction inequality of Erdos, as in the work of Habsieger-Roblot, Chen-Dai-Li, Griego, Yoo, Salavatov and Patankar, together with a simple averaging lemma: any prime may be added to the obstruction set, whatever the multiplicative order of 2 modulo it, at the cost of averaging over its residue classes. Adding all odd primes below 200 000 to Patankar's 59-prime certificate gives the bound. Starting instead from Salavatov's 51-prime certificate, whose base histogram we rebuilt, gives the bound 0.489419333025262, which also improves the previous record. The certificates are exact rational computations and are provided with the verification programs.

Primarily AI-generated textHuman understanding: no partsRomanoff's constantcomputer-assisted proofcovering congruencessums of a prime and a power of twoupper density
Nov 18, 20264 pages
PDFView work

math.NT — Number Theory

An admissible 232 465 000-tuple with few long pairs, and H_5 <= 4 817 211 684

Contributed by David Niedbala Giraudin

Let H_m = liminf (p_{n+m} - p_n). Version 2 of Kapila's preprint hexagon:2610.00419 proves H_5 <= 4 830 355 416 by a pair-penalty criterion: with certified constants, an admissible 232 465 000-tuple with at most 4 672 314 960 pairs of elements further apart than D gives H_5 <= D. We construct an admissible 232 465 000-tuple with 4 672 314 941 pairs further apart than 4 817 211 684, which gives H_5 <= 4 817 211 684 with the certificates of that preprint, unchanged. The tuple is obtained from the one of the preprint by putting back 375 314 pairs +-p, removing 158 382 elements and adding +-1; its admissibility and its pair count are checked by two independent programs.

Author comments: 3 pages. Version 2 replaces version 1 (H_5 <= 4 891 341 734, already superseded by hexagon:2610.00419v2). Ancillary files: patches to the certificate of hexagon:2610.00419v2, removed elements, window, two independent verifiers (h5_verify.py), run logs.

Primarily AI-generated textHuman understanding: no partsMaynard-Tao sieveadmissible tuplesbounded gapscomputer-assisted proofgaps between primes
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

A lower bound 0.11096505 for Romanoff's constant

Contributed by David Niedbala Giraudin

Let d be the lower density of the integers of the form p + 2^a with p prime and a >= 1. We prove d >= 0.11096505, unconditionally. The previous best unconditional bound is d >= 0.110825, due to Tomar. The proof is Tomar's method, with the same analytic inputs, applied to a different modulus of the same period 27720; the bound is certified in exact rational arithmetic by Tomar's checking program, with changes that only make the computation faster and that we verify against the original program.

Primarily AI-generated textHuman understanding: no partsPintz inequalityRomanoff's constantSelberg sievecomputer-assisted proofprimes and powers of two
Nov 16, 20263 pages
PDFView work

cs.CC — Computational Complexity

An edge comparison with constant 3/2 and the coefficient 6/sqrt(2 pi) for the average sensitivity of polynomial threshold functions

Contributed by David Niedbala Giraudin

For every real polynomial threshold function f of degree at most d on the uniform cube {-1,1}^n we prove AS(f) <= min{n, 6 d b_n (n+d)/(n+2d)} <= (6/sqrt(2 pi)) d sqrt(n) < 2.394 d sqrt(n), where b_n = E|B_n - n/2| for B_n ~ Bin(n,1/2). The previous coefficient was 8/sqrt(2 pi) = 3.1915... The new ingredient is an edge comparison with constant 3/2 in place of 2 in OpenAI's weighted-grading argument: for every positive weight and every sign function h, the number of ordered equal-sign edges of h is at most (3/2)||MH+HM||_HS^2. The proof rests on the exact identity (Z_i M Z_i - M)^2 = I - A_i^2, where A_i is the grade-diagonal part of the multiplication by x_i. Combined with OpenAI's original coupling estimate alone, the lemma already gives AS(f) <= 6 d sqrt(n).

Primarily AI-generated textHuman understanding: no partsBoolean functionsaverage sensitivitycoupling inequalitypolynomial threshold functionstotal influenceweighted grading
Nov 15, 20264 pages
PDFView work

math.NT — Number Theory

The Schur-Siegel-Smyth trace problem: the lower bound 1.8022246

Contributed by David Niedbala Giraudin

We prove lambda_SSS >= 9011123/5000000 = 1.8022246 for the smallest limiting trace-to-degree ratio of totally positive algebraic integers. The previous best bound is 1.8022225 (Tomar). The certificate consists of fourteen integer polynomials with rational multipliers and a continuous piecewise-linear density with 8678 rational hat weights; its dual inequality is verified on (0,infinity) in ball arithmetic. For the same family of polynomials the value of the underlying optimisation problem is 1.8022247 to within 10^-9 (numerical), so the bound is within 1.1*10^-7 of what this family can give.

Author comments: 3 pages. Ancillary files: the exact certificate (cert_SSS_1802224600.json), a rigorous checker in ball arithmetic (check_sss.py, python-flint), its run log, an independent numerical cross-check (pointcheck_mp.py) and SHA-256 sums.

Primarily AI-generated textHuman understanding: no partsSchur-Siegel-Smyth trace problemauxiliary polynomialsball arithmeticcomputer-assisted prooflogarithmic energytotally positive algebraic integers
Nov 11, 20263 pages
PDFView work

math.NT — Number Theory

Second moments of pattern counts in dual Melas codewords

Contributed by David Niedbala Giraudin

Let α\alpha be a primitive element of F2k\mathbb{F}_{2^k} and, for c∈F2k∗c\in\mathbb{F}_{2^k}^*, let Sc=(Tr(αi+cα−i))0≤i≤2k−2S_c=(\mathrm{Tr}(\alpha^i+c\alpha^{-i}))_{0\le i\le 2^k-2} be the corresponding codeword of the dual Melas code. Let Xk,c(w)X_{k,c}(w) be the number of occurrences of a uniformly random pattern w∈F2kw\in\mathbb{F}_2^k in ScS_c. Sac Himelfarb and Schwartz conjectured that Xk,ckX_{k,c_k} converges to the Poisson law P(1)\mathcal P(1) for every choice of ck∈F2k∗c_k\in\mathbb{F}_{2^k}^*; they proved that the second factorial moment satisfies lim sup⁡M2≤2\limsup M_2\le 2, and M2→1M_2\to1 for almost every sequence (ck)(c_k). We prove that ∣M2(k,c)−1∣≤2−(1/22+o(1))k|M_2^{(k,c)}-1|\le 2^{-(1/22+o(1))k} uniformly in c∈F2k∗c\in\mathbb{F}_{2^k}^* and in the primitive element α\alpha. Thus the second factorial moment converges to 11 for every sequence (ck)(c_k). The proof expresses M2M_2 through a norm form of the quadratic extension F2(x)/F2(x+x−1)\mathbb{F}_2(x)/\mathbb{F}_2(x+x^{-1}), which turns it into a bilinear Kloosterman sum of full length, and bounds the latter in characteristic two. We also show that the counts Nw(Sc)N_w(S_c), as functions of (w,c)(w,c), are the fibre sizes of a family of quadratic maps, and deduce that for almost every sequence of patterns wkw_k the first two factorial moments of c↦Nwk(Sc)c\mapsto N_{w_k}(S_c) converge to 11, as they would under the Poisson law conjectured by Sac Himelfarb and Schwartz for fixed patterns.

Author comments: 7 pages. Proves, uniformly in c, the second-moment case of Conjecture 35 of Sac Himelfarb-Schwartz (arXiv:2610.38017), and the first two moments of their fixed-pattern conjecture for almost every pattern. Ancillary verifier VERIF_MELAS_M2.py (pure Python).

Primarily AI-generated textHuman understanding: no partsKloosterman sumsLFSR sequencesPoisson randomnessdual Melas codesfunction fields
Nov 10, 20267 pages
PDFView work

math.NT — Number Theory

The Mesirov-Sweet property over F_2 up to degree 33, with two quotients of degree two up to degree 28

Contributed by David Niedbala Giraudin

For a monic polynomial g in F_2[T] of degree d, the conjecture of Mesirov and Sweet asserts that there is f in F_2[T], coprime to g with deg f < d, such that every partial quotient of the continued fraction of f/g has degree at most 2. We check by exhaustive computation that this holds for every g of degree at most 33. We also check that for every g of degree at most 28 one can choose f so that all partial quotients are linear except at most two, which have degree 2. The computations combine exhaustive enumeration of fixed degree patterns, explicit certificates for the polynomials not reached by the patterns, and two separately written enumeration programs whose outputs coincide bit for bit. All programs are provided.

Author comments: 3 pages, 2 tables. Ancillary files: C sources of the enumeration programs, of the certificate search and of the checker (stored as text in c_sources.py), cell lists, run logs, a numpy verifier and samples of 10^5 certificates in degrees 28 and 33.

Primarily AI-generated textHuman understanding: no partsMesirov-Sweet conjectureZaremba conjecturecontinued fractionsexhaustive verificationpolynomials over F_2
Nov 10, 20263 pages
PDFView work

math.CV — Complex Variables

An explicit counterexample of degree 29440 to Smale's mean value problem with constant one

Contributed by David Niedbala Giraudin

For a complex polynomial p with p(0)=0 and p'(0)=1, let S(p,0) be the minimum of |p(c)/c| over the critical points c of p. Adamczewski and Colbrook recently gave an explicit polynomial of degree 29984 with S(p,0)>1, certified by interval arithmetic, built on the counterexample found by GPT-6 Astra. Within their family of polynomials, with re-chosen coefficients, we give an explicit p in Q(i)[z] of degree 29440 with 1.00000093069254310 < S(p,0) < 1.00000093069254311. Jatar and Ng have shown that Smale's constant sup_p S(p,0) exceeds 1.1018, through polynomials of unspecified degree; the point here is an explicit polynomial with a certified bound. The bound is certified twice: by a ball-arithmetic Krawczyk certificate covering all 29439 critical points, and, independently, by the Adamczewski-Colbrook verifier, which confirms 29418 of them and is inconclusive (insufficient working precision) on the other 21. The exact coefficients and both verification programs are provided as ancillary files.

Author comments: 4 pages. Ancillary files: exact specification (polynomial_N1840.json), critical-point centres and disks, ball-arithmetic verifier (verify_ball_N1840.py), certificate summary, and the parameter patch used to run the Adamczewski-Colbrook verifier.

Primarily AI-generated textHuman understanding: no partsKrawczyk testSmale's mean value problemcritical points of polynomialsinterval arithmetic
Nov 10, 20264 pages
PDFView work

math.AG — Algebraic Geometry

The four-dimensional Hessian conjecture for potentials of degree at most five

Contributed by David Niedbala Giraudin

The Hessian conjecture HC_n asserts that if f in C[x_1,...,x_n] has det Hess(f) in C^×, then ∇f is a polynomial automorphism. It is known for n ≤ 3, false for n ≥ 5, and open for n = 4, where it implies the plane Jacobian conjecture. Ni proved HC_4 for potentials of degree at most four, and the author treated degree five when the top form depends on exactly three linear forms (hexagon:2611.00134). We prove HC_4 for every potential of degree at most five. The remaining top forms are a binary form or a fifth power of a linear form. Both cases are reduced, by weighted layers of the Hessian determinant and exact computer algebra over Q, to four elementary mechanisms: a Schur complement in one variable (which reduces to HC_3), a partial Legendre transform in two variables (which reduces to HC_2), a "dead direction" lemma (which reduces to HC_2 and the plane Jacobian conjecture in degrees at most (3,4), known by Moh), and explicit triangular inverses. Five self-contained verifiers are supplied as ancillary files. The paper has not been refereed.

Primarily AI-generated textHuman understanding: no partsGröbner basesHessian conjectureJacobian conjecturecomputer-assisted proofpolynomial automorphisms
Nov 06, 20267 pages
PDFView work

math.AG — Algebraic Geometry

The four-dimensional Hessian conjecture for quintic potentials with a ternary cone top

Contributed by David Niedbala Giraudin

The Hessian conjecture HCn\mathrm{HC}_n asserts that if f∈C[x1,…,xn]f\in\mathbb{C}[x_1,\dots,x_n] has det⁡Hess⁡(f)∈C×\det\operatorname{Hess}(f)\in\mathbb{C}^\times, then ∇f\nabla f is a polynomial automorphism. It is known for n≤3n\le 3, false for n≥5n\ge 5, and open for n=4n=4, where it implies the plane Jacobian conjecture. Z. Ni proved HC4\mathrm{HC}_4 for potentials of degree at most four. We prove HC4\mathrm{HC}_4 for every potential of degree five whose top homogeneous form depends on exactly three linear forms. The proof combines a weighted analysis of the Hessian determinant with exact computer-algebra certificates (Groebner bases and Rabinowitsch tests over Q\mathbb{Q}); one branch reduces to plane Jacobian pairs of degrees (4,3)(4,3), which are excluded by Magnus' theorem. A self-contained verifier is supplied as an ancillary file. The binary and unary cone tops in degree five remain open.

Author comments: 5 pages. Ancillary file anc/verify_hc4_ternary.py: 29 exact checks (python-flint, sympy, Singular via Sage), about 3 minutes. Extends arXiv:2608.14217 to degree five for ternary cone tops. Computations and writing assisted by Claude (Anthropic).

Primarily AI-generated textHuman understanding: no partsGroebner basesHessian conjectureJacobian conjecturecomputer-assisted proofpolynomial automorphisms
Nov 06, 20265 pages
PDFView work

math.CO — Combinatorics

Hadamard difference sets in groups with a cyclic odd quotient

Contributed by David Niedbala Giraudin

Let u > 1 be odd. We prove that the abelian group C_2 x C_{2u^2} contains no Hadamard difference set. Together with the recently announced proof of the circulant Hadamard conjecture, this shows that an abelian group of order 4u^2 (u > 1 odd) whose odd Sylow subgroups are all cyclic never contains a Hadamard difference set, so Lander's conjecture holds for Hadamard difference sets in these groups. More generally, let G be a group of order 4u^2 with a normal subgroup N such that G/N is isomorphic to E x C_{w^2}, where |E| = 4, w > 1, w | u and gcd(w, u/w) = 1. If every prime divisor of u/w is self-conjugate modulo rad(w) (modulo 4 rad(w) when E is cyclic), then G contains no Hadamard difference set. The proof adapts the alternating character products used for the cyclic case.

Primarily AI-generated textHuman understanding: no partsHadamard difference setsLander's conjectureMenon difference setscirculant Hadamard matricescyclotomic integersgroup rings
Nov 05, 2026
PDFView work

math.NT — Number Theory

The Hankel determinants of the Baum-Sweet sequence are 2-automatic

Contributed by David Niedbala Giraudin

Let b be the Baum-Sweet sequence and H_n = det(b_{i+j})_{0<=i,j<n} its Hankel determinants over F_2. We prove that the sequence chi_0(n) = [H_n != 0] is 2-automatic: chi_0(n+1) is computed by an explicit automaton with 8 states reading the binary expansion of n, and the minimal automaton of chi_0 reading least significant digits first has 74 states. The same holds for the shifted determinants det(b_{i+j+1}), with the same 8-state graph and 68 states. This contrasts with Mkaouar's theorem that the partial quotients of the Baum-Sweet series are not automatic. On the way we show that Theta = t f^2, a root of Z^3 + Z + t^3 in F_2((1/t)), has all its partial quotients in {t, t^3, t^3 + t}, given by an explicit coding of the Mills-Robbins expansion, and that the linear complexity profile of b satisfies -2 <= 2L(b,N) - N <= 3 for all N, all six values occurring. The proofs reduce to finite verifications, which an ancillary script performs.

Primarily AI-generated textHuman understanding: no partsBaum-Sweet sequenceHankel determinantsautomatic sequencescontinued fractionslinear complexitypower series over finite fields
Nov 05, 2026
PDFView work

math.CO — Combinatorics

A composite modulus and Frobenius digits in the Heilbronn triangle construction

Contributed by David Niedbala Giraudin

OpenAI proved that for every sufficiently large n there are n points in the unit square all of whose triangles have area at least c n^(-2+eta), with an explicit but extremely small eta (of order 10^(-235)). Subsequent public work lowered the cost of the construction, the latest claimed exponent being eta = 2/100866719, about 1.98*10^(-8). We introduce two changes. First, the digit base is taken to be a multiple of the label prime r and the main modulus is h = r B^(k-1) instead of B^k; this reduces the ratio h/tau between the modulus and the excluded determinant window from about B to about r, which allows the extension degree d = 3. Second, the norm polynomial is placed in the digits by a digit-wise convolution along the Frobenius expansion of the exponents, with a trace digit in a polynomial basis, giving k = 1440 positions. The result is Delta(n) >= c n^(-2+eta) with eta = 1/177022 > 5.64*10^(-6), for every sufficiently large n. The finite identities are checked by exact computation in the ancillary files.

Primarily AI-generated textHuman understanding: no partsHeilbronn triangle problemfield normfinite fieldslattice point countingprobabilistic method
Nov 04, 202611 pages
PDFView work

math.CO — Combinatorics

Every C4C_4-free graph on 4949 vertices has a vertex of degree at most 66: an independent verification

Contributed by David Niedbala Giraudin

ABSTRACT We give an independent proof that every graph on 4949 vertices containing no cycle of length four has a vertex of degree at most 66; equivalently, R(C4,K1,42)≤49R(C_4,K_{1,42})\le 49, hence R(C4,K1,42)=49R(C_4,K_{1,42})=49. In the notation of Erd\H{o}s, the least integer f(n)f(n) such that every graph on nn vertices with minimum degree at least f(n)f(n) contains a C4C_4 satisfies f(49)=7f(49)=7, while f(48)=f(50)=8f(48)=f(50)=8, so ff is not non-decreasing. These values were first established by Walters, Claude Fable, GPT Sol, Astra and Claude Opus (12 October 2026), by a different case split whose computational part is checked by the formally verified checker cake_lpr and assembled in Lean; we were not aware of their work when this note was written. Our proof combines structural lemmas, valid for every odd kk, on C4C_4-free graphs with k2k^2 vertices and minimum degree at least kk, a symmetry reduction for k=7k=7, and an exhaustive SAT search carried out by two separately written programs. Erd\H{o}s's question whether f(n+1)≥f(n)f(n+1)\ge f(n) for all sufficiently large nn (Problem 85 of erdosproblems.com) remains open. COMMENTS 8 pages. Independent verification of f(49)=7 (Erdos Problem #85), first established by Walters, Claude Fable, GPT Sol, Astra and Claude Opus (Zenodo, doi:10.5281/zenodo.23325806, 12 October 2026). Ancillary folder anc/: pure-Python scripts, solver logs and SHA-256 hashes of all formulas. Technical assistance: Claude (Anthropic). COMMENTAIRE DE VERSION (cas B seulement) v2: credits the earlier proof of f(48)=8>f(49)=7 by R. Walters, Claude Fable, GPT Sol, Astra and Claude Opus (Zenodo, doi:10.5281/zenodo.23325806, 12 October 2026; v1.1 20 October 2026), of which the author was not aware when v1 was posted. Title, abstract, introduction (new paragraph "Related work") and Remark 3 updated; the 48-vertex graph is isomorphic to their witness. No mathematical change; ancillary files unchanged.

Primarily AI-generated textHuman understanding: no partsC4-free graphsErdos problemsRamsey numbersSAT solvingcomputer-assisted proofminimum degree
Nov 04, 20268 pages
PDFView work

math.NT — Number Theory

A congruence modulo p^2 for the p-th coefficient of e(1-z)^((1-z)/z)

Contributed by David Niedbala Giraudin

Define E_n by sum_{n>=0} E_n z^n = exp(sum_{k>=1} z^k/(k(k+1))) = e(1-z)^((1-z)/z). Equivalently, e(1+1/x)^(-x) = sum_{n>=0} E_n (x+1)^(-n), the reciprocal of the expansion of e^(-1)(1+1/x)^x used by Yang in refinements of Carleman's inequality. We prove that for every odd prime p, E_p = -p/2 (mod p^2); in particular v_p(E_p) = 1. The proof is elementary. With Phi(u) = e(1+u)^(-1/u), it combines the two expressions of E_p through the coefficients of Phi that come from the identities e(1-z)^((1-z)/z) = Phi(-z)/(1-z) and e(1-z)^((1-z)/z) = Phi(z/(1-z)), and it reduces the congruence to the differential recurrence of the E_n read modulo p. A script checks the statement and the intermediate congruences for all odd primes below 200 and a few larger ones.

Primarily AI-generated textHuman understanding: no partsCarleman's inequalitycongruences modulo p^2harmonic numbersp-adic valuationpower series coefficients
Nov 04, 20264 pages
PDFView work

math.NT — Number Theory

The exact multiplicity of the Wilson supercongruence in F_q[t]

Contributed by David Niedbala Giraudin

Let q = p^s with p an odd prime, and let P be a monic irreducible polynomial of degree d >= 2 in F_q[t]. The Wilson analogue F_d = -1 mod P holds for the product F_d of all nonzero polynomials of degree less than d, and Thakur proved that P is a Wilson prime, i.e. F_d = -1 mod P^2, exactly when all exponents of P are congruent to 0 or 1 mod p, in which case the congruence holds modulo P^(p-1). He asked whether it can hold modulo a higher power, and what the exact multiplicities are. Let r be the largest integer such that all exponents of P are congruent to 0 or 1 modulo p^r. We prove that the exact multiplicity m = v_P(F_d + 1) is 1 if r = 0, p^r - 1 if 1 <= r <= s, and q + 1 if r > s. In particular m <= q + 1, and the multiplicity of a Wilson prime in the numerator of the sum over i < d of 1/(t^(q^i) - t) is exactly m - 1. Examples over F_3, F_5 and F_9 show that all regimes occur. A script checks the theorem on all primes of small degree and on these examples.

Primarily AI-generated textHuman understanding: no partsCarlitz factorialHasse derivativesWilson primesfunction fieldspolynomials over finite fieldssupercongruences
Nov 04, 20264 pages
PDFView work

math.NT — Number Theory

The p-adic valuations of the coefficients in Yang's expansion of (1+1/x)^x

Contributed by David Niedbala Giraudin

Yang's coefficients b_n, defined by (1+1/x)^x = e(1 - sum_{n>=1} b_n (x+1)^{-n}), appear in refinements of Carleman's inequality, and the literature on them concerns their analytic properties. We study their p-adic valuations for an odd prime p. From the identity 1 - sum_n b_n u^n = exp(-sum_{k>=1} u^k/(k(k+1))) one gets v_p(b_n) >= -M(n), where M(n) is the optimum of a knapsack problem on the compositions of n. We compute M(n) in closed form and show that, for n >= 2, the optimum is attained by a unique composition exactly when n = (p-1)m with m in an explicit set U_p defined by a digit condition. For these n the bound is an equality: v_p(b_n) = -(m + v_p(m!)). The set U_p has density 1/(p-1), so the valuation of b_n is determined on a set N_p of indices of density 1/(p-1)^2. The set N_p contains the indices p^K - 1, at which b_{p^K-1} is the unique coefficient of minimal valuation among b_1, ..., b_{p^K-1}. The same statements hold for the coefficients of e(1-u)^{1/u}, and the minimality statement for those of e(1-u)^{1/u-1}. A script checks all statements numerically in finite ranges.

Primarily AI-generated textHuman understanding: no partsCarleman's inequalityKummer's theoremcompositionsknapsack problemp-adic valuationsums of digits
Nov 04, 20265 pages
PDFView work

math.NT — Number Theory

A sharper Type I/II estimate for primes in arithmetic progressions to smooth moduli, and H_m << e^{3.8043 m}

Contributed by David Niedbala Giraudin

In Stadlmann's Type I/II equidistribution estimate for x^delta-smooth moduli, one of the three conditions, 64 varpi + 20 delta + 2 sigma < 1, can be replaced by 48 varpi + 18 delta + 2 sigma < 1. This weaker condition follows from the second one, 48 varpi + 16 delta + 4 sigma < 1, whenever delta <= sigma. The proof follows Stadlmann's argument and makes two changes: the length of a block in one Taylor expansion depends on the pair of shifts, and the bounds are summed over the pairs instead of being multiplied by their number. Combined with Stadlmann's general Harman-sieve construction, this gives a minorant for the primes with exponent of distribution 1/2 + 2 varpi to smooth moduli for every varpi < 7/544, instead of varpi = 0.01265. As a consequence, liminf (p_{n+m} - p_n) << e^{cm} for every c > 3.80428, and for every c > 3.80423 if a numerically computed value of the sieve deficit is used. This improves Stadlmann's exponent 3.8075.

Primarily AI-generated textHuman understanding: no partsHarman's sieveType I/II estimatesbounded gaps between primesexponent of distributionprimes in arithmetic progressionssmooth moduli
Nov 04, 20265 pages
PDFView work

math.PR — Probability

Computer-assisted bounds 0.556921 <= p_c <= 0.6463 for site percolation on the square lattice

Contributed by David Niedbala Giraudin

Let p_c be the critical probability of Bernoulli site percolation on Z^2. We prove 0.556921 <= p_c <= 0.6463. The previous best rigorous bounds known to us are p_c >= 0.5567 (Ashton, 2026, extending van den Berg and Ermakov, 1996) and p_c <= 0.666894 (Wierman and Oberly, 2024). The lower bound uses the growth-process comparison of van den Berg and Ermakov with the exact posterior on the exploration tree. We reduce this posterior to a scalar interval recursion and explore the tree generation by generation, with a prescribed order among siblings. This passes the value 0.556788... that the same scalar computation gives when the order is not used, and the value 0.556788090 reported by Ashton as the limit of his relaxation. The upper bound uses the substitution method of Wierman, in two stages with 4x4 regions, from the line graph of Z^2 (site threshold 1/2) to Z^2. Both bounds are certified by short pure-Python programs in exact rational and integer arithmetic.

Primarily AI-generated textHuman understanding: no partscomputer-assisted proofcritical probabilitysite percolationsquare latticestochastic dominationsubstitution method
Nov 04, 20268 pages
PDFView work

math.NT — Number Theory

A certified lower bound for the essential minimum of the Zhang-Zagier height

Contributed by David Niedbala Giraudin

Let h be the absolute logarithmic Weil height. We prove that the essential minimum of the Zhang-Zagier height h(a)+h(1-a) is at least 0.2497815: for every d > 0, only finitely many algebraic numbers a satisfy h(a)+h(1-a) < 0.2497815 - d. The previous best lower bound was 0.24874 (Flammang, 2018). The proof combines Smyth's auxiliary-function method, with the polynomials of Doche and of Flammang, and the condition that the discriminant of the minimal polynomial is a nonzero integer, in the potential-theoretic form used by Smith and by Orloski, Talebizadeh Sardari and Smith for the trace problem. The infimum of the resulting auxiliary function is bounded below rigorously by monotone interval bounds and adaptive bisection, from a stored certificate. The statement concerns the essential minimum and is weaker in nature than the pointwise bounds of Doche and Flammang.

Primarily AI-generated textHuman understanding: no partsWeil heightZhang-Zagier heightauxiliary functionscomputer-assisted proofessential minimumlogarithmic energy
Nov 04, 20264 pages
PDFView work

cs.DS — Data Structures and Algorithms

Three-machine unit-job scheduling in time O((L+2)^276)

Contributed by David Niedbala Giraudin

OpenAI recently gave a deterministic polynomial-time algorithm for P3|prec,p_j=1|C_max (problem OPEN8 of Garey and Johnson), with running time O((L+2)^150020) on a multitape Turing machine, L being the input length; the same exponent appears in the accompanying Lean statement. The exponent comes from enumerating all Boolean formulas with at most 10000 leaves, each leaf choosing its own triple of jobs. We show that every description actually used by the structural proof involves at most 21 distinct job triples and at most 3 distinct rank thresholds. Restricting the enumerated family accordingly, and using the length bound on accepting paths already proved there to limit the number of reachability passes, the same algorithm runs in time O((L+2)^276).

Primarily AI-generated textHuman understanding: no partsOPEN8polynomial-time algorithmprecedence constraintsrunning-time exponentthree-machine schedulingunit processing times
Nov 04, 20263 pages
PDFView work

math.NT — Number Theory

Two improved lower bounds for the 2-adic valuation of the constant of the Prouhet-Tarry-Escott problem

Contributed by David Niedbala Giraudin

For an ideal solution of the Prouhet--Tarry--Escott problem of size nn the associated constant CC is divisible by a large power of 22. Restricting to symmetric solutions, we prove two new lower bounds for v2(C)v_2(C): v2(C)≥14v_2(C)\ge14 at n=15n=15, improving 1212, and v2(C)≥19v_2(C)\ge19 at n=20n=20, improving 1818; both earlier bounds are those of the companion article hexagon:2611.00057. The first rests on two identities satisfied by every symmetric solution of odd size, one relating v2(C)v_2(C) to a difference of two products and one turning the index relation into an equality, together with an arithmetic criterion for a block of entries of equal valuation. The second rests on an identity internal to each of the two sides, from which we deduce that the vanishing of the cross invariant RR forces k0≡0(mod4)k_0\equiv0\pmod4 when k0≥4k_0\ge4. Two self-contained verifiers accompany the note.

Primarily AI-generated textHuman understanding: no parts$2$-adic valuationProuhet-Tarry-Escott problemideal solutionslower boundssymmetric solutions
Nov 04, 20267 pages
PDFView work

math.NT — Number Theory

The 2-adic valuation of the constant for symmetric ideal Prouhet-Tarry-Escott solutions

Contributed by David Niedbala Giraudin

For an ideal solution of the Prouhet--Tarry--Escott problem of size nn, let CC denote the associated constant, and let Cn‾\overline{C_n} be the greatest common divisor of these constants. Filaseta and Markovich obtained v2(C8‾)≥6v_2(\overline{C_8})\ge6 and determined v2(C9‾)=9v_2(\overline{C_9})=9, and asked for improved lower bounds in the range 10≤n≤1210\le n\le12; Bera and Nair gave bounds for n=10n=10 and n=12n=12. We treat the symmetric case at every size, even and odd, by 22-adic arguments throughout. A single identity, the row law, governs both parities. For nn even, over Z\mathbb{Z}, it splits into two regular systems and yields v2(C)≥6,8,11,12,12,16,18,18v_2(C)\ge6,8,11,12,12,16,18,18 for n=6,8,10,…,20n=6,8,10,\dots,20. The values at n=6,8,10,12n=6,8,10,12 are attained and hence exact for the symmetric constant: in the symmetric case this closes both brackets of Bera--Nair, and gives v2(C8′)=8v_2(C'_8)=8, for which the published information was v2(C8‾)≥6v_2(\overline{C_8})\ge6. We also record that the two lower bounds of Bera--Nair, 99 at n=10n=10 and 1111 at n=12n=12, are attained by 22-adic solutions symmetric about −1/2-1/2, so that no argument using 22-adic information alone can raise them. For nn odd, over Z2\mathbb{Z}_2, it combines with a finite-difference lemma refining a congruence of Filaseta--Markovich to give v2(C)≥11,12,12v_2(C)\ge11,12,12 for n=11,13,15n=11,13,15, against 88, 1010 and 1111 from Kleiman's bound (n−1)!∣C(n-1)!\mid C; the chain also reproduces the known values 4,6,94,6,9 at n=5,7,9n=5,7,9. At n=11n=11 the bound is sharp: the two quadratic near-solutions of Coppersmith, Mossinghoff, Scheinerman and VanderKam are symmetric ideal solutions over Z2\mathbb{Z}_2 with v2(C)=11v_2(C)=11, since in both of the real quadratic fields involved the prime 22 splits. This answers, for n=11n=11 and p=2p=2, two questions of Filaseta--Markovich, and exhibits for those sizes the case p≤np\le n of the question closing Rees--Smyth, who construct pp-adic ideal solutions only for p>np>n: at the prime 22 there is no local obstruction at these sizes. At n=13n=13 we exhibit a symmetric ideal solution over Z2\mathbb{Z}_2, obtained from a second object of the same authors, although its constant has valuation 1717.

Primarily AI-generated textHuman understanding: no parts$2$-adic valuationNewton polygonsProuhet-Tarry-Escott problemideal solutionsmultigradessymmetric solutions
Nov 04, 202619 pages
PDFView work

math.NT — Number Theory

Recycled roots under reduction and descent in the Casas-Alvero problem

Contributed by David Niedbala Giraudin

For a Casas-Alvero polynomial ff, the type of ff is one less than the minimal number of roots of ff needed to meet every Hasse derivative H1f,…,Hd−1fH_1f,\dots,H_{d-1}f. We show that the type does not increase under reduction modulo a prime and under the descent from degree npenp^e to degree nn in characteristic pp. Consequently, if no Casas-Alvero polynomial of degree nn and type at most kk exists over F‾p\overline{\mathbb F}_p, then none of degree npenp^e and type at most kk exists in characteristic 00, for every e≥0e\ge 0. For k=2k=2 the hypothesis is equivalent to p∤Nnp\nmid N_n for an explicit integer NnN_n, and we show by a finite computation that Nn≠0N_n\ne0 for 3≤n≤223\le n\le 22 and n=24n=24. In particular there is no counterexample of type at most 22 in degree 2424. This gives infinite families of degrees for which the conjecture is not known and every counterexample has type at least 33: the degrees 5⋅8009e5\cdot 8009^e, the degrees 6pe6p^e for 2121 primes pp that are bad for degree 66, the degrees 7pe7p^e, 8pe8p^e, 9pe9p^e and 10pe10p^e for 1313, 1717, 1616 and 103103 explicit primes pp that are bad for these degrees, and the degrees 20pe20p^e and 24pe24p^e for all primes pp outside a finite set (for 20pe20p^e, including p=231−1p=2^{31}-1). For k=3k=3 we obtain the first degrees in which every counterexample has type at least 44: the degrees 6pe6p^e for p∈{983,1901,51313000813080529}p\in\{983,1901,51313000813080529\}, the degrees 8⋅397e8\cdot397^e, the degrees 9pe9p^e for p∈{613,757}p\in\{613,757\} and the degrees 10pe10p^e for 1313 primes pp.

Primarily AI-generated textHuman understanding: no partsCasas-Alvero conjectureHasse derivativesbad primespolynomials over finite fieldsrecycled rootsreduction modulo presultants
Nov 03, 20267 pages
PDFView work

math.NT — Number Theory

Hecke eigenvalues in level 1 modulo powers of 2 and 3: Hatada's question (1981) and the Coleman-Stein conjecture

Contributed by David Niedbala Giraudin

Let ff be a normalized Hecke eigenform of level 11 and weight kk, with eigenvalues an(f)a_n(f). In 1981 Hatada asked whether ap(f)≡1+p(mod2a)a_p(f)\equiv 1+p \pmod{2^a} whenever p≡±1(mod2a−1)p\equiv\pm1\pmod{2^{a-1}} and 6≤a≤136\le a\le 13. Rustom's congruence modulo 128128 answers this for a≤7a\le 7. We show that the answer is affirmative for a≤10a\le 10 and negative for a=11a=11, 1212 and 1313, the counterexamples coming from weight 1616 and p=12289p=12289. The proof combines Rustom's theorem with a certificate for T5T_5 modulo 512512 on period polynomials, a 22-adic Galois law (for instance ap≡1+pk−1(mod210)a_p\equiv 1+p^{k-1}\pmod{2^{10}} for every p≡1(mod8)p\equiv 1\pmod 8), and a reduction to a computation in a finite group. As a consequence, ap(f)=0a_p(f)=0 implies p≡−1(mod211)p\equiv -1\pmod{2^{11}}. At the prime 33 we show that, on Hatada's lattice of period polynomials, T22≡9(k−1)2(mod27)T_2^2\equiv 9(k-1)^2\pmod{27}, with refinements modulo 8181. This gives an independent proof of Conjecture 9.1 of Rustom without any ramification hypothesis and of the level 11 case of the Coleman--Stein conjecture, both of which also follow from Rustom's recent classification modulo 8181. We also prove that an(f)≡σk−1(n)(mod81)a_n(f)\equiv\sigma_{k-1}(n)\pmod{81} for every n≡1(mod3)n\equiv 1\pmod 3, and a 33-adic Galois law modulo 243243 on the Galois group of Q(−3)\mathbb{Q}(\sqrt{-3}), which gives congruences modulo 243243 and 729729 for suitable split primes and a bilinear law for primes ℓ≡2(mod3)\ell\equiv 2\pmod 3. Beyond 729729, for every prime ℓ≡2(mod3)\ell\equiv 2\pmod 3 we prove aℓ2≡σk−1(ℓ)2(mod3min⁡(2j+2,10))a_\ell^2\equiv\sigma_{k-1}(\ell)^2\pmod{3^{\min(2j+2,10)}}, where j=v3(ℓ+1)j=v_3(\ell+1); the exponent 2j+22j+2 is attained for j≤4j\le 4 and fails for j=5j=5. Each statement is marked as proved, known, verified or open. The finite computations are certified by seven Python scripts, provided as ancillary files.

Primarily AI-generated textHuman understanding: no partsColeman-Stein conjectureGalois representationsHecke eigenvaluescongruences of modular formsperiod polynomials
Nov 03, 202627 pages
PDFView work

math.NT — Number Theory

The Hankel determinants of an automatic sequence need not be automatic

Contributed by David Niedbala Giraudin

Allouche, Han and Niederreiter asked whether the sequence of Hankel determinants of a dd-automatic sequence must be dd-regular, or must become dd-automatic after reduction modulo an integer. We answer the first question in the negative, and the second one for the reduction modulo 33. Let α\alpha be the root of f4+f2−Tf+1=0f^4+f^2-Tf+1=0 in F3((1/T))\mathbb{F}_3((1/T)) with ∣α∣<1|\alpha|<1, the quartic of Mills and Robbins, and let SS be its coefficient sequence, which is 33-automatic by Christol's theorem. The Hankel determinants of SS vanish in runs whose lengths are unbounded but of the order of the square root of their position, because the partial quotients of α\alpha are unbounded while its irrationality exponent is 22; and a lemma of Schlage-Puchta forbids runs in that regime in an automatic sequence. Hence these Hankel determinants are kk-automatic for no kk, and the integer Hankel determinants of any lift of SS are kk-regular for no kk.

Primarily AI-generated textHuman understanding: no partsHankel determinantsautomatic sequencescontinued fractionspower series over finite fields
Nov 03, 20265 pages
PDFView work

math.NT — Number Theory

The binary Collatz dynamics of the trinomials x^n+x+1: an independent proof of two conjectures of Gallardo and Rahavandrainy

Contributed by David Niedbala Giraudin

Gallardo and Rahavandrainy studied an analogue of the Collatz map on F_2[x], in which x(x+1) plays the role of 2 and x^2+x+1 that of 3: an odd polynomial A is sent to the odd part of 1+(x^2+x+1)A. They proved that every orbit reaches 1, and conjectured that the orbit of the trinomial x^n+x+1 has length 2^s+1, where s is the largest integer with 2^(s+1) < n, and that for 1 <= t <= s-1 it contains 2^t terms of the same degree. We prove both statements for every n >= 3. They were proved earlier, with a complete Lean 4 formalization, by W. Choi; the proof given here was obtained independently. The proof rests on the identity (x^2+x+1)+x(x+1)=1: it reduces the dynamics to a map from one plateau to the next, characterises the last plateau of any orbit, and shows that along the orbit of x^n+x+1 the plateaus start at the 2^j-th powers of the odd parts of the polynomials x^m(x^2+x+1)+1, the index m following an explicit binary recursion. We also note that a later restatement of the conjecture, with a non-strict inequality, fails exactly when n is a power of 2. A script checks all the statements numerically.

Primarily AI-generated textHuman understanding: no parts
Nov 03, 20266 pages
PDFView work

math.NT — Number Theory

On the largest irreducible factor of an odd perfect polynomial over F2\mathbb{F}_2

Contributed by David Niedbala Giraudin

A polynomial AA over F2\mathbb{F}_2 is perfect if it equals the sum σ(A)\sigma(A) of all its divisors, and odd if it is coprime to x2+xx^2+x. Canaday conjectured in 1941 that 1 is the only odd perfect polynomial. Known necessary conditions on a counterexample bound its number of distinct irreducible factors (ω≥5\omega\ge 5, Gallardo and Rahavandrainy), its number of irreducible factors counted with multiplicity and its degree (Ω≥12\Omega\ge 12 and deg⁡A>200\deg A>200, Cengiz, Pollack and Trevino), and, when all exponents equal 2, the degree of its smallest irreducible factor (at least 40, Gallardo). We bound a different invariant: every odd perfect polynomial A≠1A\ne 1 has an irreducible factor of degree at least 20. The proof reduces the question, for each DD, to a finite system: if all irreducible factors of AA have degree at most DD, the exponents of AA belong to an explicit finite set, through the cyclotomic factorisation of σ(Ph)\sigma(P^h) and the multiplicative order of PP modulo the factors of σ(Ph)\sigma(P^h). An iterated sieve on the resulting production relations empties for every D≤19D\le 19. The computation was carried out twice, by two independent programs, with identical results; the second program is attached as an ancillary file. As a cross-check of the method, the same programs reproduce, by the orbit argument of Gallardo and Rahavandrainy, the exclusion of every prime of degree at most 30 as the smallest factor of a special perfect polynomial, in agreement with the published bounds.

Primarily AI-generated textHuman understanding: no partsCanaday conjecturefinite fieldsperfect polynomialssum of divisors
Nov 03, 20266 pages
PDFView work

math.NT — Number Theory

The invariant cMc_M of Gallardo and Rahavandrainy at Mersenne prime exponents, and the case p=7p=7

Contributed by David Niedbala Giraudin

A Mersenne prime polynomial is an irreducible polynomial over F2\mathbb{F}_2 of the form xa(x+1)b+1x^a(x+1)^b+1 with a,b≥1a,b\ge1. Gallardo and Rahavandrainy conjectured that, apart from two exceptions, σ(M2h)\sigma(M^{2h}) always has an irreducible factor which is not a Mersenne prime. For a prime p≥5p\ge5 they proved it for every MM outside an exceptional set Σp=Σp1∪⋯∪Σp4\Sigma_p=\Sigma_p^1\cup\dots\cup\Sigma_p^4, defined through an integer cMc_M and an odd integer mMm_M read off the leading coefficients of σ(σ(Mp−1))\sigma(\sigma(M^{p-1})), and later they proved it for every Mersenne prime number p≥31p\ge31; their method does not reach p=7p=7. We compute cMc_M exactly when p=2d−1p=2^d-1 is a Mersenne prime number: cM=d+1c_M=d+1 if deg⁡M≠d\deg M\ne d, and cM=dc_M=d if deg⁡M=d\deg M=d. Consequently Σp1\Sigma_p^1 consists of the Mersenne primes of degree dd or d+1d+1, Σp2\Sigma_p^2 is empty, and Σp3\Sigma_p^3, Σp4\Sigma_p^4 are described by mM=deg⁡M−d−1m_M=\deg M-d-1 and mM=deg⁡M−dm_M=\deg M-d respectively. For p=7p=7 this reduces the conjecture to the Mersenne primes MM with mM∈{deg⁡M−4,deg⁡M−3}m_M\in\{\deg M-4,\deg M-3\}. A direct computation shows that σ(M6)\sigma(M^6) has a non-Mersenne irreducible factor for every Mersenne prime MM of degree at most 500500, and that mM≤17m_M\le17 in that range. Hence the conjecture holds whenever 77 divides 2h+12h+1 and deg⁡M≤500\deg M\le500, and a counterexample with 7∣2h+17\mid 2h+1 would need mM≥deg⁡M−4>496m_M\ge\deg M-4>496. A script attached as an ancillary file checks these computations, and reproduces the table of exceptional sets of Gallardo and Rahavandrainy.

Primarily AI-generated textHuman understanding: no partsCyclotomic PolynomialsMersenne prime polynomialsfinite fieldsperfect polynomialssum of divisors
Nov 03, 20264 pages
PDFView work

math.CV — Complex Variables

The Möbius pseudodistance of the annulus and an improved lower bound for Korenblum's constant

Contributed by David Niedbala Giraudin

We show that Korenblum's constant of the Bergman space satisfies c2≥0.446c_2\ge 0.446. The best published lower bound was c2≥0.4263c_2\ge 0.4263 (Wikström, 2026). The new ingredient is a closed form, in Jacobi theta functions, of the Möbius pseudodistance of the annulus {c<∣z∣<1}\{c<|z|<1\} between two points of the same centred circle. It separates the variables and yields three monotonicity properties, one of which, a profile inequality, combined with Kirszbraun's theorem in the hyperbolic plane, improves the constant in Wang's annular estimate. Wikström's dual moment criterion is then verified at c=223/500c=223/500 for an explicit measure with fourteen rational atoms, in rigorous arithmetic, by a self-contained verifier. The French version of this note is dated 21 October 2026.

Primarily AI-generated textHuman understanding: no partsBergman spaceKirszbraun theoremKorenblum's constantMöbius pseudodistancecomputer-assisted proofmaximum principlemoment dualitytheta functions
Nov 02, 20265 pages
PDFView work

math.GT — Geometric Topology

A certified upper bound for the distortion of the trefoil knot

Contributed by David Niedbala Giraudin

The distortion of a rectifiable closed curve γ⊂R3\gamma\subset\mathbb R^3 is the supremum, over pairs of distinct points, of the ratio of the length of the shorter arc of γ\gamma between them to their distance; the distortion δ(K)\delta(K) of a knot type KK is the infimum over all curves of type KK. For the trefoil, the published lower bound is δ≥5π/3\delta\ge5\pi/3, valid for every non-trivial knot (a recent preprint claims δ>6.5321\delta>6.5321), and the only upper bound we found in the literature is the value 7.167.16 obtained by numerical simulation. We exhibit an explicit polygon with 192192 vertices, of knot type trefoil, whose distortion is at most 6.926.92. The proof is computer-assisted: the knot type is certified by an explicit piecewise-linear path of embedded polygons starting from a polygon on a torus, and the distortion by exact rational arithmetic on every pair of edges. Two separately written verifiers are supplied.

Primarily AI-generated textHuman understanding: no partsGromov distortioncomputer-assisted proofknot distortionpolygonal knotstrefoil
Nov 02, 20264 pages
PDFView work

math.NT — Number Theory

On Problem 5 of Vitorino and Vukusic: sup⁡k≥0B(2kα)≥12\sup_{k\ge 0} B(2^k\alpha)\ge 12

Contributed by David Niedbala Giraudin

For an irrational α\alpha let B(α)=lim sup⁡nan(α)B(\alpha)=\limsup_n a_n(\alpha) be the upper limit of its partial quotients. Vitorino and Vukusic proved sup⁡k≥0B(2kα)≥5\sup_{k\ge 0}B(2^k\alpha)\ge 5 for every irrational α\alpha and asked, as their Problem 5, for an improvement. We prove sup⁡k≥0B(2kα)≥12\sup_{k\ge 0}B(2^k\alpha)\ge 12. The proof is a finite computation organised around an invariant N(C)N(C): the least number of doubling levels at which the recurrent kernel of a synchronous product of Raney transducers becomes a finite union of pure cycles. We show that N(C)N(C) is intrinsic, that N(C)<∞N(C)<\infty for every CC would imply the 22-adic Littlewood conjecture, and that N(C)=∞N(C)=\infty is equivalent to a rigidity failure; we compute N(C)=1,1,3,5,5,8,15,21,29,30,31N(C)=1,1,3,5,5,8,15,21,29,30,31 for C=1,…,11C=1,\dots,11. In the language of Badziahin's set LMad this settles a level-bounded form of his Problem B for C≤11C\le 11. The cycles which survive are ideal classes of discriminant D≡1(mod8)D\equiv 1 \pmod 8 whose whole p2\mathfrak{p}_2-orbit has partial quotients at most CC; we list them, and check the lists by an independent arithmetic route, in both directions for D≤105D\le 10^5. The result concerns the upper limit BB only. On the side of the supremum MM it gives sup⁡kM(2kα)≥12\sup_k M(2^k\alpha)\ge 12, which is weaker than what is known: Vitorino and Vukusic prove 1515, and Badziahin's bound 1/251/25 yields 2424. Two self-contained Python files, without external dependency, reproduce the table and the lists of discriminants; the table up to C=8C=8 takes about fourteen seconds.

Primarily AI-generated textHuman understanding: no partsRaney transducerscomputer-assisted proofcontinued fractionsideal classesp-adic Littlewood conjecture
Nov 02, 202610 pages
PDFView work

math.GT — Geometric Topology

Certified ropelength bounds for torus knots and the tight knot constant

Contributed by David Niedbala Giraudin

The tight knot constant α0\alpha_0 is the largest constant with L(K)≥α0 Cr(K)3/4L(K)\ge\alpha_0\,\mathrm{Cr}(K)^{3/4} for every knot KK, where LL is the ropelength (unit-radius rope) and Cr\mathrm{Cr} the crossing number. We exhibit an explicit C1,1C^{1,1} embedding of the torus knot T(19,24)T(19,24), with Cr=432\mathrm{Cr}=432, of thickness at least 11 and length at most 939.984939.984. Hence α0≤9.9200\alpha_0\le 9.9200. The published bound is 10.7610.76. The proof is computer-assisted: the knot type is certified by an explicit piecewise-linear path of embedded polygons starting from a polygon on a torus, and the thickness by exact integer and rational arithmetic. Two separately written verifiers are supplied, together with certificates for T(14,17)T(14,17) and T(11,14)T(11,14).

Primarily AI-generated textHuman understanding: no partscomputer-assisted proofropelengththicknesstight knotstorus knots
Nov 02, 20265 pages
PDFView work

math.CO — Combinatorics

Coincidences of qq-analogues of Markoff numbers outside the known families: an answer to a question of Labbé, Lapointe and Steiner

Contributed by David Niedbala Giraudin

Labbé, Lapointe and Steiner proved that w↦μq(w)12w\mapsto\mu_q(w)_{12} is injective on Christoffel words, gave two families of identities showing that it is not injective on {0,1}∗\{\mathtt{0},\mathtt{1}\}^*, and asked whether every coincidence μq(x)12=μq(y)12\mu_q(x)_{12}=\mu_q(y)_{12} comes from these two families. We show that it does not. The smallest counterexamples have length 2424; by an exhaustive computation, among words of length at most 3232 there are exactly 5050 classes of coincidences not explained by the two families, 1010 of length 2424 and 4040 of length 3030. Each of them contains an instance of one of a few new identities, which we prove for a generic 2×22\times2 matrix in place of the matrix of a factor of the word. One of these identities belongs to an infinite family, indexed by k≡1(mod4)k\equiv1\pmod 4, which we prove for every such kk.

Primarily AI-generated textHuman understanding: no partsChristoffel wordsMarkoff numberscombinatorics on wordsq-analogues
Nov 02, 20266 pages
PDFView work

math.PR — Probability

Upper bounds for the Chvátal–Sankoff constants γk\gamma_k, k≥3k\ge3

Contributed by David Niedbala Giraudin

Lueker (J. ACM 56(3), 2009) constructed a family of finite-state machines Mh\mathcal{M}_h whose associated transfer matrices yield upper bounds on the Chvátal–Sankoff constants γk\gamma_k, and proved (his Theorem 3.26) that these bounds converge to γk\gamma_k for every alphabet size kk. He published values only for k=2k=2. For k≥3k\ge3 the best upper bounds we were able to find in the literature in September 2026 were still those of Dančík's 1994 thesis: subsequent work generalising Lueker has generalised his Section 2, the lower bound. We implement Mh\mathcal{M}_h for arbitrary kk. One ingredient has no binary analogue — the generating function of a truncation class when both sides of a minimal match pair are truncated — and we derive it. We then give a reduction by relative forms under which the transition multiplicities of the transfer matrix are falling factorials in kk; one alphabet-free construction consequently determines the exact matrix for every kk. We obtain improved upper bounds for k=3,…,15k=3,\dots,15, each supported by a Collatz–Wielandt certificate verified in exact rational arithmetic, among them γ5≤0.645033\gamma_5\le0.645033. A note added on 31 October 2026 compares these values with those of a repository made public by L. Jack on 25 October 2026.

Primarily AI-generated textHuman understanding: no partsChvátal–Sankoff constantsCollatz–Wielandt certificateslongest common subsequencetransfer matrices
Nov 02, 20267 pages
PDFView work

math.NT — Number Theory

A closed-form bound for linear forms in three pp-adic logarithms of rational numbers

Contributed by David Niedbala Giraudin

We deduce from the pp-adic kit for three logarithms of the companion note hexagon:2610.00706 a fully explicit bound in closed form. If γ1,γ2,γ3\gamma_1,\gamma_2,\gamma_3 are multiplicatively independent rationals, congruent to 11 modulo pp (modulo 44 if p=2p=2), of heights at most ajlog⁡pa_j\log p with aj≥1a_j\ge1, and if ∣bj∣≤B|b_j|\le B, then vp(γ1b1γ2b2γ3b3−1)≤a1a2a3 B2max⁡{27 711, C2(p)max⁡jaj}v_p(\gamma_1^{b_1}\gamma_2^{b_2}\gamma_3^{b_3}-1)\le a_1a_2a_3\,\mathcal{B}^2\max\{27\,711,\ C_2(p)\max_j a_j\}, where B=max⁡{log⁡B/log⁡p, 10}\mathcal{B}=\max\{\log B/\log p,\,10\} and C2(p)=11 107 pp−1(1+0.31log⁡p)2C_2(p)=11\,107\,\frac{p}{p-1}\bigl(1+\frac{0.31}{\log p}\bigr)^2, as soon as γ1b1γ2b2γ3b3≠1\gamma_1^{b_1}\gamma_2^{b_2}\gamma_3^{b_3}\ne1. By a change of basis in the multiplicative group, the result applies to arbitrary rationals prime to pp. On the examples of that note, the bound is 4242 to 956956 times smaller than that of Yu's explicit theorem, and stays within a factor between 1.21.2 and 2.52.5 of the numerical optimisation of the parameters of the kit.

Primarily AI-generated textHuman understanding: no partsYu's theoremexplicit boundsinterpolation determinantslinear forms in p-adic logarithms
Nov 02, 20266 pages
PDFView work

math.NT — Number Theory

The exponent of pp in xp−1−1x^{p-1}-1: Yamada's constant 283 lowered to 69

Contributed by David Niedbala Giraudin

Yamada (J. Number Theory 130, 2010) deduced from the method of interpolation determinants of Bugeaud and Laurent the bound vp(xp−1−1)≤283 (p−1)log⁡y log⁡(xy)/(log⁡p)2+4v_p(x^{p-1}-1)\le 283\,(p-1)\log y\,\log(xy)/(\log p)^2+4, for multiplicatively independent integers x,yx,y coprime to pp. We replace 283 by 69. The new ingredient is an elementary bound, by rearrangement, on the spread of the exponents that occur in the Liouville inequality: it at least halves the height term of Yamada's criterion, involves no congruence class, and allows the parameters to be re-optimised. The proof is complete up to the lemmas of Bugeaud–Laurent (zero lemma, analytic upper bound) and of Laurent–Mignotte–Nesterenko (bound for the polynomial), which are used as they stand. A self-contained verifier checks the numerical inequalities.

Primarily AI-generated textHuman understanding: no partsFermat quotientsYamada's boundinterpolation determinantslinear forms in p-adic logarithms
Nov 02, 20266 pages
PDFView work

math.NT — Number Theory

A kit for linear forms in three pp-adic logarithms

Contributed by David Niedbala Giraudin

We transpose to the pp-adic case the kit of Mignotte and Voutier for linear forms in three logarithms. The new tool is a lower bound for the pp-adic valuation of interpolation determinants with no factorial loss: it is obtained by expanding the powers θℓz\theta^{\ell z} as binomial series in θ−1\theta-1, and then transporting an order of vanishing that we compute optimally for generic points, by means of the initial forms of the space of exponential polynomials involved. It holds for every prime pp. Combined with a rearrangement bound for the spread of the exponents and with Gouillon's zero lemma applied within a Teichmüller class, it gives a criterion of the form of criterion (2.8) of Mignotte–Voutier, in which log⁡ρ\log\rho is replaced by log⁡p\log p and the height term contains no analytic contribution. For two logarithms, in Qp\mathbb{Q}_p with pp odd, it improves Lemma 8 of Bugeaud–Laurent. A change of basis in the multiplicative group reduces to the case of principal units: the factor g=p−1g=p-1 leaves the volumes and moves into the heights. On examples, with exponents up to 101010^{10} or 103010^{30}, the complete bounds (degenerate cases included) are 154154 to 667667 times smaller than those of Yu's explicit theorem for p∈{5,13}p\in\{5,13\}, 608608 to 19801980 times for p∈{7,11}p\in\{7,11\} (where the explicit form of Yu goes through Q(i)\mathbb{Q}(i)), and 7373 to 105105 times for p=101p=101.

Primarily AI-generated textHuman understanding: no partsBaker's methodYu's theoreminterpolation determinantslinear forms in p-adic logarithms
Nov 02, 20269 pages
PDFView work

math.NT — Number Theory

An optimal multiplicity estimate for interpolation determinants in three logarithms

Contributed by David Niedbala Giraudin

In the kit of Mignotte and Voutier for linear forms in three logarithms, the order of vanishing at the origin of the interpolation determinant is bounded below by Waldschmidt's general multiplicity lemma; the authors indicate that this estimate should be improvable. We give a lower bound for this order which is optimal for generic points. The functions involved span a space whose initial forms are described by a uniqueness property for a linear differential equation with constant coefficients. As a consequence, the left-hand side of their criterion (2.8) can be taken equal to (2K+1)(L−1)3log⁡ρ\frac{(2K+1)(L-1)}{3}\log\rho, with main term 2KL3log⁡ρ\frac{2KL}{3}\log\rho instead of KL2log⁡ρ\frac{KL}{2}\log\rho. On the two examples of their paper, with their public code modified in one line and the conditions of the zero lemma checked, the bounds given by the criterion go from 17.94⋅10617.94\cdot10^6 to 4.79⋅1064.79\cdot10^6 and from 28.85⋅10628.85\cdot10^6 to 7.00⋅1067.00\cdot10^6. The same estimate is the multiplicity input of our kit for three pp-adic logarithms.

Primarily AI-generated textHuman understanding: no partsinterpolation determinantslinear forms in logarithmsmultiplicity estimateszero lemma
Nov 02, 20265 pages
PDFView work

math.NT — Number Theory

Uniformizability of elementary Anderson tt-motives of dimension 22

Contributed by David Niedbala Giraudin

Let M(A)M(A), A∈M2(C∞)A\in M_2(\mathbb{C}_\infty), be the elementary Anderson tt-motive of dimension 22 and rank 44 defined by Te=θe+Aτe+τ2eTe=\theta e+A\tau e+\tau^2e. Using the affine equation of Ehbauer, Grishkov and Logachev, we give an explicit sufficient condition for M(A)M(A) to be uniformizable, in terms of the valuations of the coefficients of that equation. It holds as soon as no cancellation occurs among the four summands of one of these coefficients; in particular h1(M(A))=4h^1(M(A))=4 in the simple case where no cancellation occurs in any coefficient. This proves their Conjecture 3.7: h1(M(A))=4h^1(M(A))=4 whenever (ord a11,ord a12,ord a21,ord a22)(\mathrm{ord}\,a_{11},\mathrm{ord}\,a_{12},\mathrm{ord}\,a_{21},\mathrm{ord}\,a_{22}) lies outside an explicit union of nine hyperplanes.

Primarily AI-generated textHuman understanding: no partsAnderson t-motivesDrinfeld modulesfunction fieldsuniformizability
Oct 31, 20264 pages
PDFView work