Hexagon is a repository for the preservation, dissemination, study, and evaluation of research-level works in the mathematical sciences and theoretical computer science, including both original and expository texts. Hexagon does not perform peer review. Every deposit is screened automatically and, during the beta, also reviewed by a human moderator before it appears; acceptance is not a judgment of correctness, quality, or novelty.

Browse by subject

Newest works

To replace this with a different default view, perform an advanced search for the parameters you want, then select “Set this search as my default view.”

math.FA — Functional Analysis

The Matsaev (1971) conjecture is false for every p ≠ 2, and other miscellanea

Contributed by Dave Goel

The Matsaev (1971) conjecture asserts that for 1 < p < ∞, every contraction T on an Lᵖ space and every polynomial P satisfy ‖P(T)‖ ≤ ‖P(S)‖, where S is the shift on ℓᵖ(ℕ). We prove that it fails for every p ∈ (1, ∞) ∖ {2}, already for a real 2×2 matrix and a real quadratic, without numerical computation, and that it holds for every quadratic whose constant and leading coefficients have equal modulus; these results and their proofs also form the short paper "The Matsaev (1971) conjecture is false for every p ≠ 2". This expanded version adds an explicit quadratic and an explicit family of scaled rotations that violate the conjecture on a whole punctured neighbourhood of p = 2, with a proof by hand; an exact rational re-proof of Drury's counterexample at p = 4; upper bounds, certified in exact rational arithmetic, for the shift norms of Drury's polynomial at p = 3, 4, 6, …, 20; explicit counterexamples, certified by computer, for every p ∈ [40/39, 40], p ≠ 2; and conditions that every 2×2 counterexample must satisfy.

Author comments: First version: October 28, 2026. This is the expanded version of the paper "The Matsaev (1971) conjecture is false for every p ≠ 2", which is at https://hexagonmath.org/2611.00547 on Hexagon. The ancillary files are at https://doi.org/10.5281/zenodo.24290033 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsBellman functionL^p spacesMatsaev's conjecturecontractionsshift operatorvon Neumann's inequality
Nov 17, 202637 pages
PDFView work

math.FA — Functional Analysis

The Matsaev (1971) conjecture is false for every p ≠ 2

Contributed by Dave Goel

The Matsaev (1971) conjecture asserts that for 1 < p < ∞, every contraction T on an Lᵖ space and every polynomial P satisfy ‖P(T)‖ ≤ ‖P(S)‖, where S is the right shift on ℓᵖ(ℕ); for p = 2 this is von Neumann's inequality. Drury (2011) disproved it for p = 4, and hence, by duality, for p = 4/3, with a computer-assisted example. We prove that it fails for every p ∈ (1, ∞) ∖ {2}, even with T a real 2×2 matrix and P a real quadratic polynomial. Let Pₐ(z) = 1 + az − Bz² with B > 0. For p ≠ 2 and small a > 0 we show that ‖Pₐ(S)‖ = ‖Pₐ(J)‖, where J is the rotation of ℓᵖ₂ (ℂ² with the ℓᵖ norm) by a right angle. For p > 2 the bound ‖Pₐ(S)‖ ≤ ‖Pₐ(J)‖ comes from a Bellman function: a function G of two real variables such that, for every real sequence x ∈ ℓᵖ(ℕ) (with x₋₁ = x₋₂ = 0) and every n ≥ 0, |(Pₐ(S)x)ₙ|ᵖ ≤ ‖Pₐ(J)‖ᵖ|xₙ|ᵖ + G(xₙ₋₁, xₙ₋₂) − G(xₙ, xₙ₋₁); the G terms cancel in the sum over n. For 1 < p < 2 the bound follows by duality. If B > 1, a rotation by an angle slightly larger than π/2, scaled down to a contraction, gives a real 2×2 matrix T with ‖Pₐ(T)‖ > ‖Pₐ(J)‖ = ‖Pₐ(S)‖. In the other direction, the conjecture holds for every quadratic whose constant and leading coefficients have equal modulus. An expanded version of this paper, with many other results, is posted on Zenodo: https://doi.org/10.5281/zenodo.23691816.

Author comments: First version: October 28, 2026. The expanded version of this paper is at https://doi.org/10.5281/zenodo.23691816 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsBellman functionL^p spacesMatsaev's conjecturecontractionsshift operatorvon Neumann's inequality
Nov 17, 202613 pages
PDFView work

math.DG — Differential Geometry

The Osserman (1990) conjecture is fully resolved, and other miscellanea

Contributed by Dave Goel

The Osserman conjecture says that a Riemannian manifold whose Jacobi operators have the same eigenvalues in every unit direction is flat or locally rank-one symmetric. Chi and Nikolayevsky proved it in every dimension except one remaining case: dimension sixteen, when a Jacobi eigenvalue has multiplicity seven or eight. Nikolayevsky reduced this remaining case to a purely algebraic statement, the Nikolayevsky (2009) conjecture, his Conjecture A. We prove the Nikolayevsky (2009) conjecture. Hence the Osserman conjecture is true in every dimension, including its pointwise form in dimension sixteen. The same result completes the conformal Osserman conjecture, which is stated for dimensions greater than four. Conjecture A says that an Osserman algebraic curvature tensor on ℝ¹⁶ whose reduced Jacobi operator has an eigenvalue of multiplicity seven or eight has a Clifford structure or is a linear combination of the constant-curvature tensor and an orthogonal pullback of the Cayley-plane curvature tensor. For the two-eigenvalue case, we construct a Cartan–Münzner quartic and recover the original Jacobi eigenspaces from its isoparametric classification. For the remaining multiplicity patterns, we study a rational coherent factor of the Jacobi family. Its transpose pencil, polar divisors and residue images reduce the possible poles to cases excluded by degree bounds, real positivity and homogeneous factorization. A frame-independent closed-kernel identity completes the passage from local pole reductions to the algebraic classification.

