Browse

Number Theory

math.NT — Number Theory

math.NT RSS feed

Works in math.NT

353 works

math.NT — Number Theory

The rational points of the non-split Cartan modular curve of level 25

Contributed by Manvir Jaswal

We prove that the modular curve Xns+(25)X_{\mathrm{ns}}^{+}(25) of the normalizer of a non-split Cartan subgroup of level 25, of genus 14 and Jacobian rank 14, has exactly nine rational points, all of them CM. This is the level 25 case of a conjecture of Rouse, Sutherland and Zureick-Brown, and with their theorem it determines the 5-adic images of Galois of elliptic curves over Q\mathbb{Q} without complex multiplication. A descent by the modular units of the curve, using no information on the Mordell–Weil group, places every rational point in the residue disc of a CM point at the prime 1151. Quadratic Chabauty at 1151, with two correspondences that change only the level structure, then shows that each of these discs holds one rational point. The local term at 5 of these correspondences vanishes, by a formula of Betts and Dogra, because their eigenvalues lie in 5 Q\sqrt5\,\mathbb{Q}, and the height pairing is fixed by the nine CM points alone.

Primarily AI-generated textHuman understanding: no partsGalois images of elliptic curvesKummer descentNon-split Cartan modular curvesmodular unitsp-adic heightsquadratic Chabauty
Nov 18, 202625 pages
PDFView work

math.NT — Number Theory

Sharp growth and gap exponents for admissible sequences

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

An increasing sequence of positive integers is admissible if any two finite subsets with the same sum have the same cardinality. We solve the growth and consecutive-gap questions of Deshouillers and Erdős. The least possible exponent in an eventual polynomial bound on the nn-th term is 2+222+2\sqrt 2. The least possible consecutive-gap exponent is (5+17)/2(5+\sqrt{17})/2. Both endpoints are attained with little-oo bounds, and the endpoint gap bound holds with coefficient one at every index. We also determine the tradeoff when both bounds are imposed on the same sequence. The lower bounds use subset-sum counts, a restricted-sum progression theorem, and an elementary large-gap lemma. The upper bounds use an induction on congruences of signed subset sums.

Primarily AI-generated textHuman understanding: no partsErdős problemadmissible setsgeneralized arithmetic progressionssubset sums
Nov 18, 20268 pages
PDFView work

math.NT — Number Theory

GPF-Tribonacci sequences admit no uniform linear bound

Contributed by Ryuya Hora

A GPF-Tribonacci sequence is a sequence of primes in which every term is the greatest prime factor of the sum of the three preceding terms. Back and Caragiu asked whether there is a constant LL such that every term of every such sequence is at most LL times the largest of its three initial terms. We show that the answer is no. For every C>0C>0 we show that there are GPF-Tribonacci sequences, starting from three distinct and arbitrarily large primes, in which three consecutive terms are all larger than CC times the largest initial term. This happens after O(log⁡C)O(\log C) steps. In the proof we prescribe the quotient of the sum of three consecutive terms by the next term. These quotients follow the periodic pattern 1,3,51,3,5. Then we apply the theorem of Green, Tao and Ziegler on linear equations in primes. The conjecture of Back and Caragiu that every GPF-Tribonacci sequence is ultimately periodic remains open.

Primarily AI-generated textHuman understanding: some partsGPF sequenceTribonacci recurrencegreatest prime factorlinear equations in primes
Nov 18, 20269 pages
PDFView work

math.NT — Number Theory

An Averaged Iwasawa Approach to Mordell over Q

Contributed by Jit Wu Yap

We give a new proof of the Mordell conjecture over the rational numbers via the Chabuty-Kim method.

Author comments: The paper here was obtained by prompting GPT Astra 6 back in September. It was then sent to experts in the community for them to digest.

Primarily AI-generated textHuman understanding: some parts
Nov 18, 202626 pages
PDFView work

math.NT — Number Theory

The Tower Side of the DIC Audit: Semistable Towers, the Barrier κ≤13\kappa\le\frac13, and the Conductor--Discriminant Constant

Contributed by Zeng Chunping

