math.NT — Number Theory
Note on variable role-reversals
In [1], the author uses variable role-reversals only when . In this note, we shall discuss how to use variable role-reversals when .
Browse
Browse the Hexagon catalog.
math.NT — Number Theory
In [1], the author uses variable role-reversals only when . In this note, we shall discuss how to use variable role-reversals when .
math.MP — Mathematical Physics
Let be an octonionic Hilbert space. Let and be possibly unbounded self-adjoint linear operators. Then for all with , we show that \begin{align*} (1) \quad \quad \quad \Delta _h(A)\Delta _h(B)\geq \frac{\sqrt{|\langle \{A,B\}h, h \rangle -2\langle Ah, h \rangle\langle Bh, h \rangle|^2+|\langle [A,B]h, h \rangle |^2}}{2} \end{align*} and \begin{align*} (2) \quad \quad \quad \Delta _h(A)^2+ \Delta _h(B)^2 \geq \frac{|\langle (A+B)h, y \rangle|^2+|\langle (A-B)h, y \rangle|^2}{2}, \quad \forall y \in \mathcal{O} \text{ satisfying } \|y\|\leq1 \text{ and } \langle h, y \rangle =0, \end{align*} where . We call Inequality (1) as octonionic Heisenberg-Robertson-Schrodinger uncertainty principle and Inequality (2) as octonionic Maccone-Pati uncertainty principle.
math.DG — Differential Geometry
Let . For every , the smallest Euclidean dimension in which every smooth -dimensional Riemannian metric admits a local isometric embedding is . The corresponding dimension for smooth local conformal embedding is . We construct two flat reference embeddings with the same reduced principal symbol. In the conformal reference, the metric line takes the place of one normal direction. The proof uses quadratic products of characteristic waves to correct the metric and gives a sequence converging in every derivative order on a fixed neighborhood. Polynomial metric germs give both lower bounds.
math.NT — Number Theory
Ramanujan proved that for all sufficiently large . Let be the least integer such that this holds for every real . Dudek and Platt showed that the Riemann hypothesis implies . We prove that . To our knowledge, this is the first determination of without assuming the Riemann hypothesis. The proof uses the zero-free half-plane of a recent OpenAI preprint. Its main statement for is formalized in Lean 4 and has been rebuilt independently; its written proof has not been peer reviewed. The deduction is our Theorem B: if for , then . The proof of Theorem B uses only refereed inputs, together with Bhattacharjee's correction of a theorem of Büthe. Relying only on the peer-reviewed literature, and on preprints where stated, we also prove the following by rigorous computer-assisted interval arithmetic. (A) The inequality holds for . The previous range ended at . (C) It holds for . This replaces Axler's threshold , whose proof applies a lemma of Dudek and Platt in a case where that lemma's proof is defective. (B′, D) Either of the following also suffices: a zero-free region above height , or RH verified to height . We tabulate the trade-off between the two. (E) Arguments that use only non-negativity, analytic continuation and the poles up to height cannot go beyond when . So (A) is optimal among such arguments to within 0.41 in . Building on Bhattacharjee's discovery that the constant in Büthe's Theorem 1 lacks a factor , we show that the affected rows of the Broadbent–Kadiri–Lumley–Ng–Wilk table inherit the error, by 1.3–2.2% after re-optimization. We also trace the consequences in the literature.
math.CO — Combinatorics
Addressing the RAF-realizability question in Section 4 of Mike Steel's Interior Operators and Their Relationship to Autocatalytic Networks (arXiv:2305.16714v4, 2023), we characterize which interior operators on the subsets of a finite set E are maxRAF operators of catalytic reaction systems whose reaction set is exactly E. An interior operator is represented by its family of fixed sets, a union-closed family containing the empty set. A same-ground realization is a system with one reaction per element of E, finitely many molecule types, a food set and a catalysis relation; it realizes the empty set together with its RAFs, the nonempty reaction sets whose reactants arise from food by iterated closure under the selected reactions and whose reactions are each catalysed by a molecule of that closure. Such a family has a same-ground realization if and only if it is the intersection of an accessible union-closed family A and a predecessor-support family. Here A contains the empty set, is closed under unions, and every nonempty member of A has an element whose removal leaves a member of A; the members of A need not cover E. A set S is supported by a predecessor map P on E when every element e of S has some element of S in P(e), loops allowed. The family consisting of the empty set and all subsets of size at least three has a same-ground realization if and only if E has at most four elements. This gives the sharp threshold for the family considered in Proposition 5 and its subsequent remarks in Steel (2023). Both results are formalized in Lean 4 with Mathlib.
math.CO — Combinatorics
In a catalytic reaction system with finitely many reactions, a RAF is a nonempty set of reactions whose reactants are produced from the food set by iterated closure under the selected reactions and whose reactions are each catalysed by a molecule of that closure. Steel (arXiv:2305.16714v4, Section 4) asked whether some reaction always lies in at least half of the RAFs. Call a reaction food-ready if all its reactants are food, and abundant if it lies in at least half of the sets in the family formed by the RAFs and the empty set. If some RAF U consists entirely of food-ready reactions, then some reaction of U is abundant, with no condition on the other reactions. If every reaction of the system, except at most two, is food-ready and the system has a RAF, then some reaction is abundant. Finally, the statement that every catalytic reaction system with finitely many reactions and a RAF has an abundant reaction is equivalent to Frankl's union-closed sets conjecture in the form: every finite union-closed family containing the empty set and a nonempty set has an element lying in at least half of its members.
math.NT — Number Theory
Let be Legendre's chi function. We prove that and are irrational. Equivalently, for . The proof uses the Hankel determinants of the moment functional , where . These determinants are values of polynomials of degree at most . We bound the denominators of prime by prime: a bound adapted to residue classes for the large primes, a Lagrange-basis bound for the small ones, and separate arguments for the primes , and . We bound the size of by a discrete log-gas argument against an explicit dual certificate, and prove that for every rational and infinitely many , through a reduction modulo an auxiliary prime . The margins are below () and () per . The whole proof, including the prime number theorem and both numerical certificates, has been formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.
math.AG — Algebraic Geometry
Let . We give a proof that every Weil class is algebraic on every complex abelian sixfold of Weil type for whose Hermitian form has signature and determinant modulo norms. These forms are not split, so neither Schoen's theorem on sixfolds nor the theorem on sixfolds claimed in a preprint of Markman, both of which concern split forms, applies. We model the sixfolds by the part of the Jacobian of a cover , branched at thirteen points, on which its group, the complex reflection group , acts through its reflection representation. A degeneration argument with a ball-arithmetic certificate shows that this family dominates the nine-dimensional Shimura variety. On every member, an integral relation among characters induced from linear characters of subgroups, realized by correspondences with coefficients in the group algebra, reduces the Weil classes to the determinants of eigenspaces of eleven cyclic subcovers. A theorem of Schoen makes these determinants algebraic for the three étale subcovers; for the eight ramified ones we prove it for all cyclic covers of curves of degree at least with at least branch points and fully paired branching data, through a cone over a Fermat variety and Shioda's results. Specialization and isogenies then reach every sixfold. The determinant of the Hermitian form and the relation among characters are exact computations.
math.CO — Combinatorics
Every hypohamiltonian snark and every permutation snark has a unique multiset of cyclically 5-edge-connected factors of the same class under successive decompositions along cycle-separating 4-edge-cuts. We prove that hypohamiltonicity passes from a dot product to both of its snark factors. Together with the factorisation theorem for bicritical snarks, this answers a question of Goedgebeur and Zamfirescu. For permutation snarks, we extend the atom argument of Chladný and Škoviera using colourable cut multipoles and closure under their canonical completions.
math.DS — Dynamical Systems
Two exact four-species counterexamples refute necessity of a D-unstable core for instability of a positive equilibrium. The first has five reactions, parameter-rich kinetics, an explicit generalized-mass-action equilibrium, and a rational Jacobian with eigenvalue 1/500 + (51/500)i. The second has six reactions, at most two molecules on each side of every reaction, no catalysts, and classical mass-action kinetics with fixed integer kinetic orders. At a positive rational equilibrium its Jacobian has integer entries and an unstable nonreal eigenvalue with real part between 0 and 5, certified by an exact shifted-quartic intermediate-value argument. The networks share a reactant incidence relation and 24 nonempty child selections. Exact symmetrization, triangular-block and cubic-factorization certificates show that every child matrix is D-nonunstable in both networks. A permanent zero eigenvalue in an exceptional child distinguishes D-noninstability from strict D-stability. Both counterexample theorems have Lean 4 proofs with Mathlib. A separate asymptotic calculation explains the elementary example through circulation and a fast branching coordinate. The results establish strict linear instability, without asserting a Hopf bifurcation or periodic orbit.
math.DS — Dynamical Systems
A real square matrix A is D-stable if DA is Hurwitz for every positive diagonal matrix D. Applying the critical-point method to Johnson’s contact variety establishes that, in every dimension and for every positive choice of barrier weights, D-stability is equivalent to Hurwitz stability and absence of positive solutions of an explicit principal-minor Fritz–John system. In dimension five the system separates into Lagrange and tangency branches; both equivalences are registered in Lean. Further results treat regular-contact persistence, the boundary of the D-stable set, stability under bounded time-scale ratios and the minimal destabilizing ratio. The finite decision procedure also uses conventional finiteness and termination arguments and was executed exactly only in dimension three. For the five-dimensional Lagrange system the multihomogeneous Bézout number is 1200; 980 generic complex solutions were observed numerically. Worked examples include a Lotka–Volterra community, a published refinery-column gain matrix and an exactly recovered benchmark window. Formal statements, conventional arguments, exact certificates and numerical illustrations are distinguished throughout.
math.CO — Combinatorics
We study constant-weight nonnegative integer vectors under half-L1 distance and compare arbitrary codes with full intersections of affine additive-subgroup cosets with the discrete simplex. A heavy-coordinate decomposition gives the exact reduction A_q(n,n-s) = q + B_q(n,s) to codes whose coordinates are bounded by s. It determines the unrestricted optimum throughout 2n > (q+1)s. For every q ≥ 3 and s ≥ 2, at n = qs−1 and D = (q−1)s−1 the unrestricted and full-coset optima are respectively q+1 and q; we classify all q² unrestricted extremizers. We retain a complete classification of both optima for three coordinates and n < 2D. In the next ternary band, 2D ≤ n < 3D, eight words are attainable precisely when 3n ≥ 8D; equality yields an infinite eight-versus-seven full-coset separation. Exact finite certificates also give a six-versus-five gap at (q,n,D) = (4,5,3) and the quinary single-deletion values A_5(9,2) = 143 and A_5(10,2) = 201. The proofs use intersection bounds and explicit integer affine combinations. The unrestricted decomposition extends known methods, and bibliographic novelty remains unresolved, particularly against a closely related 2024 paper not compared in full.
math.CO — Combinatorics
We prove unconditionally the conjecture of Gurvich and Naumova that for every the set can be partitioned into parts of at most three elements whose sums are powers of . The partition is given by an explicit recursion.
math.AG — Algebraic Geometry
For positive-weight quasihomogeneous isolated complete intersections of minimal embedding codimension two, we prove in dimension two and in every dimension .
cs.MS — Mathematical Software
We study exact longest monochromatic runs of power-residue colourings, including neutral prefixes and least canonical witnesses. A certified rational cover represents every relevant interval inside a short signed character table. A reflection-compatible schedule retains an anchor; conservative filters reject only known contradictions, bilateral completion recovers the full run, and tie-preserving reduction selects its least witness. We prove this exact-success contract and describe its CUDA realization with separate arithmetic domains below and . On one RTX 5090, two reserved cohorts give ratios and of sums of hot per-prime medians against the identified historical dense engine. A separate batch study gives throughput factors - against an already optimized reference. The experiments have different timing boundaries and their factors are reported separately. Short-table multiplicative extraction has close algorithmic antecedents in cryptanalysis; our contribution is its certified organization for exhaustive maxima and witnesses and its measured implementation. Square-root-sized cover parameters do not give a general running-time bound.
math.CO — Combinatorics
Rabung's power-residue construction describes a large progression-free colouring by a prime, a colour count and a target length. We give six additional primitive certificates, checked by full ordinary CPU scans, which yield fourteen direct lower bounds. In colour-first notation, these include , , and . The larger ternary primes lie outside the complete census below . We prove the equivalence of the run and boundary tests with Rabung's criterion and separate pointwise verification from discovery. A finite closure of explicitly identified earlier constructions places the new bounds in context: direct ternary certificates win through length ; Berlekamp and binary recurrence inputs win thereafter. Exact-modulus cyclic witnesses also give six-colour product bounds. The previously published thirteen-claim evidence and its closed empirical analyses are retained separately. Comparisons refer to the stated source catalogue, without an exhaustive global priority or optimality claim.
math.CO — Combinatorics
Let G_X be the graph on the positive integers at most X, with an edge between n and np whenever p is prime and np <= X. Write lambda_1(X) >= lambda_2(X) >= ... > 0 for its positive adjacency eigenvalues, counted with multiplicity. We prove that, for every fixed 21/61 < theta < 1/2 and every integer X^theta/log X <= a <= X^theta, lambda_a(X)^2 = pi(X/a) + O_theta(a/log X), where pi is the prime-counting function. This identifies the eigenvalue at the prescribed rank a throughout a polynomially growing band of centres. For every 0 < theta < 1/2, ordered mean-square bounds give a weaker estimate outside o(X^theta) centres below X^theta. When 1/3 < theta < 1/2, the same O_theta(a/log X) error holds outside o(X^theta) centres using only global prime estimates. The results extend to deletion of any fixed finite set of prime directions. Edges labelled by primes exceeding sqrt(X) form disjoint stars. Retaining their first-exit interactions gives local comparison operators and a family of approximate eigenvectors. Bounds on their overlaps and residuals control eigenvalue counts across clusters, allowing ranks to be recovered where the global perturbation bound no longer separates neighbouring star levels. The Baker--Harman--Pintz lower bound and the Brun--Titchmarsh upper bound supply the short-interval prime counts used in the uniform every-centre theorem.
math.NT — Number Theory
We encode binary messages in completely multiplicative sign functions and read them along the three sequences , and . Two observations with the same exact cofactor remove the unknown smaller-prime signs when multiplied. Allocating shared large primes before pairing embeds ordinary binary error-correcting codes in each trace. Under an explicit large-factor mass hypothesis, a computable schedule gives one infinite encoding with positive prefix rate and a linear errors-and-erasures allowance. A first-occurrence filter makes its raw readings depend causally on a linear message prefix, while encoding and decoding remain polynomial in the numerical observation length. Its supporting primes have arbitrarily small harmonic cost. A finite construction, independent of the analytic hypothesis, stores bits in readings of each trace and corrects every pattern of reading errors. Complementary constructions give persistent sign prescriptions, uniform laws for the active coordinates of words, and compact multiplicative subgroups whose nontrivial quotients have positive quadratic entropy. The word-law and entropy conclusions are not asserted for the polynomially decoded encoding. A separate matrix construction gives another causal positive-rate map. Fixed-scale balancing provides an unconditional quarter-sign bound against every small-prime assignment. All coding statements concern deliberately constructed families, not recovery of an arbitrary multiplicative source. The sparse constructions at superlinear cutoffs keep their large-factor mass input explicit.
math.NT — Number Theory
We study which completely multiplicative sign functions can be identified from the statistics of , and . In a class of finite products of quadratic characters of odd prime conductor, completed without zeros and modified at primes with summable inverse square roots, diagonal correlations of orders two and four determine the function. The second-order data recover the conductor and prime corrections, leaving exactly the ramified local signs undetermined. Fourth-order detectors recover those signs, including at the small primes; the inverse also extends to quadratic components at two. No bounded horizon suffices uniformly: for every prescribed window, two finite-conductor sources can share its complete law and disagree with density arbitrarily close to one half on each trace. For an arbitrary prescribed source , we construct factors such that, for each factor separately, the three traces jointly have the uniform word law at every horizon. The choice is continuous and computable relative to , with a finite bound uniform in for approximation of a canonical synchronous coupling. The same choice treats every horizon sequence . The factors need not be independent. Their synchronous empirical law projects exactly to the product's empirical word law; when a limiting canonical coupling exists, it retains the product's word law, which need not identify as a function.
math.NT — Number Theory
A completely multiplicative sign function is determined by its values on , , and , but exact determination does not quantify how many readings detect a negative prime sign. We distinguish three losses of information: partial compatibility tests, geometric restrictions on certificates, and fractional relaxation of signed constraints. After fixing a prime head, we describe the exact fibre of a window and the parity constraints joining two windows. For any fixed head and any sequence , one table with negative entries passes every -window test and every two-reading test. A separate finite table passes these tests without any global source. We bound certificate capacity - fractional packing under unit reading loads - for narrow and binary certificates and for low-degree transport libraries whose links cancel odd prime valuations in pairs. A fixed algebraic curve of certificates for a target prime has at most logarithmic capacity, or capacity at most one when a reading is constant; in the infinite unanchored case its common poles have field . Conversely, selected values of can force linearly many errors while the capacity of all certificates stays bounded. Two internally disjoint pair families compose without loss on their existing readings, whereas sixteen actual values exhibit . The selected-sample constructions do not give an upper bound for the minimum on a complete prefix.
math.NT — Number Theory
A completely multiplicative sign function may be changed so that two quadratic traces remain identical at every index while a third becomes normal. We classify this freedom for the traces , and . After two traces and a finite prefix have been protected, a monic irreducible polynomial can be made normal from every prescribed source exactly when the field generated by one of its roots contains neither protected quadratic field. In the complementary case, every value of the polynomial is already fixed. A single decidable set of primes of relative density zero supports a continuous, relatively computable completion treating all admissible polynomials jointly, with uniform bounds for each fixed observation family. The proof combines weighted root counts with a sieve for moments whose order increases with the observation scale, followed by a selection using exact finite normalisers. We also give a sufficient condition on prime availability, explicit sparser reservoirs, and a divergent reservoir on which some sources have no completion with a convergent ordinary mean, despite convergence of all fixed word laws in probability. For larger protected families, the obstruction is governed by odd products of quadratic square classes. An explicit example distinguishes certificates for every numerical value from a rational norm identity in the variable.
math.NT — Number Theory
We study completely multiplicative sign functions through their values at positive integers of the forms , and , with observed indices . First occurrences of prime factors give a canonical information set and a complete, prefix-compatible family of parity relations, each involving at most readings. These relations yield exact bounded-distance repair, including corrupted information coordinates, in time for errors; erasures enter through an explicit rank parameter. We then construct arithmetic redundancy without estimating a quadratic regulator. If and , the three traces contain at least negative readings for every fixed and sufficiently large , uniformly in the prime and all other prime signs. The same number of each sign occurs on one trace between and , for each fixed . The proof combines short reconstruction certificates, Lehmer divisibility and balanced divisors. Coprime blocks give compact access to these families without factoring large recurrence terms. Under independent reading noise with fixed erasure probability and conditional flip probability , every source prefix , for fixed , is recoverable from readings with polynomially small failure probability in and preparation polynomial in the numerical and . A fixed positive erasure rate nevertheless leaves exponentially many assignments of observed large-prime signs. No positive-density inverse for unrestricted sources is asserted.
math.NT — Number Theory
The cost of changing prime signs depends on how the resulting multiplicative function is observed. On a fixed prime support of finite harmonic sum, we prove that existence of a polynomial mean for every sign assignment is equivalent to uniform prime truncation and uniform convergence to local products. The criterion applies separately to ordinary and logarithmic means. For independent activations with finite expected harmonic cost, the almost-sure truncation defect is the averaged large-prime parity probability, not a sum of incidences. These criteria separate averaging methods and observation geometries. One common support is logarithmically stable for every fixed polynomial and every assignment, yet a fixed perturbation of on that support has divergent ordinary means on . Collective upper sieves give stability at critical counting exponents without critical summability, and harmonic stability on rectangles whose side lengths have asymptotically equal logarithms. For widths , Gaussian prime estimates give the matching universal budget threshold when ; the negative result concerns only the sum of two squares. Around every completely multiplicative sign function, fixed perturbations of arbitrarily small cost can have divergent logarithmic means on for . A positive oscillation bound is common to this range, although the starting scales may depend on . Window laws further distinguish all origins from almost all origins.
math.NT — Number Theory
For every prescribed completely multiplicative sign function, every integer polynomial irreducible over of degree at least two and eventually positive, and every prescribed prefix, we construct a completion preserving the polynomial trace and the prefix exactly, with vanishing correlations along all fixed admissible affine families. The changed primes have relative density zero, although the changed integers have asymptotic density one half and the changed primes have infinite harmonic mass. One noise trajectory has these properties almost surely at all positive real times. The construction combines a classical root-free prime reservoir with decreasing clock rates. Its probabilistic input is affine regularisation against arbitrary bounded weights fixed before the noise, uniformly in time after a vanishing delay. Marks retain their possibly non-convergent empirical distribution. For non-selective noise, the local channel acts through irreducible factors rather than output coordinates; square identities determine its invariant characters, and rational constants supply a time-evolving random translation. The proofs separate arithmetic moments, temporal concentration and finite Fourier analysis. The constant-source existence case already follows from work of Klurman-Mangerel-Teräväinen. The conclusions concern the constructed function, not new cancellation for the unperturbed source.
math.NT — Number Theory
For signs , let count the ordered representations with and . We prove that, for every fixed , all four counts are at least at every sufficiently large integer total. The constants are ineffective through Siegel's theorem. The same conclusion holds uniformly for completely multiplicative sign functions whose positive primes satisfy , with fixed and . Separately, at each sufficiently large prime , both patterns with product have at least representations. All four satisfy this stronger bound in six reduced classes modulo and outside one very sparse family of primes. The proof combines finite reflection-to-dilation propagation, a short-product spectral test, reconstruction from the units, and signed counting of prime disagreements. For the uniform extension, candidates are united before a common exceptional population is removed. None of the conclusions gives a positive-density bound or cancellation of the reflected correlation at every total.
math.CO — Combinatorics
Let G_X be the graph on the positive integers n <= X in which n is joined to np whenever p is prime and np <= X. Let A_X be its adjacency matrix, let lambda_1(A_X) be its spectral radius, and let pi(X) count the primes up to X. Then lambda_1(A_X)^2 = pi(X) + 4 sum_{p <= X} 1/(p - 1) + o(1). More generally, fix a finite set S of primes and retain only the positive integers divisible by none of the primes in S. Let a_1 < a_2 < ... list these integers, and let pi_S count the primes outside S. For every fixed j, the j-th largest positive eigenvalue satisfies lambda_j(A_{S,X})^2 = pi_S(X/a_j) + 4 sum_{p <= X, p not in S} 1/(p - 1) + c(a_j) + o_{S,j}(1), where c(a) = sum_{q divides a, q prime} (q - 5)/(q - 1). The proof splits the edges according to whether their prime label exceeds sqrt(X). The large-prime edges form disjoint stars, while the remaining adjacency has norm of order X^(1/4)/sqrt(log X) but zero first-order matrix element on each star eigenvector. An explicit first-exit resolvent calculation gives a degree-ratio correction with remainder O_{S,j}(1/log X) and localization of the extreme eigenvectors. The prime number theorem and Mertens estimates then evaluate that correction as 4 log log X plus an explicit constant, yielding the displayed o(1) formula. The same constant-layer formula and localization hold uniformly for retained centres a <= (log X)^(1/2-epsilon), with finite-sum error O_{S,epsilon}(a^2/log X). The paired positive and negative modes also yield uniform centre--shell adjacency evolution. The explicit finite correction determines its phase with uniform o(1) error whenever |t| = o(sqrt(X log X)/a^(5/2)). The uniform finite-prime-sum law, its largest-eigenvalue specialization, and the explicit-frequency centre--shell dynamics theorem are formalized in Lean 4 and registered in the Palomar Registry as PALOMAR-2026-08-29-000017, version 2.
math.NT — Number Theory
For the complex Tate curves E_p = C*/p^Z attached to primes, we compute the classical divisorial correspondence groups. For distinct primes, Hom(E_p,E_q) is nonzero exactly when log(p)log(q) belongs to 4 pi^2 Q. If log(p)log(q)/(4 pi^2) = u/v in lowest positive terms, this group has rank one and its generator has isogeny degree uv. The isogeny relation between distinct primes is a partial matching: unconditionally, each prime has at most one partner. These rigidity statements specialize results of Winkelmann; the explicit Hom generator and degree are included here. Outside the matching, the Neron-Severi group of E_p x E_q consists of the two fiber classes, which act trivially on H^1. On every diagonal surface End(E_p) = Z, by Gelfond-Schneider, and the intersection profile of multiplication graphs is independent of p. Consequently no connected classical correspondence system can involve three distinct prime fibers. Version 2 withdraws the broader universal no-go assertion of version 1 and states the exact cross-fiber support restriction required by the obstruction.
math.DS — Dynamical Systems
For a finite ordinary endotactic reaction network, measurable reaction rates in a fixed positive compact box admit a compact convex invariant absorbing set in every positive stoichiometric class. Global positive Carathéodory solutions are unique, and entry times are uniform over compact initial sets and all admitted rate histories. The argument combines the finite affine construction of OpenAI with an endotactic witness estimate that retains the reaction projection lengths. We then quantify what permanence permits as reverse rates shrink. For autonomous weakly reversible networks with , eventual reciprocal concentration bounds depend on the exponent spread through , where is a network-dependent geometric constant chosen before the individual rates. In an explicit three-species system with small positive rate parameters and , prepared concentrations have scales , , , and the worst-case prepared recovery time lies between and . A weighted inventory gives necessary restoration and depletion times from arbitrary positive seeds. Further results treat common clocks, reverse-exponent families and a conventional stochastic lower comparison. Two registered Lean developments support the permanence theorem, continuous dependence and selected deterministic quantitative results. Their precise coverage is separated from conventional extensions and numerical illustrations. Permanence at fixed positive rates supplies neither a uniform guarantee at zero reverse rate nor a global sharp-corridor recovery deadline.
math.CA — Classical Analysis and ODEs
We study the problem of image reconstruction from projection data by combining the Fourier Slice Theorem with scattered-data approximation in the Fourier domain. The unknown image is assumed to belong to the space of functions of bounded variation (BV), allowing discontinuities that naturally arise in practical tomography. In contrast to conventional band-limited formulations, no assumption is imposed that the image itself is band-limited. Instead, the finite bandwidth is attributed to the image acquisition system through the detector response, finite sampling resolution, and associated measurement process. Consequently, the measured Radon projections contain only a finite range of spatial frequencies, and the reconstruction objective is the recovery of the instrument-limited image determined by the measurable Fourier bandwidth. To exploit the structure of the Fourier Slice Theorem, we introduce a symmetric embedding of the image on the torus together with the corresponding symmetrization of the Radon data. The resulting Fourier transform becomes real-valued and even, allowing the Fourier-transformed projection data to be interpreted as real-valued scattered samples of the two-dimensional Fourier transform on a fixed bounded frequency domain. This reformulates image reconstruction as a scattered-data interpolation problem in the Fourier domain. The interpolation problem is analyzed using the recently developed approximation theory for multivariate BV functions from scattered data. The resulting convergence error is expressed in terms of the total reconstruction error separating into an instrument error, determined solely by the finite bandwidth of the acquisition system, and a reconstruction error arising from interpolation of the measured Fourier data. The proposed framework provides a mathematically rigorous and physically realistic formulation of Fourier-slice tomography in which the limitations of the imaging hardware are distinguished from the accuracy of the reconstruction algorithm. Numerical experiments demonstrate the applicability of the method to image reconstruction from limited projection data and validate the predicted convergence behaviour.
math.OC — Optimization and Control
We consider bin-packing instances with items of sizes in , total size , and configuration linear programming value . Let be the relative dimension of the polytope of zero-sum multiplicity patterns obtained by centering sizes at . We determine the maximum additive integrality gap for every . It is zero for and one for . More generally, a representation of the multiplicity vector by at most five zero-sum patterns admits an integral packing, and a representation by at most eleven patterns requires at most one additional bin. The integral-packing result has a structural proof; the additive-one result combines structural restrictions with exact finite enumeration. For arbitrary , we construct an LP-tight subinstance with at most items and no smaller additive gap. An integer representation preserving the signs of triple sums then yields a finite rational family attaining the worst gap, which is computable in time . Finally, we construct a sharp family with simplex pattern polytopes and a linearly growing zero-sum matching deficit. Its eleven-dimensional member violates the zero-sum remainder condition used in the ten-dimensional proof. Thus the bound of eleven fractional patterns in that condition is sharp.
math.OC — Optimization and Control
We study which information about an autocatalytic reaction network suffices for exact composition with other modules. For the maximum amplification factor, threshold-indexed species-price cones compose by exact set operations, while scalar optima do not. Autocatalytic child-selection cores are reconstructed from complete, uniquely matched ordinary-core anchors using alternating exchange paths and certified rational semipositivity tests. For irreducible unary diluted source networks, positive-composition certificates characterize growth, criticality and extinction under arbitrary species degradation; a related certificate identifies partial-actuation stabilizability. Further manuscript results treat factor interactions, exact boundary traces, contextual indistinguishability and junction-tree composition under running intersection and scope extensionality. Separator width bounds message arity, without a runtime claim. Eleven foundation statements are Palomar registered in Lean 4; the broader historical formalization and conventional extensions retain their separately documented scope. Thermodynamic and passive-tail examples illustrate exact interfaces and information loss. Structural amplification and linear onset conclusions are distinguished from nonlinear kinetic dynamics.
math.PR — Probability
In the sparse binary polymer model with reversible ligation and cleavage, we prove that for every fixed food horizon, fixed nonnegative catalysis intensity and fixed linear reaction budget, the probability of a nonempty reflexively autocatalytic and food-generated set within that budget tends to zero, at rate O(1/n). The probability that a single molecule catalyses a self-constructing reaction set also vanishes, cleavage included. A productive-prefix argument excludes bounded catalyst counts, while an injective acyclic dependency encoding supplies a factorial saving in the count of productive reaction supports. Consequences include divergence of minimum RAF size relative to polymer length and of minimum catalyst count, together with conditional forms. Combining the lower bound with the published quadratic-witness result of Hordijk and Steel gives a superlinear-to-quadratic window. The principal estimates and consequences are formalized in Lean 4 against the literal split-position model; the published upper-witness input is cited separately.
math.PR — Probability
We study the Langevin dynamics of spherical mixed -spin glasses at fixed temperature, on time scales exponential in the dimension . Below the static transition temperature, the dynamics started from the uniform distribution on the sphere stays at total variation distance close to one from the Gibbs measure up to a time exponential in , with probability tending to one. We prove this for pure models of degree at least four at every such temperature, and for mixtures of minimum degree at least four that satisfy an explicit condition on a function of one variable. It extends to initial distributions that are independent of the disorder or depend weakly on it. Between the dynamical and static transition temperatures, we show for general finite mixtures that, with probability exponentially close to one, the generator has exponentially many exponentially small eigenvalues; a fixed part of the centered spin lies in the corresponding slow modes; the stationary spin correlation stays above every level below up to an exponential time, where is an explicit root of the plateau equation of the physics literature; the dynamics started from most points of the Gibbs measure stays far from equilibrium; and the two endpoints of the stationary dynamics share mutual information at least linear in . With probability tending to one, the correlation stays above every level below . Near the dynamical transition, exponentially many eigenvalues stay below , where is proportional to an explicit power of the distance to the transition.
math.RT — Representation Theory
We prove that the Gorenstein symmetry conjecture for Artin algebras is equivalent to its restriction to finite rings of prime-power cardinality, preserving the finite self-injective dimension of a counterexample. For finite-dimensional algebras over fields, the conjecture reduces to finite prime fields. In characteristic zero, a counterexample yields counterexamples of one fixed dimension over every prime field outside a finite set.
math.RT — Representation Theory
We reduce the Gorenstein symmetry conjecture for Artin algebras to gendo-symmetric algebras relative to Artin duality
math.RT — Representation Theory
Let be a finite-dimensional representation-finite algebra over an arbitrary field, and let be a nonzero finite-dimensional right -module. We prove that has Cartan determinant one whenever it has finite global dimension. In particular, the Cartan determinant conjecture holds for representation-finite algebras over arbitrary fields.
cs.CC — Computational Complexity
We prove NP-completeness of deciding whether a finite reversible reaction network contains a productive autocatalytic core when neither a target species nor an allowed-food set is specified. The input is a binary encoding of literal nonnegative integer reactant and product matrices, with a signed real flow on each reaction identity. A nonsingular square-witness characterization gives polynomial certificates. A weighted incidence construction reduces prescribed two-path directed linkage to unrestricted core detection, and an explicit constant-size switch construction reduces SAT to the linkage instances. Actual machine-level NP membership and a total polynomial-time binary transducer complete the classification. The terminal theorem is verified in Lean 4. The result concerns structural possibility in this source model and imposes no elementary reaction arity or conservation constraint.
cs.CC — Computational Complexity
The computational difficulty of D-stability, raised by Chen, Fan and Yu (1995, doi:10.1016/0167-6911(94)00036-U), is addressed by an explicit integer-matrix reduction from PARTITION. For positive weights of total 2T, the construction produces a matrix of order m + 4 that is D-stable exactly when no subset has weight T. When an equal split exists, some positive diagonal scaling has an eigenvalue with strictly positive real part. A Pell recursion supplies the parameters, with a logarithmic search bound and an explicit bound on every matrix entry. These bounds give polynomial binary output length. Together with the classical NP-completeness of PARTITION, the reduction yields coNP-hardness of D-stability and D-semistability, and NP-hardness of strict D-instability, even for a four-dimensional core with attachments at one coordinate. The hardness is in the weak sense for binary encoding. Running-time analysis and the trivial-instance cases are treated conventionally; registered Lean statements verify the explicit arithmetic encoding, bounds and promise dichotomy.
math.NT — Number Theory
Assuming the Generalized Riemann Hypothesis, the explicit formula for the L-function of an elliptic curve E/Q bounds the analytic rank of E in terms of the traces a_p for p < e^(2L), for any admissible test function supported on a window [-L,L]. In rank computations this test function is usually fixed in advance, typically to a Fejer-type kernel; optimising it for an individual L-function goes back to Booker, and an earlier test on quadratic twists of rank about 7 found the gain to be small. We choose, for each individual curve, the test function that minimises the resulting bound within a finite-dimensional space supported on [-L,L], certify the result, and measure the gain systematically, up to the current record curves. The minimiser is the solution of a linear system with the Gram matrix of the Weil quadratic form of E, and the optimal bound equals the reciprocal of the corresponding reproducing kernel at the central point, which we call the radix Riemanniana of E. Because the Fejer-type kernel lies in this space, the optimised bound is never weaker. We certify every bound with ball arithmetic, check the prime-side evaluation against the zero side computed independently from the zeros of L(E,s), and benchmark against the fixed kernel on 1642 curves from Cremona's tables, 2500 curves from the Stein-Watkins database and a set of curves with conductors up to 3*10^16. Depending on the sample and on the stopping criterion, the number of primes required to pin down the analytic rank decreases by 8-23% in aggregate. For individual curves of large conductor the decrease ranges from 0% to 43%. Within each sample the gain is largest at rank 0 and decreases with the rank; it grows again, and by a much larger factor, in the regime of large rank and large conductor where the computation is most expensive. On the smallest-conductor curves of rank 28-31 in the ICARM leaderboard the optimised kernel needs 84-85% fewer primes to certify the rank. For the current record, the rank-32 curve #4239 of Elkies, Klagsbrun and Li, it certifies r_an<=32 under GRH with 2.53*10^9 primes - the first upper bound for this curve - and hence r_an=32 under GRH and BSD, while the fixed kernel, certified at L=12.40 with 2 481 819 193 primes, is still 0.39 above the target. On all 395 leaderboard curves of rank 24-31, with primes below 10^10, the optimised kernel certifies r_an<= r on 379 curves and the fixed kernel on 372; where both succeed the fixed kernel needs a median of 4.0 times as many primes. We validate the fixed-kernel baseline by reproducing every published value of Bober and of Klagsbrun, Sherman and Weigandt with an independent implementation.
math.NT — Number Theory
We study the arithmetic behind long runs in a complete census of power-residue colourings below , covering every admissible order . The dataset contains primes and profiles, with exact quadratic four-window counts at every odd prime. A bounded study of its deep tail identifies algebraic windows with fewer independent character conditions than their lengths suggest. We certify their power-class groups and conjugate-root overlaps, obtaining exact Kummer densities for fixed templates, including eight additional order-four models. In a quadratic family, eleven constant positions force twenty-six neutral positions at odd character orders. In two further families, norm identities generate all remaining higher-root relations. A length- cubic realizes a three-wise independent binary code whose monochromatic probability is times that of independent signs; its local run law is computed exactly. A separate stratified million-profile ternary sample is analysed with the same finite catalogue filter applied to the data and to an independent-colour comparator. Finite census statements, selected explanations and asymptotic template laws concern distinct populations. No universal law of global maxima or finite-range error estimate for the template densities is asserted.
math.PR — Probability
Can a Gaussian on a noninteger-dimensional fractal give a probabilistic realization of Edelman's ghosts and shadows? We distinguish a Gaussian-weighted Hausdorff measure, a radial Gaussian law, and a Gaussian random vector or field. For every real , we construct a closed cone of Hausdorff dimension whose Gaussian-weighted -dimensional Hausdorff measure has exactly the radial distribution. The construction relies on exact radial volume growth, not merely on a dimension calculation. We prove a metric obstruction below dimension one and explain why the cone does not supply ordinary Gaussian addition or a scalar algebra. A separate Gram-determinant argument rules out preserving all polynomially continued Euclidean Gaussian Gram identities in a positive model. We then give proofs of the angular beta-gamma identities, associativity of Bessel-Kingman convolution, and its Gaussian convolution semigroup for . Squared Bessel processes, tridiagonal and bidiagonal matrix models, Dunkl Gaussians, and Gaussian fields on fractals provide complementary constructions with explicitly different meanings of dimension. None of these statements asserts the existence of a full noninteger-dimensional scalar algebra.
math.NT — Number Theory
Let count the monochromatic consecutive four-windows of a nontrivial cubic character modulo a prime , with zero excluded and overlapping windows counted separately. We give an exact formula for in terms of fixed elliptic traces and a finite boundary correction. Its complex-multiplication terms are related cubic twists. This produces two arithmetic fluctuation regimes: the first four moments of tend to when three is a cube and to otherwise. Over all admissible primes they tend to . The proof combines a four-position identity following from Greene's hypergeometric formalism and Lennon's trace formula with symmetric-power automorphy, cyclic base change and a finite collection of Rankin-Selberg prime number theorems; it uses no GRH. A direct geometric proof exposes the phases and exceptional points, with the genus-two and isogeny constructions of Freeman-Satoh and Guillevic-Vergnaud explicitly credited. Point-order and Hasse certificates verify numerical examples without enumerating their billion-position character words. The conclusions concern fixed pattern length and four moments; no complete limiting distribution, constant-order centring of the raw count, or law for logarithmic-length maxima is proved.
math.NT — Number Theory
Let be an integer, let be an odd prime power, and set and . We study the Galois representations associated with rank Drinfeld modules of the form , where and . Ordering the coefficient tuples by their maximum degree, we prove that, for a density-one set of tuples, the -adic Galois representation is surjective for every prime of , and the adelic Galois image contains . Moreover, for every tuple in this set, the index of the adelic image equals the index of the corresponding rank-one determinant representation and hence divides . These results extend Zywina's theorem in rank to arbitrary ranks . As a further consequence, we establish the existence of rank Drinfeld modules with surjective adelic Galois representations for every , extending previous existence results which were known for prime values of .
math.NT — Number Theory
A multiplicative identity can persist at every scale while disappearing from a rare-event count. Another identity can survive as a cluster whose points lie far apart. Which distinction matters depends on what is observed. We explain this through one completely calculated model: a uniform germ can trigger two occurrences in disjoint spatial windows. Its two marginal counts become Poisson, but their sum need not do so. A coupling identifies the correct same-grid target and separates the mean number of points from the mean number of active germs. We then isolate the additional work required by multiplicative sources: private prime coordinates, weighted relations between windows, corrections to prime-site intensities, and relations visible at the target scale. A final passage from marked configurations to records explains the roles of ties, recognition and observation clocks. Selected results are stated with their hypotheses; a short concordance leads to their proofs. The elementary calculations are proved here, while the arithmetic and functional limit theorems are taken from the four cited research articles.
math.NT — Number Theory
We study how changing prime signs affects fixed-word frequencies, rare-event laws and extremes of completely multiplicative sequences. The cost is . A known theorem of Frantzikinakis-Lemańczyk-de la Rue preserves normality at finite ; we give its elementary specialization. Using explicit arithmetic inputs from Long runs, we then establish three families of results. For each fixed and almost every base, reversible surgery realizes every stationary finite-intensity marked point-process law along selected scales, with signs, exact excess lengths and converging actual intensity, at arbitrarily small cost and with a prescribed prefix unchanged. Almost surely over all integer scales, the minimum number of prime changes needed for a run of length is asymptotic to for , where satisfies and . At each scale, with probability tending to one, symbolic and private large-prime repair maxima coincide on the same random base for ; unrestricted prime repair agrees when . This comparison transfers the classical lattice laws of runs with errors to adaptive prime repair. Elementary programming from arbitrary bases and an autonomous finite-range-dependent process construction complement these results.
math.NT — Number Theory
We formalize in Lean 4 with Mathlib Roy's strong six exponentials theorem: if are linearly independent over and are linearly independent over , then one of the six products lies outside the -vector space spanned by and the logarithms of algebraic numbers. The proof closure uses only Lean's three standard axioms. Along the way the development proves Waldschmidt's transcendence theorem on in the form used by Roy, and Philippon's multiplicity estimate with derivatives on over every algebraically closed field of characteristic zero, following Roy's account in Waldschmidt's book. We reproduce the public Lean statements, summarize the mathematical route, and record how the artifact is verified. The code is available at https://github.com/telaviv/strong-six-exponentials.
math.NT — Number Theory
Gonek, Hughes and Keating factored , an Euler product times a product over the zeros. We use an exact form , a smoothed Euler factor, and for $\re s_0>\frac12$ study the Euler--Caceres bound , the Poisson kernel. It is the off-line Blaschke term of the Poisson--Jensen formula at , independent of , plus a positive Jensen gap. Under RH, , with universal constants for multiplicity (). Hence, for any single , RH holds if and only if , and RH with simple zeros if and only if tends to an explicit number ( at ). If $\Theta=\sup\re\rho>\frac12$, Landau's theorem in the variable gives for $\re s_0>1$, attained or not, so RH holds iff at one point. Unconditionally, for $\re s_0>1$, and the off-line term at is below . Under RH we identify the second-order term up to an interaction of the wells (known only to be ), related heuristically to Montgomery's pair correlation; it is governed by the gaps between zeros, and under a small-gap hypothesis the law holds with error . We give a function-field model where the bound holds, and controls (a Beurling system with the zeros of and a zero at , the Davenport--Heilbronn function) suggesting that a proof must couple the Euler product with the functional equation. Numerically the bound follows the law, stays below the floor of Dirichlet-polynomial mollifiers at the centre , and grows for the Davenport--Heilbronn function and for a planted off-line zero. We do not prove RH.
math.CO — Combinatorics
We characterize the three-element sets of lucky car indices that occur when a Stirling permutation of order is used as a parking function. A set , with , is admissible precisely when is odd, or is even and is odd with , or both are even with . Explicit Stirling words realize every permitted case. The number of admissible sets is , where . This answers the three-element characterization and enumeration question in Problem 46 of Colmenarejo et al. The complete classification, parking constructions, and enumeration have been checked in Lean. HAL deposit: hal-05800210v1.
math.CO — Combinatorics
Let count vertex subsets of a graph that induce forests, by their cardinalities. Barton, Brown, and Pike asked whether failure of coefficient unimodality forces to have a root with positive real part. We give a negative answer. The join of with three disjoint copies of has a nonunimodal acyclic polynomial of degree nine, yet all its complex roots have strictly negative real part. We derive the polynomial by classifying induced forests and give its exact positive Hurwitz determinants. A Lean formalization verifies the graph-to-polynomial identity and the full counterexample, using an exact rational Lyapunov certificate for strict stability. HAL deposit: hal-05800220v1.
math.CO — Combinatorics
We construct a bipartite graph on 230 vertices whose acyclic polynomial, which enumerates vertex subsets inducing forests, is not unimodal. This answers Question 3.3 of Barton, Brown, and Pike negatively. The graph has a common set of 50 vertices and 15 branches, each with two sets of six vertices. A partition according to the number of selected common vertices gives a three-term formula for the complete induced-forest polynomial. Its coefficients have a strict descent from degree 62 to degree 63 and a later strict ascent from degree 66 to degree 67. The actual graph, the unrestricted subset-counting formula, and the exact inequalities have been checked in Lean. HAL deposit: hal-05800225v1.