Author comments: First version: October 28, 2026. This is the expanded version of the paper "The Osserman (1990) conjecture is fully resolved", which is at https://hexagonmath.org/2611.00544 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsCayley planeClifford structureJacobi operatorOsserman conjecturealgebraic curvature tensorisoparametric hypersurfacerank-one symmetric space
Nov 17, 202681 pages
PDFView work

math.DG — Differential Geometry

The Osserman (1990) conjecture is fully resolved

Contributed by Dave Goel

The Osserman conjecture says that a Riemannian manifold whose Jacobi operators have the same eigenvalues for all unit tangent vectors at all points is flat or locally rank-one symmetric. Chi and Nikolayevsky proved it in every dimension except one case in dimension sixteen: a Jacobi eigenvalue of multiplicity seven or eight. Nikolayevsky reduced this case to an algebraic statement, the Nikolayevsky (2009) conjecture: an Osserman algebraic curvature tensor on ℝ¹⁶ with a Jacobi eigenvalue of multiplicity seven or eight has a Clifford structure or is a linear combination of the constant-curvature tensor and an orthogonal conjugate of the curvature tensor of the Cayley projective plane. We prove this conjecture. Hence the Osserman conjecture is true in every dimension, and so is the conformal Osserman conjecture, which is stated for dimensions greater than four. For two eigenvalues, a Cartan–Münzner quartic built from the Jacobi operators, together with the classification of isoparametric hypersurfaces with four principal curvatures, shows that the tensor is Clifford or comes from the Cayley projective plane. For three or more eigenvalues, polynomial eigenfields settle nineteen multiplicity patterns. In the remaining sixteen patterns, a sums-of-squares argument treats the case where the eigenvalue of multiplicity seven or eight is the smallest or the largest; otherwise we study the poles of a rational factorization of the Jacobi operators: a topological rigidity lemma for quadratic Gram matrices settles the case without poles, and degree bounds, real positivity and homogeneous factorization exclude each pole type or force a Clifford structure.

Author comments: First version: October 2026. The expanded version of this paper is at https://doi.org/10.5281/zenodo.23603278 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsCayley planeClifford structureJacobi operatorOsserman conjecturealgebraic curvature tensorisoparametric hypersurfacerank-one symmetric space
Nov 17, 202663 pages
PDFView work

math.OA — Operator Algebras

Modular Kittaneh Numerical Radius Inequalities

Contributed by K. MAHESH KRISHNA

We show that for adjointable morphisms on Hilbert C*-module over a commutative unital C*-algebra, a version of breakthrough numerical radius inequalities obtained by Kittaneh [\textit{{Stud. Math.}, 2005}] hold.

Primarily human-written textHuman understanding: all partsHilbert C*-module.Numerical radius
Nov 17, 202612 pages
PDFView work

quant-ph — Quantum Physics

Double-Pulsar Drag Bounds Dissipative Sources of Diósi–Penrose Decoherence

Contributed by Marc Sperzel

In the proposal of Diósi and Penrose a mass in a superposition of two positions loses coherence at the rate Γ=CEG/ℏ\Gamma = C E_G/\hbar, first order in Newton's constant. We ask what could produce this rate for a static superposition of equal masses. A bath in its ground state cannot: its noise equals its absorption, which vanishes at zero frequency when the response is continuous there. For the free linearized gravitational field and a 1 μ1~\mug body the loss of coherence stays at a few times 10−310^{-3} at all times and is reversible. These results are standard, at second cumulant. A bath that is not in a ground state can supply the rate, but if it couples to the mass density through a Hamiltonian, the noise that decoheres a body also takes momentum from it. We show that stationary, white, passive noise of Diósi–Penrose form drags a moving body at a rate of at least (2π/3)(CℏG/kBTeff)(2\pi/3)(C\hbar G/k_B T_{\mathrm{eff}}) times its density, with TeffT_{\mathrm{eff}} the fluctuation–dissipation temperature. If the noise keeps this form and one temperature out to the kilometre wavelengths that a neutron star resolves, as it does by construction in the linear-friction dissipative Diósi–Penrose model, the orbital decay of the double pulsar PSR J0737−3039A/B requires Teff/C>3.3×1016T_{\mathrm{eff}}/C > 3.3\times10^{16} K, up to strong-field corrections of order one. This is more than 5×10275\times10^{27} above the laboratory bound on that model and excludes the proposed Tβ≈3T_\beta \approx 3 K by 101610^{16}. Baths that differ between kilometre and laboratory scales escape. Otherwise what survives is noise without back-action: Diósi's original model with Gaussian mass-density smearing R0R_0. Published data allow R0>4.5R_0 > 4.5 Å C1/3C^{1/3} with no upper bound and do not fix CC. For a uniform sphere of radius a≫R0a \gg R_0 the rate is independent of R0R_0 to 1.7 R0/a1.7\,R_0/a at every separation dd, so one visibility measurement, with other decoherence channels subtracted, determines CC; for 1 μ1~\mug of silica τ=65\tau = 65 ps/C/C at d=1d = 1 mm and 0.35 μ0.35~\mus/C/C at d=1 μd = 1~\mum.

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

Browse all works →