We prove Laurent positivity for pure Markov–Hurwitz mutations, density-one uniqueness by the largest coordinate for positive integral solutions of the symmetric generalized equation, and labelled Vieta connectivity for the pure equation on points with at most one zero coordinate over sufficiently large prime fields.
Author comments: The ideas behind this work came primarily from the author and were developed through discussions with ChatGPT.
Primarily AI-generated textHuman understanding: some parts
For each fixed integer n≥4, we prove that almost every positive integer solution of ∑i=1nxi2=n∏i=1nxi is determined up to permutation by its largest coordinate. The density is taken over sorted solutions with largest coordinate at most R, as R→∞.
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
Let N(t) be the number of pairs of integers (n,m) with (mn)=t. Singmaster conjectured that N(t)=O(1), and the best bounds in the literature are N(t)=O(logtlogloglogt/(loglogt)3) unconditionally, and N(t)=O((logt)2/3+ε) conditional on Cramér's conjecture. We show that N(t)=O((logt)1/2+o(1)) unconditionally. Solutions with m≥exp((logn)2/3+ε) are handled by a theorem of Matomäki, Radziwiłł, Shao, Tao and Teräväinen. For smaller m we show, using an interpolation determinant in the spirit of Bombieri and Pila, that the solutions with m in a short interval lie on a single algebraic curve of low degree in n, and we bound the number of solutions on such a curve by a zero estimate for exponential polynomials.
Primarily AI-generated textHuman understanding: some parts
For integers a>b>0, let P(a,b) be the number of steps the iteration x↦amodx takes to reach 0 from b; it is the length of the Pierce expansion of b/a. We prove P(a,b)≪εaβ∗+ε, where β∗=(41301−382849)/137480=0.2941336553…, improving the exponent 1/3−2/177 of Chase and Pandey. The tail of an orbit carries a sequence of positive integers, the Hankel determinants of a natural moment sequence, and these are small where the drops of the orbit are small. Grouping orbit states by such integers places the quotient differences of each group on curves of bounded degree, whose integer points we count with the uniform bounds of Castryck, Cluckers, Dittmann and Nguyen. The resulting exponent approaches 5/17 when these curves have large degree relative to the logarithmic size of the box. We raise the degree by adjoining further integer invariants, by an effective Hilbert irreducibility sieve, and by an exact identity for the direction of the curvature vector, and come within 1.61⋅10−5 of 5/17. We also give an elementary proof of the exponent 3/10+ε and a bound for orbits whose quotient increments rarely rise. All results are formalised in Lean 4 with Mathlib. Shallit's conjectured O((loga)2) bound remains open.
Primarily AI-generated textHuman understanding: some partsHankel determinantsHilbert irreducibilityLean formalizationPierce expansionsinteger points on curvesiterated remainders
Written numerically, the date October 24, 2026 corresponds to a Pythagorean triple---the last one of the twenty-first century! The associated 10--24--26 right triangle has area twice its perimeter; a classical factorization shows that exactly three integer-sided right triangles have this property and, more generally, counts those with any prescribed integer inradius. We also observe that 60 is the smallest perimeter shared by two noncongruent integer-sided right triangles, one of which is the 10--24--26 triangle.
A mix of human-written and AI-generated textHuman understanding: all partsPythagorean datesPythagorean triplesequable trianglesrecreational mathematics
We determine when rare observations of completely multiplicative functions have a Poisson law and when arithmetic relations force clusters. For independent prime values on the circle with uniformly bounded L2 densities, we approximate the field of hits of site-dependent targets of Haar mass O(N−1) on deterministic masks in [2,CN]. The target retains the true prime-site intensities and uses Haar at composite sites, even when the total prime contribution diverges. The exponent 2 is sharp in the uniform Lq scale for this target and class of masks. Below this threshold, even correct prime intensities can fail at site resolution while the total count remains asymptotically Poisson. A fixed finite exceptional prime environment, possibly atomic and internally dependent, instead produces a conditional cluster law together with an exact environment-determined configuration. With Haar outside that environment, its integer relation lattice determines the compound-Poisson limit of the corrected prefix count and characterizes simple Poisson convergence. Further applications treat rational observations on sparse moving supports, permanent bounded prime biases, and - using a binary arithmetic relation profile - long Borel patterns in a finite abelian group times a torus. Classical marked Chen-Stein comparison provides a common interface. A separate deterministic-sequence interface gives correlation identities, transfer criteria and a resolution obstruction, without proving cancellation for Liouville.
Let f be a random completely multiplicative function with independent symmetric signs at the primes. We study rare constant runs and prescribed words at logarithmic lengths, despite long-range multiplicative identities. A uniform weighted two-window square-relation estimate, with critical bound Oε(N5/3+ε), separates exact rational relations from residual components.
At critical intensity, this estimate gives Poisson comparisons retaining positions, exact excess lengths and signs. For dictionaries, uniform bounds under size and overlap conditions are complemented by typical bounds obtained by averaging the distance after fixing the dictionary. In a quantitatively controlled regime of diverging intensity, an exact one-word coupling by largest-odd-prime pivots compares the full signed run field under prescribed small-prime conditioning. For fixed admissible window parameters and almost every fixed realization of f, run-start counts in prescribed near-macroscopic windows satisfy an empirical Poisson law along dyadic scales.
In the exceptionally rare regime, a relative marked comparison separates the boundary event from bulk occurrences. Conditional on existence, the first location, sign and overshoot have a two-source lattice law with scale-dependent weights. The two overshoots use different clocks: prime rank at the boundary and integer distance in the bulk.
We determine the primitive integer solutions of x^4 + 3y^3 + 2z^3 = 0. They are exactly (1,-1,1) and (-1,-1,1), where primitivity means gcd(x,y,z)=1. A fourth-power descent in Q(∛12) produces four plane quartics. A congruence modulo 4 excludes two of them for primitive input. We determine the rational points on the other two by elliptic descent, finite reduction sieves, and elliptic Chabauty. For the final quartic, an explicit nonzero Cassels–Tate pairing sharpens a rank-three descent bound to rank one. All finite certificates and their verification programs accompany the proof.
Primarily AI-generated textHuman understanding: no parts
We determine all primitive integer solutions of the generalized Fermat equation
x^4 + 4y^3 + z^3 = 0.
Here primitive means gcd(x,y,z)=1. We prove that the only primitive solutions are
(x,y,z) = (1,0,-1), (-1,0,-1).
The proof begins with a fourth-power descent in the pure cubic field Q(∛2), reducing the problem to the rational points on two explicit smooth plane quartics of genus 3. These quartics admit maps to elliptic curves over Q(∛2). Exact 2-descent determines the relevant Mordell-Weil ranks and finite-index subgroups. A complete reduction sieve at 127 leaves four residue disks, and an elliptic Chabauty calculation proves that each disk contains exactly one rational point. Reconstruction of the original variables then leaves precisely the two stated primitive solutions. The finite computations are exact and reproducible from the certificates and verifier source included in the appendices, and the argument applies at all heights.
Primarily AI-generated textHuman understanding: no parts