For towers of curves XnX_n over a number field with a fixed bad-reduction set and gn→∞g_n\to\infty, we study the height--conductor ratio κn:=hF(Jac Xn)/log⁡cond(Jac Xn)\kappa_n:=h_F(\mathrm{Jac}\,X_n)/\log\mathrm{cond}(\mathrm{Jac}\,X_n) and the normalised quantity R=12κ−1−εar+O(f^−1)R=12\kappa-1-\varepsilon_{\mathrm{ar}}+O(\hat f^{-1}) of the companion preprint "The Height-Conductor Ratio on Curve Towers" (2610.00544v2). Three structural results are established. First, σn→1\sigma_n\to1 holds for every semistable tower satisfying the tower axioms, by the combinatorial bound rank L≤2g−3\mathrm{rank}\,L\le 2g-3 together with the Saito--Liu conductor--discriminant identity. Second, the barrier κ≤13\kappa\le\frac13 reduces to irreducible isogeny factors; the archimedean branch is closed by the unconditional Theorem 8.7 of 2610.00544v2, and the remaining input Rρ≤3R_\rho\le3 for general GL2\mathrm{GL}_2 and non-GL2\mathrm{GL}_2 towers is shown to be not derivable from the currently proved inputs, the obstruction being isolated in an explicit saturating model with R≡4R\equiv4, κ→512\kappa\to\frac{5}{12}. Third, the conductor--discriminant constant is not universal: inside the CM class it forms the continuum (q2+2q+3)/(q2−1)(q^2+2q+3)/(q^2-1), and the mixed-prime model upn+vqm=1u^{p^n}+v^{q^m}=1 contributes the new continuum [−2p−1,−2q−1][-\frac{2}{p-1},-\frac{2}{q-1}] with Λ(a)=0\Lambda^{(a)}=0 exactly. On the Fermat tower the normalisation f^n=(2n+1)log⁡p\hat f_n=(2n+1)\log p, the exact layer remainder unu_n, εar=−2w/(2n+1)+O(p−n/n)\varepsilon_{\mathrm{ar}}=-2w/(2n+1)+O(p^{-n}/n) and the closed form for RnR_n are derived by finite computation with a two-channel cross-check. The upper half of Problem 10.12 is closed inside the whole Kummer family; the single-curve interior realisation (I'b) and the general bound R≤3R\le3 (route II) remain open. The remaining Mumford-type danger class is then evaluated explicitly (rounds 78--88): the rank-three criterion and the alignment with arXiv:2406.19785 record five exact structures with three retractions; equality-case constructions are rigid; the finite-layer band is continuous with γ=4−32μ\gamma=4-\frac32\mu; the End0\mathrm{End}^0 MT-group classification leaves genus 4 as the sole survivor, realised by the explicit curve C7,tC_{7,t}; and all 58 degree-eight CM anchor fields of arXiv:2510.00093v2 are certified to have Galois group identifier 8T13, with 8T24 occurring zero times, closing the 8T24 path (Λ≡0\Lambda\equiv0) and the long-term search items. In the final rounds 89--100 the last-mile chain is run to its end: C7,tC_{7,t} is realised with explicit MT structure, CM companion and conductor formula, and the characteristic-two analysis strips the remaining finite layers 3,6,12,243,6,12,24, forcing tower exhaustion; a full literature-cut proof attempt of the characteristic is recorded and fails at an explicit sign barrier, leaving a conditional theorem with three propositions; the sign of γA\gamma_A is settled by a three-valued judgement (1274/12741274/1274 sample points positive), with δγ=48c/L=12δκ\delta_\gamma=48c/L=12\delta_\kappa; and the CM anchor double-point calibration reduces the surviving input of route (II) to the single sign ΔΦeff>0\Delta\Phi_{\mathrm{eff}}>0, with all 58 endpoints satisfying dΦ=n2d_\Phi=n^2. Route (II) remains open, conditioned on this single input. Nothing in this paper proves abcabc; Theorem A of the source texts is an external input and is not independently verified here.

A mix of human-written and AI-generated textHuman understanding: all partsBogomolov-Miyaoka-YauFaltings heightFermat towerabc conjecturearithmetic conductorcomplex multiplicationcurve towersheight-conductor ratioisogeny factorssemistable reduction
Nov 18, 2026183 pages
PDFView work

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

Cyclotomic Digit-Reversal Thresholds: Explicit Slopes, Effective Periods, and Uniform Families

Contributed by Oleksiy Babanskyy

For a base-BB digit polynomial PP, let Kt(B)K_t(B) be the first length at which the represented integer and its reversal are divisible by the full integer Φt(B)\Phi_t(B), although Φt(X)\Phi_t(X) does not divide P(X)P(X). We study this threshold through a lattice of evaluations and the capacities imposed by digit positions. For every fixed t≥3t\geq3, we determine explicit linear slopes and construct an eventual affine description on residue classes, with computable periods, cutoffs and compressed minimum witnesses. No total-unimodularity assumption is needed. For every prime p≥5p\geq5, exact formulas in stated base ranges give K3p(10)=17p−1K_{3p}(10)=17p-1 and K6p(10)=18p+1K_{6p}(10)=18p+1. Ordered capacities explain their different correction periods, two and four. A deductive scalar classification also describes the minimum algebraic values for 6p6p and the action of reversal on them. Period transfers show that excluding palindromes leaves the first thresholds unchanged for both families. The same framework treats independent coefficient bounds and collisions. Exact results for orders 105,210105,210 require finite certificates beyond total unimodularity. The general construction is effective; minimal periods and practical efficiency are not claimed.

Author comments: 51 pages. Exact-arithmetic companion 1.1.0, including certificates and reproducibility instructions: https://github.com/aconsciousfractal/FCIG-Cyclotomic-Digit-Reversal-Thresholds/tree/28b00ab1a5d4ba64956ab82dafb02fc35ac40797. No independent specialist review or formal verification is claimed. Previously deposited as aiXiv 2609.03287 v1; the mathematical content and sources are unchanged.

Primarily AI-generated textHuman understanding: no partsCyclotomic Polynomialsaffine monoidscongruence latticesdigit reversalquasi-polynomialszonotopes
Nov 18, 202651 pages
PDFView work

math.NT — Number Theory

Sun's supercongruence for two Apéry-like binomial sums at discriminant -20

Contributed by Oleksiy Babanskyy

Let an=∑j=0n(nj)2(2jj)a_n=\sum_{j=0}^n\binom{n}{j}^2\binom{2j}{j} and let Qn=∑j=0n(nj)(−8)n−j∑k=0j(jk)3Q_n=\sum_{j=0}^n\binom{n}{j}(-8)^{n-j}\sum_{k=0}^j\binom{j}{k}^3. We prove Sun's Conjecture 3.7: for every prime p≠2,5p\ne2,5, the two sums (−1)(p−1)/2∑n<p(2nn)an20−n(-1)^{(p-1)/2}\sum_{n<p}\binom{2n}{n} a_n20^{-n} and (−1)(p−1)/2∑n<p(2nn)Qn(−16)−n(-1)^{(p-1)/2}\sum_{n<p}\binom{2n}{n} Q_n(-16)^{-n} are congruent modulo p2p^2 to 4x2−2p4x^2-2p if p=x2+5y2p=x^2+5y^2, to 2x2−2p2x^2-2p if 2p=x2+5y22p=x^2+5y^2, and to zero if (−5/p)=−1(-5/p)=-1. For split primes, two modular periods at one complex multiplication point yield separate finite specializations of an integral Hecke polynomial. Its degree-pp endpoint and the sign in the nonprincipal class are treated explicitly. For inert primes, a degree-five endomorphism with square [−5][-5] forces a Hasse polynomial to vanish; a finite quadratic differential invariant then lifts each original sum from modulo pp to modulo p2p^2. Fixed algebraic certificates and their uniform specialization are included.

Author comments: 18 pages. Revised manuscript, package 0.1.1, unchanged from aiXiv 2610.00158 v2. Simplified notation and updated attribution to Mao following comments on the companion manuscripts. Companion code and reproduction instructions: https://github.com/aconsciousfractal/Sun-3-7-Supercongruence/tree/4c2e584d1f04d2aa3921e4398743eecc7431004c

Primarily AI-generated textHuman understanding: some partsApéry-like sequencesElliptic CurvesFranel numberscomplex multiplicationmodular formssupercongruences
Nov 18, 202618 pages
PDFView work

math.NT — Number Theory

Sun's supercongruence for two Apéry-like binomial sums

Contributed by Oleksiy Babanskyy

Let fn=∑j=0n(nj)3f_n=\sum_{j=0}^n\binom{n}{j}^3 and Qn=∑k=0n(nk)(−8)n−kfkQ_n=\sum_{k=0}^n\binom{n}{k}(-8)^{n-k}f_k. We prove that, for every odd prime pp, the two sums ∑n=0p−1(2nn)Qn/(−32)n\sum_{n=0}^{p-1}\binom{2n}{n} Q_n/(-32)^n and ∑n=0p−1(2nn)Qn/64n\sum_{n=0}^{p-1}\binom{2n}{n} Q_n/64^n are congruent modulo p2p^2 to 4x2−2p4x^2-2p when p=x2+2y2≡1,3(mod8)p=x^2+2y^2\equiv1,3\pmod{8}, and to zero when p≡5,7(mod8)p\equiv5,7\pmod{8}. For inert primes a finite quadratic differential invariant gives ordinary and singular lifting results, including a formula for the defect at a simple singularity. For split primes we certify the modular period by identities of weight eight, construct an integral Hecke polynomial with an explicit degree bound, and specialize a finite polynomial identity at two complex multiplication points. The coefficient at degree pp, both classes of complex multiplication matrices, and the primes 33 and 55 are treated explicitly.

Author comments: 18 pages. Revised manuscript, package 0.1.1, unchanged from aiXiv 2610.00157 v2. Incorporates Zhi-Hong Sun's comments on notation and credits Mao's stronger coefficient congruence. Companion code and reproduction instructions: https://github.com/aconsciousfractal/Sun-3-6-Supercongruence/tree/db95a4dc988e548bc9fa6cb10745e1b9c2cd5bdd

Primarily AI-generated textHuman understanding: some partsApéry-like sequencesFranel numberscomplex multiplicationmodular formssupercongruences
Nov 18, 202618 pages
PDFView work

math.NT — Number Theory

A computer-assisted bound Λ ≤ 0.107964910079 for the de Bruijn–Newman constant

Contributed by Dale James Raymond

In the Polymath normalisation, a computer-assisted comparison gives Λ≤4276930720779424736615780984913961408125713216879677197516800<0.107964910079.\Lambda\le\frac{427693072077942473661578098491}{3961408125713216879677197516800}<0.107964910079. The initial squared zero height is bounded by 9/169/16, using OpenAI's ordinary-zeta 7/87/8 nonvanishing theorem formalised in Lean at the identified source revision. Finite signed translated-probe functionals, matched physical source estimates, and continuous-domain kernel inequalities supply a piecewise comparison for that height. A newly implemented exact rational consumer checks every one of the 221 010221\,010 arcs, their outward rounding and joins, and the complete final de Bruijn contraction. The fifteen-stage finite replay includes a direct reconstruction of all 6767 source chords from their primitive payments, with explicit binding of the main terms and the complete derivative functionals. Separate consumers verify their continuous kernel certificates and the actual physical and arithmetic charges. The analytic argument includes the corrected 11/1211/12 Gaussian remainder, finite-head localisation, attainment of a positive-time highest contact, and repeated complex contacts. The accompanying packet contains the mathematical sources, certificate data, checker programs, exact source identities, and replay instructions. The initial theorem is used at cited-theorem trust with authenticated external Lean-build evidence; a fresh local Lean build and an end-to-end formalisation of the present comparison are not claimed.

Author comments: This submission corresponds to version 1.0, dated 29 October 2026, of the manuscript deposited at https://doi.org/10.5281/zenodo.23752103. Complete computational evidence, verification instructions and component-specific rights notices remain available in that deposit and its companion repository: https://github.com/Dale-Dug/de-bruijn-newman-0107965. Related separate works: Michel Planat and Dale James Raymond, Certified Collision Exclusion and an Unconditional Upper Bound Λ < 0.156821 for the de Bruijn–Newman Constant, https://arxiv.org/abs/2611.06245 (subsequent joint paper); the earlier 0.149396 bound, https://doi.org/10.5281/zenodo.23781981; and the conditional 0.116398 bound, https://doi.org/10.5281/zenodo.23272725. These are separate works, not additional results claimed by this manuscript.

Primarily AI-generated textHuman understanding: all parts
Nov 17, 202663 pages
PDFView work

math.NT — Number Theory

Hyperbolic Collision Invariants and Certified Odd-Even Tiers toward Markoff Unicity

Contributed by Elleard Felix Webster Heffern

A collision would consist of two different ordered Markoff triples with the same largest entry MM. We derive arithmetic conditions that every such collision must satisfy. A parametrization by hyperbolic functions factors a classical determinant identity and leads to two coupled quadratic equations. If MM is odd, these equations require a factorization M=FEM=FE with F,E>1F,E>1 and gcd⁡(F,E)=1\gcd(F,E)=1. Hand proofs and exact finite computations give increasingly strong bounds, ending with F4,E4≥300000M+200000F^4,E^4\ge300000M+200000. If MM is even, division of the collision quantities by four gives the same inequalities for a coprime factorization of M/2M/2. These bounds yield explicit sufficient conditions for a Markoff number to be unique. The finite computations cover a proved search domain and apply necessary congruence and continued-fraction conditions. Two different arguments reject the final odd candidate: one uses continued fractions, and the other bounds the integer solutions of two quadratic equations of Pell type. Separately written programs reproduce the computations. The constants measure the strength of collision inequalities; they are not ranges through which Markoff numbers were checked. We identify the classical ingredients and the quantitative additions. Factorizations with increasingly comparable factors remain unresolved, so the general unicity conjecture is not proved.

Author comments: 35 pages; one figure. Source matches the 30 September 2026 manuscript deposited as Zenodo v6 on 9 November 2026: https://zenodo.org/records/24091908 (matching TeX and exact finite certificates). The constants are collision-inequality coefficients, not verified ranges; general Markoff unicity remains open. Internal “refereed” filenames do not denote external peer review. Publication chronology: earlier manuscript dated 19 August 2026, first ResearchGate posting 20 August 2026: https://doi.org/10.13140/RG.2.2.25111.33442 ; current v6 mirror recorded 12 November 2026: https://www.researchgate.net/publication/412818702_Hyperbolic_Collision_Invariants_and_Certified_Odd-Even_Tiers_toward_Markoff_Unicity . Related project chronology (earlier computational announcements, not first postings of this paper): X, 21 October 2026: https://x.com/webystar/status/2112926487091282350 ; LinkedIn, 23 October 2026: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ . Computational supplements, 2 November 2026: https://zenodo.org/records/23874075 . Corrected trillion-value verification/Meridians v22, 12 November 2026: https://zenodo.org/records/24167894 ; published on Hexagon 13 November 2026: https://hexagonmath.org/2611.00410 . These related computations are distinct from this paper's certified collision tiers.

A mix of human-written and AI-generated textHuman understanding: all partsDiophantine equationsFrobenius conjectureMarkoff numbersMarkov uniqueness conjecturePell equationscollision inequalitiescontinued fractionsexact finite certificateshyperbolic parametrizationunitary divisors
Nov 17, 202635 pages
PDFView work

math.NT — Number Theory

On the Diophantine equation ab+bc+ca=Nab + bc + ca = N and Euler's idoneal numbers

Contributed by Xuebin Liang

In this paper, it is proved that every natural number since 18491849 can be represented as ab+bc+caab+bc+ca with three distinct positive integers aa, bb and cc. A positive integer NN is an Euler's idoneal number if and only if it cannot be written as ab+bc+caab+bc+ca for distinct positive integers aa, bb and cc. Consequently, the number 18481848 is the largest Euler's idoneal number, which was conjectured by Euler in 1778 and Gauss in the Disquisitiones Arithmeticae.

Primarily human-written textHuman understanding: all partsAlgebraic Number Theory
Nov 17, 202647 pages
PDFView work

math.NT — Number Theory

Wieferich co-occurrence along exponential sequences: a weighted tail estimate and its application to (⋆′)

Contributed by Zeng Chunping

Let r≥2r\ge2 be a fixed integer and write be=re−a′b_e=r^e-a' for a′≤Aa'\le A coprime to rr. A recent preprint (hexagon:2610.00630, Zeng) reduces the abc conjecture, within a lattice-theoretic framework, to a single remaining hypothesis (⋆′)(\star'). We show that on the k=2k=2 slice the density-zero requirement on the exceptional set attached to (⋆′)(\star') follows from one summability condition Kr,a′<∞K_{r,a'}<\infty, where Kr,a′=∑q∈Cr,a′sqlog⁡q (1/D3(q)+1/e0(q))K_{r,a'}=\sum_{q\in\mathcal{C}_{r,a'}}s_q\log q\,(1/D_3(q)+1/e_0(q)), Cr,a′\mathcal{C}_{r,a'} is a three-filter congruence set, D3(q)=ordq3(r)D_3(q)=\mathrm{ord}_{q^3}(r), and e0(q)e_0(q) is the least solution of q3∣re−a′q^3\mid r^e-a'. The main result is unconditional: splitting the governing weight Ξr\Xi_r by the block d=ordq(r)d=\mathrm{ord}_q(r), the mass constraint ∏q2∣rd−1\prod q^2\mid r^d-1 and Stieltjes partial summation give Ξr(2)=∑sq=22log⁡q/(dqq)<∞\Xi_r^{(2)}=\sum_{s_q=2}2\log q/(d_qq)<\infty for every base rr, with explicit bound O(1+log⁡log⁡r)O(1+\log\log r); no abc, no GRH, and no count or density of the Wieferich primes Wr\mathcal{W}_r. The exact threshold of the first-moment route is Φr(E)=o(E)\Phi_r(E)=o(E), equivalently Ar(t)=∑d≤tMd/d=o(t)A_r(t)=\sum_{d\le t}M_d/d=o(t); the deep-layer condition Ξr(3)<∞\Xi_r^{(3)}<\infty sits strictly between Murata's finiteness conjecture P6aP_{6a} and the deep reciprocal sum, and the barrier analysis (one claimed radical barrier withdrawn as a bookkeeping artifact and replaced by an exact identity) shows it cannot be reached by block/radical/partial-summation methods. A Katz double-zero hypothesis (D4) yields Ξr(3)<∞\Xi_r^{(3)}<\infty and P6aP_{6a} almost surely (Borel--Cantelli); in the Haar ensemble (D4) is free with constant 11, while the diagonal embedding ι(Z)\iota(\mathbb{Z}) has measure zero, so the missing input is precisely pointwise rigidity of ι(r)\iota(r), equivalently the single-variable statement m(q)→∞m(q)\to\infty for the least nontrivial Teichmüller representative m(q)m(q) modulo q3q^3. The bad-set hypothesis (H-j) is supported by computation to 10610^6 (five hits, zero growth), while the same data correct the twin-Wieferich null hypothesis to the Teichmüller rate (q−1)/q2(q-1)/q^2. We prove (H-j) is not a GRH statement, locate it strictly between Katz's 2015 equidistribution conjecture and Murata's 1991 conjectures, record ancillary unconditional results (∑plog⁡p/(dp(p−1))<∞\sum_p\log p/(d_p(p-1))<\infty via Erdős--Murty; the exact identity Cr=SW+Sord+LTE2C_r=S_W+S_{\mathrm{ord}}+LTE_2; strict one-way comparisons), and specify what any new tool must look like (S1--S7). We prove no conjecture: the exact threshold, Ξr(3)\Xi_r^{(3)}, P6aP_{6a}, P4P_4, P1P_1 and (H-j) remain open.

Primarily human-written textHuman understanding: all partsBorel-Cantelli lemmaFermat quotientHensel liftingKatz equidistribution conjectureStieltjes partial summationTeichmuller subgroupWieferich primesabc conjecturemultiplicative ordersuper-Wieferich primes
Nov 17, 202627 pages
PDFView work

math.NT — Number Theory

Consecutive primes at distances 123,662 and 125,318

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We exhibit consecutive-prime gaps of exactly 123 662123\,662 and 125 318125\,318, with endpoints of 8 4168\,416 and 6 4546\,454 decimal digits, respectively. Covering congruences certify most interior integers as composite. For the second gap, the remaining integers are certified by proper divisors or Fermat witnesses. Elliptic-curve certificates prove all four endpoints prime. We give the elementary arguments that turn these finite arithmetic checks into a proof. The proof is computer-assisted.

Author comments: 4 pages. The supplementary arithmetic appendix supplies the exact covering tables, additional compositeness witnesses, four endpoint primality chains, and elementary order certificates for the terminal primes.

Primarily AI-generated textHuman understanding: all parts
Nov 16, 20264 pages
PDFView work

math.AG — Algebraic Geometry

Essential dimension of geometric local systems

Contributed by Mark Kisin

Let f : X → B be a smooth projective family over a smooth complex variety, and let H = (Rmf∗Z)/tors. We prove that there is an integer N such that, whenever pn ≥N, the essential dimension at p of H/pn is at least the dimension of its period image. This proves the Brosnan–Fakhruddin conjecture for these local systems. The proof compares the geometric Sen operator with the Higgs field. Integral Hodge–Tate theory gives a bound uniform in large primes. For each remaining prime, a bounded rational comparison at one geometric point suffices when n is large.

A mix of human-written and AI-generated textHuman understanding: all partsEssential dimension
Nov 16, 202614 pages
PDFView work

math.NT — Number Theory

Smooth Numbers in Arithmetic Progressions with Uniformity in the Residue Class

Contributed by Sarvagya Jain

We improve the level of distribution of smooth numbers in arithmetic progressions to x5/8−ϵx^{5/8-\epsilon}, with uniformity in the residue class. In particular, for every ϵ,A>0\epsilon,A>0 and integer k≥1k\geq1, there exist δ,C>0\delta,C>0 such that $$ \sum_{\substack{q\leq x^{5/8-\epsilon}\\(q,a_1a_2)=1}}\tau_k(q)\sup_{0\leq z\leq x} \Biggl|\Psi(z,y;a_1\overline{a_2},q) -\frac{1}{\phi(q)}\Psi_q(z;y)\Biggr| \ll_{\epsilon,A,k}\frac{\Psi(x;y)}{(\log x)^A}, $$ uniformly for x≥2x\geq2, (log⁡x)C≤y≤x1/C(\log x)^C\leq y\leq x^{1/C}, and a1,a2∈Z∖{0}a_1,a_2\in\Z\setminus\{0\} satisfying $$ |a_1|\leq x^{1+\delta},\qquad |a_2|\leq x^\delta,\qquad (a_1,a_2)=1. $$ Here Ψ(z;y)\Psi(z;y) counts the yy-smooth integers up to zz, Ψq(z;y)\Psi_q(z;y) counts those coprime to qq, and Ψ(z,y;a,q)\Psi(z,y;a,q) counts those congruent to aa modulo qq; τk\tau_k is the kk-fold divisor function. The proof combines dispersion with second and fourth spectral moments.

Author comments: This work is an extension to author's work submitted to arxiv concerning an improvement to a prior work of Balog concerning writing positive integers as a sum of two smooth numbers.

Primarily AI-generated textHuman understanding: some parts
Nov 16, 202632 pages
PDFView work

math.NT — Number Theory

Three Properties of Markov–Hurwitz Equations

Contributed by Qiyue Tang

We prove Laurent positivity for Markov–Hurwitz mutations with independent exchange parameters, density-one uniqueness by the largest coordinate for positive integral solutions of the symmetric generalized equation, and labelled Vieta connectivity of the pure equation on points with at most one zero coordinate over sufficiently large prime fields.

Author comments: v2(2026/11/17):A theorem from version 1 is generalized. The ideas behind this work came primarily from the author and were developed through discussions with ChatGPT. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 16, 202645 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

math.NT — Number Theory

Consecutive primes at distance 122,290

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We exhibit two consecutive primes whose difference is exactly 122 290122\,290. Both primes have 8 2628\,262 decimal digits. Every integer strictly between them has a prime divisor at most 32 46732\,467. We give the covering argument and the elliptic-curve criterion that certify the result. The proof is computer-assisted and uses finite arithmetic checks to establish endpoint primality and the compositeness of every interior integer.

Author comments: 3 pages. The supplementary arithmetic appendix supplies the full covering table and both endpoint primality chains.

Primarily AI-generated textHuman understanding: all parts
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

A DETAILED FINITE-CARRY PROOF OF A CONJECTURE ON PERMUTATION BINOMIALS IN CHARACTERISTIC TWO

Contributed by yi li

Let q = 2m, where m ≥ 5 is odd and 3 | m. Tu, Zeng, Jiang and Li formulated a conjecture asserting that if a family of Hermite-type sums Sr,α(y), attached to the binomial xr(a+ x3(q−1)), vanishes for every α with 3 | (1 + α), then y3 = 1. We give a detailed proof, including all exceptional and boundary cases. In fact, seven indices suffice: α ∈ {2,8,14,20,26,32,38}. The first two indices reduce a hypothetical counterexample to a primitive seventh root of unity. Lucas’s theorem then turns the remaining equations into six-bit conditions, and an explicit finite carry elimination completes the proof. The paper records the complete residue tables, their derivation, and a short SageMath verification certificate.

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 16, 202611 pages
PDFView work

math.NT — Number Theory

Pair correlation of LL-zeros and Hooley's conjecture

Contributed by Travor Zihao Liu

In this article, we study the form factor for zeros of Dirichlet LL-functions, pairing zeros of the same LL-function and then averaging over primitive characters modulo a prime conductor. Unconditionally, we show for ∣α∣<1|\alpha|<1 that the form factor agrees with the random matrix prediction from the Circular Unitary Ensemble (CUE). Under GRH and the Hardy--Littlewood twin primes conjecture, we extend this agreement to ∣α∣<2|\alpha|<2. For ∣α∣≥1|\alpha|\ge1, we prove that the CUE prediction is equivalent to Hooley's conjecture for the variance of primes in arithmetic progressions with prime moduli. We also explore applications of these form-factor results to the simplicity of zeros.

Primarily human-written textHuman understanding: all parts
Nov 16, 202622 pages
PDFView work

math.NT — Number Theory

Geometric Equivalence of the Riemann Hypothesis

Contributed by FELIPE MARTINS SANTOS

We study the complex rational extensions of two sequences, called SeqImpar and SeqPar, and the way their geometric images relate to the nontrivial zeros of the Riemann zeta function. We prove that I(z) = 5 − 4/(z − 1) maps the critical line Re(z) = 1/2 to the circle |w − 9| = 4, and that, for w = I(ρ), rational inversion recovers exactly the coordinates Re(ρ) and γ = Im(ρ). We show that SeqPar induces a second rational curve and that its extension is injective in the half-plane Re(z) > 0. To distinguish points corresponding to zeta zeros from the other points on these curves, we use a Dirichlet series weighted by the convergence errors of the sequences and prove the correspondence between its poles and the nontrivial zeros. This yields a geometric criterion rigorously equivalent to the Riemann Hypothesis: all relevant poles of the transformed function must lie on the indicated circle. We present formulas for extracting ordinates using residues and contour integrals, together with numerical checks involving the first five known zeros. The results constitute an exact reformulation of the hypothesis, not a proof of its truth or an independent algorithm for computing new zeros.

Author comments: A parallel construction holds for SeqPar’s curve CP . These characterizations do not prove RH; they make the geometric equivalence explicit and locate the remaining difficulty in independently determining the poles of the transform. https://doi.org/10.5281/zenodo.24247902

A mix of human-written and AI-generated textHuman understanding: all partsRiemann Hypothesis
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

Vieta invariants and Markoff–Hurwitz orbits

Contributed by Qiyue Tang

We classify rational Vieta invariants for Guéritaud's family in characteristic zero, including every nonzero fiber. For each positive integer coefficient and each dimension residue class, we construct infinitely many Markoff–Hurwitz equations with infinitely many maxima shared by at least any prescribed number of distinct positive integer orbits.

Author comments: The ideas in this article originated in the author’s own work and in discussions with ChatGPT. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 15, 20266 pages
PDFView work

math.NT — Number Theory

The reciprocal cube sums of Lucas sequences of quadratic units are irrational

Contributed by Shawn Krisman

Let η>1\eta>1 be a unit of a real quadratic order and Un=(ηn−ηˉn)/(η−ηˉ)U_n=(\eta^n-\bar\eta^n)/(\eta-\bar\eta) its Lucas sequence. We prove that ∑n≥1Un−3\sum_{n\ge1}U_n^{-3} is irrational. Equivalently, ∑n≥1Un(P,Q)−3∉Q\sum_{n\ge1}U_n(P,Q)^{-3}\notin\mathbb{Q} for the Lucas sequences with Q=−1Q=-1, P≥1P\ge1, and with Q=1Q=1, P≥3P\ge3. In particular the sums of the reciprocal cubes of the Pell numbers and of the numbers FknF_{kn}, for every k≥1k\ge1, are irrational. The case of the Fibonacci numbers was treated in earlier work of the author; the proof here is the same Hankel-determinant construction, carried out for a general unit and for both signs of its norm. The constants of the argument do not depend on η\eta once they are measured in units of log⁡η\log\eta. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsFibonacci numbersHankel determinantsLeanLucas sequencesPell numbersirrationalityq-series
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

Density-One Uniqueness for Markoff–Hurwitz Solutions

Contributed by Qiyue Tang

For each fixed integer n≥4n\ge4, we prove that almost every positive integer solution of ∑i=1nxi2=n∏i=1nxi\sum_{i=1}^n x_i^2=n\prod_{i=1}^n x_i is determined up to permutation by its largest coordinate. The density is taken over sorted solutions with largest coordinate at most RR, as R→∞R\to\infty.

Author comments: The author initiated this project to extend the density-one uniqueness results in William Y. Chen’s *Almost all Markoff numbers are unique* and the author’s earlier *Almost all \(k\)-Markov numbers are unique* to the standard Markoff–Hurwitz equation in \(n\ge 4\) variables. Both preprints appeared on Hexagon. [Chen, 2610.00281v2](https://hexagonmath.org/2610.00281v2) · [Tang, 2611.00216v1](https://hexagonmath.org/2611.00216v1) I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 15, 202620 pages
PDFView work

math.RT — Representation Theory

Unramified multiplicity one spherical pairs

Contributed by Rui Chen

Let pp be an odd prime and let kk be a finite extension of Qp\mathbb{Q}_{p}. We study the distinction between multiplicity one for unramified representations and multiplicity one for irreducible unitary representations. We prove that (G2, SL3) has the former property but not the latter. The unramified multiplicity one assertion uses spherical functions and the spherical Hecke module. For the failure of multiplicity one property, we use Weil representations and theta lifting to obtain an irreducible unitarizable representation with at least two independent SL3(k)-invariant linear forms.

A mix of human-written and AI-generated textHuman understanding: some partsGelfand pairsmultiplicity one property
Nov 15, 202618 pages
PDFView work

math.NT — Number Theory

Bounds for the smallest limit point of the areal Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Pritsker's areal analog ∥P∥0\|P\|_0 of the Mahler measure replaces the integral of log⁡∣P∣\log|P| over the unit circle by its integral over the unit disc with respect to normalized area. For an algebraic number α\alpha of degree nn with minimal polynomial P∈Z[x]P\in\mathbb{Z}[x], taken primitive with positive leading coefficient, let N0(α)=∥P∥01/nN_0(\alpha)=\|P\|_0^{1/n}. Flammang proved that N0(α)≥1.380047N_0(\alpha)\ge1.380047 for every totally positive algebraic integer α\alpha outside an explicit finite set. We prove that the smallest limit point of the values of N0N_0 on totally positive algebraic integers and their essential minimum lie between 1.38301341.3830134 and 1.38395791.3839579. The lower bound improves on Flammang's constant: it holds for all but finitely many totally positive algebraic numbers, not only integers, although the exceptions are not determined. Infinitely many totally positive algebraic integers satisfy N0(α)<1.3839579N_0(\alpha)<1.3839579. The lower bound comes from an auxiliary function with a logarithmic energy term, and the upper bound from an explicit measure that, by a criterion and a theorem of Smith, is a limit of distributions of conjugates of totally positive algebraic integers. The inequalities behind both bounds are verified in ball arithmetic, and both bounds are also proved in Lean, the upper one assuming Smith's theorem.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715993

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

An upper bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the values of the absolute Mahler measure Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} on totally positive algebraic integers α\alpha. Smyth's work gives ℓ+≤ℓ2=1.72731…\ell_+\le\ell^2=1.72731\ldots, where ℓ=1.31427…\ell=1.31427\ldots is the limit point that he found for totally real algebraic integers. We prove ℓ+≤1.7239501\ell_+\le1.7239501, and that infinitely many totally positive algebraic integers satisfy Ω(α)<1.7239501\Omega(\alpha)<1.7239501. Together with the lower bound ℓ+>1.7234615\ell_+>1.7234615 of a companion paper, this places ℓ+\ell_+ in an interval of length less than 4.9⋅10−44.9\cdot10^{-4}. The proof exhibits a measure μ\mu on [0,9][0,9] with a piecewise linear density on 3,4813{,}481 rational nodes. Its logarithmic potential is bounded below by a combination of log⁡∣Q∣\log|Q| for 2121 irreducible polynomials QQ, namely xx and polynomials taken from Flammang's work. By a criterion of Smith, μ\mu, normalized to mass 11, is a limit of distributions of conjugates of totally positive algebraic integers, and its integral of log⁡+x\log^{+} x gives the bound. Two separately written programs verify the conditions in ball arithmetic. Both results are also proved in the Lean proof assistant, assuming Smith's theorem and a lower bound for the potential of the arcsine measure, with the checks of the certificate run either as compiled code or by Lean's kernel.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23544556

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 20269 pages
PDFView work

math.NT — Number Theory

A lower bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the absolute Mahler measures Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} of totally positive algebraic integers α\alpha. By work of Smyth, ℓ+≤1.7274\ell_+\le1.7274, and the best lower bound was Flammang's ℓ+≥1.722069\ell_+\ge1.722069. We prove that all but finitely many totally positive algebraic numbers α\alpha satisfy Ω(α)>1.7234615\Omega(\alpha)>1.7234615, and that ℓ+>1.7234615\ell_+>1.7234615. We also prove that all but finitely many totally real algebraic numbers β\beta have absolute logarithmic Weil height log⁡Ω(β)>0.2721673\log\Omega(\beta)>0.2721673. The proof adds to Smyth's method of auxiliary functions the logarithmic energy term that Orloski, Talebizadeh Sardari and Smith derived from the integrality of discriminants for the Schur–Siegel–Smyth trace problem. The resulting inequality is verified rigorously by computer, and the lower bounds are also proved in the Lean proof assistant.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715956

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202612 pages
PDFView work

math.NT — Number Theory

A lower bound for the essential minimum of the Zhang–Zagier height

Contributed by Tejasvi Singh Tomar

For an algebraic number α\alpha let h(α)h(\alpha) be its absolute logarithmic Weil height, and let hZ(α)=h(α)+h(1−α)h_Z(\alpha)=h(\alpha)+h(1-\alpha). The essential minimum of hZh_Z is the supremum of the numbers HH for which only finitely many algebraic numbers satisfy hZ(α)≤Hh_Z(\alpha)\le H. Zagier showed that it is at least 12log⁡1+52=0.2406059…\frac12\log\frac{1+\sqrt5}{2}=0.2406059\ldots, and the best lower bound so far is 0.248740.24874, due to Flammang. We prove that the essential minimum is at least 0.249829330.24982933. The proof combines Smyth's method of auxiliary functions, here with five integer polynomials in z(1−z)z(1-z), with a logarithmic energy term relative to a measure on the circles ∣z∣=1|z|=1 and ∣1−z∣=1|1-z|=1. Resultants and discriminants of minimal polynomials are nonzero integers. They bound the polynomial terms and the energy term, and a condition on the degrees absorbs the leading coefficients, so the argument applies to all algebraic numbers. A superharmonicity argument reduces the positivity of the auxiliary function to the unit circle, where two separately written programs verify it in ball arithmetic for a certificate with exact rational data. We also prove this lower bound in Lean.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23552587

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202611 pages
PDFView work

math.NT — Number Theory

The sum of the reciprocal cubes of the Fibonacci numbers is irrational

Contributed by Shawn Krisman

We prove that ζF(3)=∑n≥1Fn−3\zeta_F(3)=\sum_{n\ge1}F_n^{-3} is irrational, where FnF_n are the Fibonacci numbers. To our knowledge the only odd value of the Fibonacci zeta function previously known to be irrational was ζF(1)\zeta_F(1). The proof is a Hankel-determinant construction over Z[φ]\mathbb{Z}[\varphi], φ=(1+5)/2\varphi=(1+\sqrt5)/2, adapted from a recent unrefereed construction for the qq-zeta value ∑n2/(pn−1)\sum n^2/(p^n-1) at integers p≥2p\ge2. Four estimates are combined: a real decay of size exp⁡(−29K3log⁡φ)\exp(-\tfrac29K^3\log\varphi), a smallness exp⁡(−K3log⁡φ)\exp(-K^3\log\varphi) at the Galois conjugate, which replaces the base-prime content gain of the integer case, local cyclotomic denominator bounds at the twisted roots of unity that occur, and nonvanishing by rational interpolation. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsCyclotomic PolynomialsFibonacci zeta functionHankel determinantsLambert seriesLean 4Padé approximationformal verificationirrationalityq-zeta valuesreciprocal Fibonacci sums
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

New lower bounds for Romanoff's constant

Contributed by Tejasvi Singh Tomar

Romanoff proved in 1934 that the integers of the form p+2ap+2^a, with pp prime and a≥1a\ge1, have positive lower density dd. We prove that d≥0.110825d\ge0.110825 and, conditionally on an upper bound for prime pairs that Johnston and Trudgian derive from Lichtman's work on primes in arithmetic progressions, that d≥0.119178d\ge0.119178; the best lower bound so far was 0.107880.10788. The proof refines the method of Elsholtz and Schlage-Puchta, which bounds the second moment of the number of representations in each residue class modulo a fixed integer. Both bounds are certified by computer and also proved in the Lean proof assistant, with the analytic inputs as hypotheses.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715954

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

Upper and lower bounds for the Schur–Siegel–Smyth trace problem

Contributed by Tejasvi Singh Tomar

The Schur–Siegel–Smyth trace constant C86C_{86} is the lower limit of tr⁡(α)/deg⁡(α)\operatorname{tr}(\alpha)/\deg(\alpha) over totally positive algebraic integers α\alpha. We prove 1.8022225<C86<1.80708091.8022225<C_{86}<1.8070809. For the upper bound we exhibit a measure on [0,6][0,6] that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of 2121 integer polynomials. This improves the upper bounds 1.82161.8216 of Orloski and Talebizadeh Sardari and 1.81172511.8117251 of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree 1010 found by McKee and Smyth. It is larger than the bound 1.802201.80220 reported by Giraudin, whose verification evaluates its bounds in floating-point arithmetic with fixed safety margins; ours encloses every rounding error. For each bound, two separately written programs check the certificate in ball arithmetic. Both bounds are also proved in Lean 4, the upper bound under the assumption of Smith's theorem, also in a version in which all checks on the certificates are carried out by Lean's kernel. We also give evidence that certificates of this kind cannot lower the upper bound much further without integer polynomials of high degree.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23563968

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202615 pages
PDFView work

math.CO — Combinatorics

Certified upper bounds for two sum-difference exponents

Contributed by Tejasvi Singh Tomar

For finite sets A,BA,B of real numbers and G⊆A×BG\subseteq A\times B, Katz and Tao proved in 1999 that {a−b:(a,b)∈G}\{a-b:(a,b)\in G\} has at most N11/6N^{11/6} elements whenever AA, BB and {a+b:(a,b)∈G}\{a+b:(a,b)\in G\} have at most NN elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent 11/611/6 to 1.82731.8273, and to 1.82951.8295 in every abelian group. We also prove ∣X−Y∣≤∣X+Y∣1.4209|X-Y|\le|X+Y|^{1.4209} for all finite sets X,YX,Y of integers, improving the exponent 1.45431.4543 of Kleinwaks; through his transfer theorem, this lowers the upper bound for the sum-difference constant of Gyarmati, Hennecart and Ruzsa from 1.31241.3124 to 1.29621.2962. Both proofs add up entropy inequalities among integer combinations of coordinates of several copies of a random pair, with rational weights found by linear programming; all four bounds are also proved in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716680

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202616 pages
PDFView work

math.NT — Number Theory

Integer-power separation does not force rational-dilation separation

Contributed by Sunay Venkat

We construct an algebraically independent set with divergent reciprocal-logarithmic weight, arbitrary prescribed proximity to selected integers and growing integer-power separation on tails. Nevertheless, every tail contains arbitrarily close rational-dilation pairs for each member of a dense family. The necessary integer-power finite-state lemmas and their proofs are included. This supplies a contrasting construction to the bounded-denominator rational-power example in the companion paper.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independenceinteger-power separationrational dilations
Nov 15, 20267 pages
PDFView work

math.NT — Number Theory

Algebraically independent counterexamples with rational-power separation

Contributed by Sunay Venkat

Starting from Apicella’s private-prime construction, we give a proof draft of divergent reciprocal-logarithmic-weight examples that are algebraically independent, admit any prescribed positive integer-anchor error and have growing mixed-power gaps for rational dilations with bounded denominators. The integer numerator remains unrestricted. We record transcendence and field consequences and retain an elementary reconstruction of Apicella’s rational example in an appendix, with its prior-work attribution explicit.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independencemultiplicative combinatorics
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

A Central-Commutator Regge Seed: BCC Sublattices, Face-Matched Hinges, and Quaternionic Spectral Gaps

Contributed by Changxia Lin

(i) At the arithmetic parameter \delta = 1/3, the three short face diagonals of the negative-cycle ternary Gram form become mutually orthogonal and generate a simple-cubic sublattice of index two; the full lattice is body-centered cubic. (ii) The positive- and negative-cycle Gram tetrahedra admit matching hinge faces. A four-tetrahedron Regge star consisting of one negative-cycle tetrahedron and three positive-cycle tetrahedra has an exactly computable positive deficit angle. (iii) A figure-eight graph with quaternionic cycle holonomies i and j has a nonzero spectral gap; its characteristic polynomial is computed exactly and its smallest eigenvalue is isolated by rational bounds. (iv) The commutator [i, j] = -1 identifies the graph's central Z_2 obstruction with the negative signed-cycle class of the Gram construction. The statements are finite-dimensional results about lattices, piecewise-Euclidean complexes, and unitary graph connections. They do not construct a closed shell, a Lorentzian spacetime, or a solution of the Einstein-matter equations; they do not prove the dominant energy condition or dynamical stability. The term "negative-cycle" refers only to a sign invariant and has no implication of negative physical energy.

Primarily human-written textHuman understanding: all partsSigned Gram matrices
Nov 15, 20268 pages
PDFView work

math.NT — Number Theory

Realizer Bounds and Repetition Constraints at the First Coefficient Crossing in the 3x + 1 Problem

Contributed by Elias De Jesús

Terras’s coefficient stopping time conjecture asks whether the shortcut Collatz orbit of every integer n ≥ 2 lies below n when its coefficient ρk = 3d/2k first falls below one. Here k counts shortcut steps and d counts their odd inputs. We prove that every eligible realizer descends when the first-crossing word has at most 75 maximal runs of odd inputs. Any counterexample requires at least 76 such runs, 10 439 860 591 steps and 6 586 818 670 odd inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational approximations to log2 3, the verified range of Rozier and Terracol, and Rhin’s estimate for a linear form in logarithms. We also prove descent for a family with arbitrarily many odd runs. Two further restrictions narrow the remaining words. An initial square U U in a failing word satisfies |U | < 35 log2 k. For a counterexample of shortest crossing length, the reciprocal-sum estimate of Nikzad, Frinkle and Bagherzadeh gives a lower bound on ρk whose value begins 0.9441733669 . . .. The open inequality compares the least eligible starting value in each remaining parity class with an explicit threshold.

A mix of human-written and AI-generated textHuman understanding: some parts2-adic congruencesCollatz conjectureDiophantine approximationTerras conjecturecoefficient stopping timefirst coefficient crossingleast positive realizersodd-run decompositionparity vectorsreciprocal sums
Nov 15, 202612 pages
PDFView work

math.NT — Number Theory

SeqImpar and SeqPar: Analytic Characterizations of the Zeros of the Riemann Zeta and Dirichlet Beta Functions and a Criterion Equivalent to the Riemann Hypothesis

Contributed by FELIPE MARTINS SANTOS

We study two rational sequences, called SeqImpar and SeqPar, originally defined by recurrences and converging to the common limit 5. The ratio of their convergence errors tends to 1/2. Using this ratio, we construct two Dirichlet series weighted by the von Mangoldt function and associated with the Riemann zeta function and the Dirichlet beta function. We prove that these series admit meromorphic continuations whose poles in the critical strip correspond exactly to the zeros of the respective functions, with residues equal to minus one-half of their multiplicities. We then prove that an estimate for the partial sum weighted by SeqImpar and SeqPar is equivalent to the Riemann Hypothesis, and state a parallel criterion for the Dirichlet beta function. The paper rigorously distinguishes proved identities, equivalences, and open problems: the coincidence of the number 1/2 with the critical line does not, by itself, constitute a proof of the Riemann Hypothesis.

Author comments: DOI 10.5281/zenodo.24145199

A mix of human-written and AI-generated textHuman understanding: all partsRiemann Hypothesis
Nov 15, 20267 pages
PDFView work

math.NT — Number Theory

Colossally Abundant Numbers and Nicolas' Second Criterion

Contributed by Frank Vega

Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγnlog⁡log⁡n\sigma(n) < e^{\gamma} n \log\log n for every n>5040n > 5040. Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if n/φ(n)<eγlog⁡log⁡n+eγ(2+τ)/log⁡nn/\varphi(n) < e^{\gamma} \log\log n + e^{\gamma}(2 + \tau)/\sqrt{\log n} for every n≥N120569n \geq N_{120569}, where NkN_{k} is the kk-th primorial and τ=2+γ−log⁡(4π)\tau = 2 + \gamma - \log(4\pi); for NkN_{k} this inequality reads c(pk)<E(pk)c(p_{k}) < E(p_{k}). Let NN be a colossally abundant number, let q=pkq = p_{k} be the largest prime not exceeding the number ξ(N)\xi(N) associated with NN by Nicolas, and write Δ(N)=log⁡(σ(N)/N)−γ−log⁡log⁡log⁡N\Delta(N) = \log(\sigma(N)/N) - \gamma - \log\log\log N. For log⁡q≥31\log q \geq 31 we prove unconditionally that 1.317/(qlog⁡2q)≤Δ(N)−c(q)+E(q)+(22−2−τ)/(qlog⁡q)≤3.973/(qlog⁡2q)1.317/(\sqrt{q}\log^{2} q) \leq \Delta(N) - c(q) + E(q) + (2\sqrt{2} - 2 - \tau)/(\sqrt{q}\log q) \leq 3.973/(\sqrt{q}\log^{2} q). Consequently, the second inequality for NkN_{k} implies Δ(N)<−0.654/(qlog⁡q)\Delta(N) < -0.654/(\sqrt{q}\log q). We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every NkN_{k} with e31≤pk≤Xe^{31} \leq p_{k} \leq X, then Robin's inequality holds for every n>5040n > 5040 with log⁡n≤X(1−log⁡−3X)−log⁡X\log n \leq X(1 - \log^{-3} X) - \log X. A computation over the primes up to X=100,000,008,765,439X = 100{,}000{,}008{,}765{,}439 verifies this hypothesis, so Robin's inequality holds unconditionally for 5040<n≤101013.63775040 < n \leq 10^{10^{13.6377}}. To the author's knowledge, this is the largest range for which Robin's inequality has been verified: it extends the range 5040<n≤101013.114855040 < n \leq 10^{10^{13.11485}} of Morrill and Platt.

Primarily AI-generated textHuman understanding: all partsChebyshev functionColossally abundant numbersNicolas' inequalityNicolas' second criterionRiemann HypothesisRobin's inequalitySuperabundant numbersprimorial
Nov 15, 202623 pages
PDFView work

math.CO — Combinatorics

Constructions and explicit power savings for point--unit-circle incidences

Contributed by Yuda Chen, Yifei Wang

Let U(n,m)\mathcal U(n,m) be the maximum number of incidences between nn distinct points and mm distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min⁡(n,m)s=\min(n,m) and M=max⁡(n,m)M=\max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.0411699201.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.04317223055397011.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ\mathcal U(n,m)\ll M+s^{2/3-2\delta}M^{2/3+\delta}, where δ=2−2664/514560000000>2−2665\delta=2^{-2^{664}}/514560000000>2^{-2^{665}}. The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.

Primarily AI-generated textHuman understanding: some partsPoint--unit-circle incidencesarithmetic heightsclass field towersincidence boundsnumber-field latticespolynomial partitioningunit distances
Nov 15, 2026178 pages
PDFView work

math.PR — Probability

Sharp Poisson approximation and second-order correction for long multiplicative runs

Contributed by Brice Pouly

Let ff be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least LL in [N,2N)[N,2N), with L=log⁡2N+O(1)L=\log_2N+O(1) and both signs included. The total variation distance to the Poisson law with nominal or exact mean has an explicit equivalent of order LN−2/3LN^{-2/3}, with a coefficient depending on N2−LN2^{-L} and L mod 3L\bmod3. After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power 4/34/3: for every fixed ε>0\varepsilon>0, its ℓ1\ell^1 error lies between constant multiples of N−4/3−εN^{-4/3-\varepsilon} and N−4/3+εN^{-4/3+\varepsilon}, uniformly in each fixed critical band. The leading correction comes from rational pairs. Keeping all channels up to a fixed height hh gives an explicit distance equivalent with power h/(h+1)h/(h+1), determined by the first omitted height. The third factorial cumulant has optimal power 41/3041/30. The proof expands around the exact Bernoulli marginals and stops at the first excluded dependent configuration. Arithmetic bounds for fixed configurations and a separate uniform tail estimate control the resulting positive boundary mass. Short square relations and a common algebraic curve bound the triple interactions; a fourth Charlier test detects the two-pair contribution that makes the quadratic exponent optimal.

Author comments: Initial Hexagon deposit of the published Zenodo edition (https://doi.org/10.5281/zenodo.24220727), including its technical companion in the same PDF. Lean formalization and reproducibility archive: https://doi.org/10.5281/zenodo.24220800. Mathematical source text is preserved; source packaging and navigation are adapted.

Primarily AI-generated textHuman understanding: no partsLean formalizationPoisson approximationPoisson–Charlier approximationarithmetic dependenciesfactorial cumulantslong runsrandom multiplicative functionstotal variation
Nov 15, 2026118 pages
PDFView work

math.NT — Number Theory

Automorphisms of the modular curves XΔ(N)X_\Delta(N)

Contributed by Filip Najman

We show that every automorphism of a modular curve XΔ(N)X_\Delta(N) of genus at least 22, where Γ1(N)⊆ΓΔ(N)⊆Γ0(N)\Gamma_1(N)\subseteq \Gamma_\Delta(N)\subseteq \Gamma_0(N), is induced by the normalizer of ΓΔ(N)\Gamma_\Delta(N) in PSL2(R)\mathrm{PSL}_2(\mathbb{R}), except for five curves, namely X0(37)X_0(37), X0(63)X_0(63), X0(108)X_0(108), a curve of level 3737 found by Jeon, Kim and Schweizer, and a curve of level 6363 whose non-modular automorphisms had, to our knowledge, not been noticed before. In particular every automorphism of X1(N)X_1(N) normalizes the group of diamond operators, as claimed for square-free NN in an unpublished preprint of Momose. The proof combines a twisted Hecke relation, which comes from the Galois action on the Tate module of the Jacobian, with a uniform bound for the dimension of the CM part of the Jacobian and with computations for finitely many levels.

Author comments: 30 pages. Code and logs: https://github.com/F-Najman/automorphisms_XDelta. Lean formalization: https://github.com/F-Najman/normalizer-lean

Primarily AI-generated textHuman understanding: some partsautomorphism groupsintermediate modular curvesmodular curves
Nov 15, 202630 pages
PDFView work

math.NT — Number Theory

Growth criteria for reciprocal series with nonincreasing weights

Contributed by twinheterodox

Fix nonincreasing positive integer weights w0,…,wd−1w_0,\ldots,w_{d-1} and define c>1c>1 by (c−1)2∑j=0d−1wjcj=w0(c-1)^2\sum_{j=0}^{d-1}w_jc^j=w_0. If the total weight is at least two, we prove irrationality of ∑n≥11/(anw0⋯an+d−1wd−1)\sum_{n\ge1}1/(a_n^{w_0}\cdots a_{n+d-1}^{w_{d-1}}) whenever the positive integers ana_n are strictly increasing and lim sup⁡n→∞(log⁡an)/cn=∞\limsup_{n\to\infty}(\log a_n)/c^n=\infty. For every nonconstant nonincreasing weight profile, this lowers the sufficient base in the general criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3), with the classical base-2 criterion included in the comparison. For weights (3,2,1)(3,2,1) the base becomes 43\sqrt[3]{4}; staircase weights (d,d−1,…,1)(d,d-1,\ldots,1) give (d+1)1/d(d+1)^{1/d}. Irregular growth is allowed. A more general form permits nondecreasing sequences and positive integer numerators under polynomial size bounds.

Author comments: 9 pages. Extends the two-weight result in Hexagon 2611.00428v1 to all fixed nonincreasing positive integer weight profiles. Includes a general numerator criterion and a comparison with finite-product substitutions. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth

Primarily AI-generated textHuman understanding: some partsgrowth criteriairrationalityreciprocal series
Nov 15, 20269 pages
PDFView work

math.NT — Number Theory

Subrings and cotypes of truncated polynomial rings

Contributed by Ramin Takloo-Bighash, Sarthak Chimni

We study unital finite-index subrings of Rn=Z[t]/(tn)R_n=\Z[t]/(t^n). We compute the cubic cotype function and the quartic total and cocyclic functions at every prime, including the exceptional factors at 22, and prove the corresponding global counting theorems in degrees three, four, and five. Explicit Hermite sums with determinantal weights give full cotype formulas for n=4,5n=4,5, without an asserted closed rational evaluation. We extend these calculations by a linear lifting recursion for every degree and by a two-parameter description of every cocyclic subring for n≥4n\ge4. The latter gives $2-2/(n-1)\le\alpha_n^{\cc}\le2$ for the global cocyclic convergence abscissa, and hence $\alpha_n^{\cc}\to2$. An exact quadratic family of quintic diagonal counts gives absolute convergence of the residual Dirichlet series for $\Rea s>19/13$. All asymptotics are obtained by elementary summation and absolutely convergent convolution.

A mix of human-written and AI-generated textHuman understanding: all partsIntegral ringsp-adic integration
Nov 15, 202636 pages
PDFView work

math.NT — Number Theory

Aigner's Three Monotonicities from Fibonacci Matrices and Six Snake Pieces

Contributed by Elleard Felix Webster Heffern

Starting from the established fact that Markov numbers count perfect matchings of their Markov snake graphs, we give a self-contained proof of the fixed-sum, fixed-numerator, and fixed-denominator orderings proposed by Aigner. The author's Fibonacci-matrix normalization begins with (AC)11−(B2)11=2(AC)_{11}-(B^2)_{11}=2 for consecutive odd-indexed Fibonacci blocks. Fibonacci matrices prove normalization and fixed-numerator monotonicity. The author's six-piece decomposition proves the remaining fixed-sum comparison and fixed-denominator monotonicity. We credit the matching correspondence to its original 2002–2003 REACH development and distinguish that history from the later ordering theorems.

Author comments: Standalone v4, 6 pages, 2 figures. The normalization and three ordering proofs also appear in Section 5 of Meridians; this standalone presentation makes them easier to find and cite. Earlier proofs of the orderings and the 2002–2003 matching correspondence retain their citations. The general Markov uniqueness conjecture remains open. Linked chronology: 8 November 2026: standalone v3: https://zenodo.org/records/24053747 11 November 2026: standalone v4, source, figures and finite-check reports: https://zenodo.org/records/24146546 12 November 2026: v4 PDF mirrored on ResearchGate: https://www.researchgate.net/publication/417809122_Aigner's_Three_Monotonicities_from_Fibonacci_Matrices_and_Six_Snake_Pieces 12 November 2026: corrected Meridians v22: https://zenodo.org/records/24167894 ; its Aigner arguments and figures are unchanged. The v4 source's version note records its original synchronization with v21. 13 November 2026: Meridians published on Hexagon: https://hexagonmath.org/2611.00410 Related computational supplements (2 November 2026): https://zenodo.org/records/23874075 ; current trillion-verification evidence accompanies the corrected Meridians archive above. Earlier project announcements, not announcements of this standalone proof: 21 October 2026, 15:18:25 UTC: X, earlier billion-scale verification: https://x.com/webystar/status/2112926487091282350 23 October 2026, 14:54:57.771 UTC: LinkedIn, earlier 9.3-billion verification: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ No separate social announcement for this paper has been independently verified.

A mix of human-written and AI-generated textHuman understanding: all partsAigner's conjecturesFibonacci matricesMarkoff numbersMarkov numberscombinatorial number theoryfixed-denominator monotonicityfixed-numerator monotonicityfixed-sum monotonicityperfect matchingssnake graphs
Nov 15, 20266 pages
PDFView work

math.NT — Number Theory

Irrationality of χ2(1/q)\chi_2(1/q), Ti2(1/q)\mathrm{Ti}_2(1/q) and χ2(2/q)\chi_2(2/q)

Contributed by Shawn Krisman

Let χ2(z)=∑n≥0z2n+1/(2n+1)2\chi_2(z)=\sum_{n\ge0}z^{2n+1}/(2n+1)^2 be Legendre's chi function and Ti2(z)=∑n≥0(−1)nz2n+1/(2n+1)2\mathrm{Ti}_2(z)=\sum_{n\ge0}(-1)^nz^{2n+1}/(2n+1)^2 the inverse tangent integral. We prove three theorems: χ2(1/q)\chi_2(1/q) is irrational for every integer q≥3q\ge3 with q≠4q\ne4; Ti2(1/q)\mathrm{Ti}_2(1/q) is irrational for every integer q≥5q\ge5; and χ2(2/q)\chi_2(2/q) is irrational for every odd integer q≥175q\ge175. All three come from one construction: the Hankel determinants of a moment functional with half-integer poles and geometric weight ww, read at w=q−2w=q^{-2}, w=−q−2w=-q^{-2} and w=4q−2w=4q^{-2}. Their denominators are bounded prime by prime, their size by a discrete log-gas argument against explicit dual certificates, and their nonvanishing by a reduction modulo an auxiliary prime. The three cases differ at the prime 22, where each needs its own lemma, in the certificates, and in how the nonvanishing lemma is transferred. For large qq the three statements follow from the linear independence criteria of David, Hirata-Kohno and Kawashima; for the first two, a 1990 theorem of Hata also applies, from q≥55q\ge55. Below these ranges the results are new as far as we know. All three theorems are formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.

Author comments: We were able to obtain a copy of Hata 1990 and updated the novelty of this result.

Primarily AI-generated textHuman understanding: no partsHankel determinantsLeanLegendre chi functionPadé approximationdilogarithmformal verificationinverse tangent integralirrationalitylogarithmic potential theory
Nov 13, 202646 pages
PDFView work

math.NT — Number Theory

Regularity criteria and an effective bound for irregular extensions of Euler triples

Contributed by Sinisa Slijepcevic, Andrej Dujella

An Euler triple is a Diophantine triple {a,b,c}\{a,b,c\} with a<b<c=a+b+2ab+1a<b<c=a+b+2\sqrt{ab+1}. It extends to the regular Diophantine quadruple {a,b,c,d+}\{a,b,c,d_+\}, and it is conjectured that it has no other extension d>cd>c. We prove that an irregular extension forces c<4⋅1048c<4\cdot10^{48}, against c<1098c<10^{98} in recent work of He and Togb\'e. The proof squeezes the index mm of the extension, which locates a common term of two Pell sequences, between a floor from congruences, c<8m4c<8m^4, valid for every irregular extension, and ceilings from linear forms in logarithms. The same squeeze, with other bounds, gives three regularity criteria: by the size of b/ab/a, which confines irregular extensions to 1+11538<b/a<335521+\frac1{1538}<b/a<3355^2; by pair coordinates, through the hypergeometric method; and by coprime divisors of the index combinations, which settles every Euler triple with two elements in a ratio j:kj:k with jk≤300jk\le300. As applications, the three-parameter family of Cipu, Fujita and Mignotte extends only regularly when νA≥2\nu A\ge2 and K≥643K\ge643, and when K=1K=1, A∈{2,3}A\in\{2,3\} and ν≥2\nu\ge2; the latter contains the Hoggatt--Bergum triples, for which this recovers Dujella's theorem for extensions d>cd>c.

A mix of human-written and AI-generated textHuman understanding: some partsDiophantine quadruplesEuler triples
Nov 13, 202672 pages
PDFView work