math.OA — Operator Algebras
Improved Cauchy-Schwarz-Kaplansky Inequality
We make an improvement and give a new proof for Cauchy-Schwarz-Kaplansky inequality derived by Kaplansky [\textit{Am. J. Math., 1953}].
Browse
Browse the Hexagon catalog.
math.OA — Operator Algebras
We make an improvement and give a new proof for Cauchy-Schwarz-Kaplansky inequality derived by Kaplansky [\textit{Am. J. Math., 1953}].
cs.CC — Computational Complexity
We refute the Exponential Time Hypothesis (ETH) by presenting a deterministic algorithm for 3-SAT on n variables that runs in time. Our algorithm in fact solves the harder problem #3-SAT, providing a count of the number of satisfying assignments. The result was discovered by an internal research Claude model and has been formalized in Lean 4.
math.GN — General Topology
For a metric continuum , let be the hyperspace of subcontinua of equal to the closure of their interior, with the Hausdorff metric. Camargo, Ordo\~nez and Ram\'irez asked whether can be homeomorphic to the rationals or to the irrationals. We answer the latter question affirmatively. We construct a continuum as the closure of a countable tree of scaled copies of an indecomposable plane continuum. Two types of piece alternate: blocks with dense interior, and spines with empty interior carrying densely attached blocks. We characterize all regular subcontinua by nonempty convex sets of pieces satisfying a density condition, and prove that this coding is a homeomorphism onto a subset of a Cantor cube. We then show that no point of has a compact neighborhood. The Alexandrov--Urysohn characterization yields , and hence is homeomorphic to the irrationals. We also explain why this construction does not extend to the rational case, which remains open. Github repository: https://github.com/LucasAlves8Sp/A-CONTINUUM-WHOSE-HYPERSPACE-OF-REGULAR-SUBCONTINUA-IS-HOMEOMORPHIC-TO-THE-IRRATIONALS
math.NT — Number Theory
We prove that the integer solution sets of two classes of Diophantine equations are finite unions of polynomial families with integer coefficients and unrestricted integer parameters. In the first class, each monomial, with at most one exception, contains a variable that occurs to the first power and in no other monomial. The second class consists of equations , where is a monomial independent of with a variable occurring to the first power, and splits completely over $\Q$. If involves at most two variables, may instead be an arbitrary quadratic polynomial. We also give complete formulas for five equations listed as open in the monograph \emph{Polynomial Diophantine Equations: A Systematic Approach} (2024).
math.GR — Group Theory
The classification of finite simple groups (CFSG) identifies the basic building blocks of all finite groups. It grew from nineteenth-century work of Galois and Jordan into a collective effort involving many mathematicians, with Gorenstein playing a central organizing role. Its proof is a vast network of interdependent results such as the Feit--Thompson odd-order theorem, the signalizer functor theorem, and Aschbacher's classical involution theorem. The original papers make up the first-generation proof. The second-generation treatment, initiated by Gorenstein, Lyons, and Solomon, reorganizes and simplifies much of this work. A key structural result in the first-generation program is the Unbalanced Group Theorem (UGT). Under the inductive hypotheses of the classification, it says that a nontrivial subgroup of odd order normal in the centralizer of an involution forces the ambient simple group to be a group of Lie type in odd characteristic or one of the alternating groups of certain degrees. While formalizing the first-generation proof, we found counterexamples to a closure assertion used in a published route to UGT. This obstruction concerns that particular argument. UGT also has other proofs. Here we explain the obstruction and develop an alternative argument for the simple-group case using Solomon's 1976 theory of maximal -components, which provides a framework for comparing the simple pieces arising in different involution centralizers.
math.NT — Number Theory
Ben Green’s historical variant of Tao’s recent tenth discriminant challenge [5] asks how early Gauss’s class-number-one conjecture could have been proved using mathematics then in print. Through discussions with GPT-6 Astra and Opus 5.5, we construct a proof of Gauss’s class-number-one conjecture [1] from ingredients published by 1808, specializing the Frobenius determinant argument [6]. Counting values of the principal form and summing factorial valuations reduce the proof to a residue sieve below 17000.
math.OA — Operator Algebras
The three-dimensional function system of the regular pentagon fails the lifting property, giving a counterexample to the operator-system formulation of the Smith--Ward problem with C-envelope . We construct unital -positive maps from this fixed system into matrix algebras where distance from every ucp map is bounded below independently of . We also prove that every regular polygon system with at least five vertices detects nuclearity, while its dual characterizes the weak expectation property. These tensor-product characterizations follow from a graph dichotomy: a graph operator system and its dual are C-nuclear when the graph is -chordal; otherwise they detect nuclearity and WEP, respectively.
math.MG — Metric Geometry
We compute and compare the volumes of explicit four-dimensional bodies of constant width one. The original five-entry comparison consists of the simplex-symmetric projection body , the canonical raised Meissner pair, the canonical raise of , the body , and . We combine exact geometric formulas, numerical integration, interval enclosures and inscribed rational polytopes to obtain a certified strict ordering of their volumes. We also compare with the direct four-dimensional AMO peabody. The two raised Meissner bodies are proved noncongruent but exactly equal in volume. An introductory account explains why different constructions benefit from different computational methods, and distinguishes approximate volume estimates from inequalities certified by exact or outward-rounded arithmetic.
math.CO — Combinatorics
We introduce the notion of functional equiangular lines in finite rank modules over subrings of . We show that van Lint-Seidel relative and Gerzon universal bounds hold for this most general lines.
math-ph — Mathematical Physics
We examine thirty-six statements of Ashoke Sen on duality, dyon indices, tachyon condensation, F-theory and black hole entropy, and decide which are proved, which are supported but unproved, and where each stops. We prove that every degeneration of F-theory on an elliptic Calabi--Yau variety that is weakly coupled at the generic point of the base is, after base change and rescaling, Sen's family, and that one exists exactly when has a section. We prove that the entropy of a two-charge small black hole is fixed by one critical value for every curvature-corrected action, so that the Gauss--Bonnet truncation matches the microscopic count only in four and five dimensions and Prester's Lovelock completion is the unique one that matches it in every dimension. Exact product expansions reproduce the known negative dyon indices, and the tachyon-dust caustic concerns the pressureless equations, not the rolling solution.
math-ph — Mathematical Physics
Thermodynamic integrability in finite systems admits concave probability-response potentials beyond the canonical ensemble. We investigate how replacing an unresolved block of energy levels by its effective free energy constrains this class and determines the Gibbs distribution, both exactly and quantitatively. For a response family defined across all finite spectra, exact single-block replacement implies conditional independence within each block and selects the Gibbs family with its canonical free-energy normalization. On a bounded energy window, conditional log-odds discrepancies determine a common reference inverse-temperature scale and yield a dimension-independent total-variation bound. A discrete calibration protocol incorporates grid rounding, interpolation under stated regularity bounds, and finite-sample concentration guarantees. We bound the conditional log-odds discrepancies in terms of coarse-grained block-probability residuals through finite block suppression, a bounded outer-control displacement, and a local internal curvature bound. The estimate separates auxiliary system size, measurement precision, and probability conditioning. Smooth local perturbations show that finitely many observations do not uniquely determine the global response. Applications to finite-capacity reservoirs and fixed-coupling mean-force models distinguish work-form closure from temperature-energy scaling. For two subsystems sharing small, bounded, symmetric log-temperature fluctuations, the leading mutual information is half the squared log-temperature variance times the product of their reference canonical heat capacities.
math.DS — Dynamical Systems
We prove that for every choice of four positive masses and every cyclic ordering of the bodies there is exactly one strictly convex planar central configuration with that ordering, up to similarity. This answers Problem 10 in the list of Albouy, Cabral and Santos, which Santoprete calls the Simó--Yoccoz conjecture. The main step is a uniform lower bound for the Hessian at convex central configurations: it is at least one quarter of its radial part, which vanishes only on translations and rotations. Dziobek's relations turn the indefinite part of the Hessian into a negative multiple of a square, and a Cauchy--Schwarz argument bounds this term by the radial part times the trace of an explicit matrix in which the masses do not appear. We prove that this trace is less than by interval arithmetic on the three-dimensional set of normalized convex central configurations, in the coordinates of Corbera, Cors and Roberts. Uniqueness then follows by a covering argument from the case of four equal masses. The computation has been repeated with a second, independently written program. The Hessian bound and the uniqueness theorem, including the computation, have been formalized in the Lean proof assistant and checked by its kernel, using only the standard axioms. As consequences, every degenerate four-body central configuration is concave, the convex central configuration depends analytically on the masses, and the known symmetry theorems for kites, isosceles trapezoids and rhombi follow in a few lines. The analytic dependence and the symmetry theorems are also formalized.
math.MG — Metric Geometry
We study what finite truncations of the lattice-length multiset can determine about a three-dimensional flat torus. For a full-rank lattice \Lambda \subset \mathbb{R}^3, let \lambda_1(\Lambda) \leq \lambda_2(\Lambda) \leq \lambda_3(\Lambda) be its successive minima, and let \mathcal{L}_T(\Lambda) record the lengths of all nonzero lattice vectors of norm at most T, counted with vector multiplicity. First, on the class defined by \lambda_1 = a and \lambda_2 > T, we prove an exact volume classification: the set of possible covolumes is (F(a,T), \infty), where F(a,T) = \frac{aT}{2}\sqrt{3T^2 - a^2}. The lower bound uses Oppenheim's classical determinant-minimization theorem for Minkowski-reduced ternary forms; an explicit perturbed basis proves every larger volume is attained. Second, we give a pair of positive-definite Gram matrices with equal diagonal entries and matching two-coordinate data but different determinants. This yields a quantitative obstruction to uniform finite identification and gives the lower bound \sqrt{3} for the worst-case identification-radius constant. Schiemann's finite theta-series determination theorem supplies the complementary upper bound \sqrt{7/2} after conversion from squared lengths to radii. We also record a cubic sign-product identity for the eight signed basis vectors and explain its limitations. All contributions are separated from classical inputs, and the possible optimality of the constant \sqrt{3} and the broader topological question are left open.
math.QA — Quantum Algebra
Snyder and Spencer showed that every *ribbon* infinitesimal deformation of the trivalent category underlying Deligne's comes from varying . Here we remove the braided hypothesis: every pivotal deformation of , , over a local Artinian -algebra comes from varying . The pivotal hypothesis turns out to be automatic, so the same holds for monoidal deformations. Since is not generated as a pivotal category by its trivalent vertex, the crossing must be added as a generator, and the Reidemeister moves only survive in a deformed form, with lower order terms in the - through -box spaces. An open condition on rotational eigenvalues lets us lift the crossing in a rotation invariant way. A handful of overlap computations, in the spirit of Liu's classification of Yang--Baxter relation planar algebras, then kill every lower order term up to a change of the chosen crossing.
math.GR — Group Theory
For every prime , we construct a finite -group of order and nilpotency class two for which the word admits a value whose fibre has size strictly less than . This gives counterexamples to the Amit--Ashurst conjecture for every prime. We determine the exact fibre size by reducing the word equation to matrix equations over and counting their solutions.
math.OC — Optimization and Control
We study hidden-action contracting with a risk-averse agent and partial knowledge of actions in a compact convex envelope of distribution--cost pairs. With finitely many outcomes and bounded deterministic wages, the principal's worst-case payoff admits an exact dual representation with an endogenous -divergence governed by transfer utility and an incentive multiplier. Under strictly concave utility, finite-multiplier branch optima follow a truncated likelihood-ratio rule, including at zero-probability outcomes. To address nonattainment induced by adversarial tie-breaking, we characterize the infinite-multiplier limit as a restricted zero-sum game. For polyhedral envelopes, we establish two-sided convergence when inverse utility is Lipschitz. Positive tolerance for suboptimal agent responses restores existence and confines the multiplier search to an explicit compact interval. A finite optimal multiplier gives a linear upper bound on tolerance loss; an optimal infinite-multiplier endpoint in a polyhedral envelope gives a square-root upper bound. A two-action example attains the square-root rate asymptotically. Restricting contracts to a coarse performance statistic contracts the endogenous divergence. We characterize equality in data processing under wage bounds, bracket the value of finer contractible information using fine and coarse dual minimizers, and derive quantitative bounds for approximately sufficient statistics. Numerical experiments demonstrate strict gains over utility-affine contracts and distinguish technological knowledge from the richness of contractible performance signals.
math.NT — Number Theory
Assume the Generalized Riemann Hypothesis (GRH). We show that every even integer can be written as , where is a prime and is either a prime or a product of two primes. This result is conditional on GRH and on Theorems 5, 6, 7 and Lemma 9 of Bordignon and Starichkova (Ramanujan J. 64, 2024), together with their auxiliary lemmas, Table 1 and display (6) that their Section 5.4 uses, used at new parameter values inside their own Section 5.4. It is not a new method; it is a re-choice of the parameters and in their argument, combined with the observation that Chen's theorem itself needs only that the Section 5.4 main-term combination be positive, not that it exceed , because the inequality from the proof of their Corollary 1 (Section 5.5, p. 1241), which does not involve the threshold, gives as soon as . In Lean 4 the threshold statement itself is stated with GRH as an explicit hypothesis and proved conditional on the journal's Theorems 5, 6, 7 and the linear sieve Theorem 4 at the constants used; Lemma 9, the Section 5.5 step, and the Section 5.4 bracket arithmetic are proved in Lean. Theorems 5, 6, 7 and Theorem 4 are not formalized. The linear sieve is used in the printed fixed level form; see Remark 1.
math.DS — Dynamical Systems
We prove that for every choice of five positive masses the planar five-body problem has finitely many central configurations up to similarity. This settles Smale's sixth problem for five bodies in the plane. Albouy and Kaloshin proved it for masses outside a closed algebraic subset of codimension two. We follow their method. Infinitely many central configurations would give an algebraic curve of complex solutions. At the places at infinity of the curve the valuations of the mutual distances must balance. We determine the possible valuation vectors at all positive masses, together with the mass conditions under which each can occur. We treat limits in which four bodies form a cluster of zero potential energy by expanding the potential, which is constant along the curve, at a place. This excludes, at every positive mass, one of the two diagrams in which such clusters occur, and part of the other. The same expansion excludes one further diagram at every positive mass. What remains is an exact analysis, by computer algebra, of the sets of mass conditions that can hold together at positive masses. Exact rational certificates show that the balance fails under each of them, except on a few one-parameter families of masses, which we treat separately. On the rays through and the certificates do not apply. On the first ray they cannot apply: there the complex equations have a continuum of solutions, as Albouy and Kaloshin observed. On these rays we count the real central configurations: there are 306 and 294 up to orientation-preserving similarity. The certificates, the programs that check them and a proof of the theorem in the Lean proof assistant are available.
math.CO — Combinatorics
An edge of a graph can be identified by its distances to a suitable set of vertices. If the reports omit the names of these vertices, only a multiset of distances remains, and finding a suitable set becomes more difficult. We determine the asymptotic cost of this loss of information for subdivided complete graphs. Let be the complete graph on vertices, and let replace each edge with a path of edges, where is an integer. Let be the minimum number of vertices whose distance multisets distinguish all edges. For every fixed , we prove Retaining the names requires only vertices. Without them, the cost is quadratic at length three, has order at lengths four and five, and has smaller exponents at longer fixed lengths. We also settle existence at the two shortest lengths for every : no selection works at length two, whereas at length three at most vertices suffice. The proofs combine a count of integer vectors with realizable vertex labels. Sidon sets distinguish endpoint pairs at odd lengths, and exact finite certificates complete the length-three construction.
math.FA — Functional Analysis
We prove that Pisier's operator Hilbert space embeds completely isometrically into the predual of a von Neumann algebra, answering a longstanding question introduced by Pisier and later by Haagerup and Musat. The embedding is obtained as an ultraproduct of free probabilistic models realized in the free group factor , with the trace and circular family scaled according to the mass of the truncated measure .
math.NT — Number Theory
For a tower of curves over a number field with fixed bad-reduction set and , we study the ratio of the stable Faltings height to the conductor of its Jacobian, . We prove four groups of results. (I) Closed forms for the Fermat tower: slope and second-order intercept ( the Glaisher-Kinkelin constant), yielding ; the orbit stratification is strictly increasing and converges to from below. (II) A one-third barrier for -type towers with , conditional on arithmetic BMY in general (Problem 10.1) and unconditional on modular towers, where the BMY input is a theorem (Dolce-Mercuri, Mayer) and where attains equality asymptotically, so the constant cannot be improved. (III) The barrier is strictly stronger than BMY: . (IV) The closure of the attainable set in the abelian-variety tower world is : the lower end is unconditional (Zhang, Wilms) and attained by Heisenberg towers, the upper end is the barrier and is attained by modular towers, and the interior is densely (countably) filled by reindexed product convexity; the curve-tower interior filling remains open. We further record three structural negative results: the archimedean channel is absorbed into the discriminant channel by the product formula; totally rational branch-point hyperelliptic families are closed off by Evertse's theorem; and the Belyi/PU route is likewise closed by -unit equations. The discriminant channel is recast in the thickness language with an explicit upper bound (unconditional for automorphic towers, conditional on the analyticity of in general), and a fully unconditional alternative based on the Brumer-Kramer conductor bound moves - but does not close - the remaining gap. All conditional dependencies are explicitly flagged in the body; all corrections are recorded in the revision history, Appendix B.
math.RA — Rings and Algebras
The rank of the tensor of matrix multiplication over the field with two elements is at most by Laderman's algorithm, and Rudich and Rousseau recently proved that it is at least . We prove that it equals . Hence Laderman's algorithm uses the fewest multiplications among all bilinear algorithms over and among all bilinear algorithms with integer coefficients. The proof uses the substitution method in the form developed by D'Ambrosio, Wang and Yang et al., which bounds the number of first factors of a decomposition that lie in a given subspace of the space of first factors. We sharpen these bounds for of Wang's classes of subspaces, constrain the ranks of the first factors through a flattening of the tensor, and list, up to symmetry, all sets of first factors that satisfy these constraints. An exact completion search shows that none of them is the set of first factors of a decomposition. The computation emits certificates, which are checked in the Lean 4 proof assistant. In one formal proof the largest checks are evaluated as compiled code, and in a second one the kernel evaluates every check, so that its final theorem depends only on the three standard axioms of Lean. The Lean proofs build on the formalization of Rudich and Rousseau and import their table of bounds and their reduction for block algorithms.
math.AG — Algebraic Geometry
Buzzard–Verberkmoes and Mihara show that a stably uniform Tate Huber ring is sheafy. We construct examples of uniform and strongly sheafy Tate rings which are not stably uniform, answering Question 7 of Kedlaya’s Nonarchimedean Scottish Book. In the first example a rational localisation is non-reduced, whilst in the second the rational localisation is an integral domain but is not uniform. The two main results are due to ChatGPT 5.6 Sol. Both constructions, the rational localisations witnessing failure of stable uniformity, and their strong sheafiness have been formalised in Lean 4
math-ph — Mathematical Physics
We prove that three-dimensional U(1) lattice gauge theory with the Wilson action confines static charges at every coupling. More precisely, for each there are and such that rectangular Wilson loops of sides satisfy , uniformly in the finite box, with an absolute constant and an explicit lower bound on . For the Villain action this is the theorem of G\"opfert and Mack. For the Wilson action it is cited as known but has remained open. The proof rests on a comparison. The Wilson plaquette weight is a mixture of Villain weights whose coupling has a very light upper tail. Hence, by Ginibre's inequality, the Wilson loop at coupling is at most an average, over a sparse Bernoulli set of frozen plaquettes, of the Villain loop at coupling , and frozen plaquettes are insulating walls for the monopole gas. A variational regularization, built on the smallest minimizer of a cut functional, freezes more plaquettes, which only increases the loop. It produces slit domains on which the multiscale analysis of G\"opfert and Mack, with wall fields graded by their periods around the handles, runs with uniform constants. On these domains the loop decays like the exponential of the minimal spanning area with frozen plaquettes free. A Peierls estimate shows that this area is at least outside an event of probability at most , with as . We carry over the steps cited from Brydges\textendash Federbush and G\"opfert\textendash Mack with explicit changes and prove them in full in Part S4 of the supplementary material, including a tree-graph counting step of Brydges whose printed deduction is incomplete. As corollaries, we obtain the area law at every coupling for all closed subgroups of U() containing the scalars, also with a Higgs field blind to the centre (as for U(2) with an adjoint Higgs field), and for the Georgi\textendash Glashow model at infinite Higgs coupling.
cs.DS — Data Structures and Algorithms
Let be the least number of comparators in a sorting network on inputs (the Bose--Nelson problem). The values are known for , and for inputs the smallest known sorting network, found by Juill\'e, has comparators. We prove , so . Deleting the comparators met by the largest and the second largest input leaves a sorting network on inputs, so , where is the least possible worst-case number of comparators met by these two values. Van Voorhis stated for an explicit function , but Mericanii showed that his proof is invalid. We prove for by a finite search, which rests on the structure of the tree of paths of the largest value, the comparators on these paths, and a forest of comparators that carries the second largest value. With this bound gives only . For we apply it to the suffix of a network: if a network with comparators sorts a set of - vectors, then for suitable pairs of inputs the two values meet at most comparators, where is the cost of sorting the residual set left when their paths are deleted. A breadth-first search over the sets produced by prefixes of a hypothetical sorting network with comparators discards each set for which no single network stays within all these budgets, and no set survives at depth . A separate verifier checks the certificate written by the search. Two proofs in Lean 4 check the same certificate, and in one of them Lean's kernel checks every computation, with only the standard axioms. Juill\'e's network is checked in the kernel as well. As a consequence, each of the twenty lower bounds on for that rested on Van Voorhis's inequality is proved and raised by one.
math.GN — General Topology
For a metric continuum X, let D(X) be the family of subcontinua A of X with A = cl_X int_X A. Ordõnez asked which finite numbers occur as |D(X)|. Camargo, Ordõnez and Ramírez excluded 2, 4, 5, 8, 9 and asked whether every k ≥ 256 occurs. We prove that a positive integer k equals |D(X)| for some metric continuum X if and only if k not in {2, 4, 5, 8, 9, 16}. The finite cardinalities of D(X) are exactly the numbers of vertex sets inducing connected subgraphs of finite connected graphs; every finite connected graph is realized by copies of the Knaster continuum glued at points. We determine the values of this graph invariant without computer assistance. A short argument excludes 16, and an explicit recursive family of graphs realizes every k ≥ 17 with the least possible number of vertices. Consequently, for k ≥ 32 the least number of minimal regular subcontinua of a continuum X with |D(X)| = k is ⌊log2 k⌋ + 1. Programs check the explicit finite graph counts, and Theorem A is formally verified in Lean.
math.NT — Number Theory
We show how Selberg's symmetry formulas and the recent finding that there are no Landau--Siegel zeros connect to give a radically elementary proof of Linnik's theorem on the least prime in an arithmetic progression.
math.GN — General Topology
For every we construct a connectedness-preserving bijection of whose inverse does not preserve connectedness. The restriction of off the closed coordinate ray is a homeomorphism onto the complement of , where is a nondegenerate continuum with empty interior. The discontinuity sets of and are exactly and , and both maps can be chosen to have exact Baire class . The preimage of a fixed straight segment can be any prescribed uncountable closed subset of with empty relative interior, including the middle-thirds Cantor set. The construction is uniform in the dimension. Homeomorphisms with compact support move finitely many collar points to a prescribed net, and narrowing the resulting collars produces a recurrent tube. Compact arcs on one retained boundary line supply dense connected tracks, while a gate lemma proves preservation of arbitrary connected sets. This answers W. Wong's question in the negative. We also prove that every component of the closure of the discontinuity set of a planar connectedness-preserving bijection is unbounded, and construct Borel counterexamples on manifolds with a standard spherical end.
math.NT — Number Theory
Assuming the Riemann Hypothesis, we prove that for every real the interval contains an even integer that is a sum of two odd primes. The proof combines a weighted mean square bound for the Chebyshev prime counting error in short intervals with a piecewise linear weight in a bilinear identity for short interval prime counts. The deduction is checked in Lean 4 conditionally on the explicit formula ExplicitA, the zero sum bound HadamardK, the zero count BPTN, the HSW zero counts, the bound , and the Goldbach verification to , all stated as hypotheses.
math.CO — Combinatorics
For every integer , we construct a finite atomistic convex geometry of convex dimension exactly three having a maximal proper sublattice whose complement has exactly minimal elements and exactly two maximal elements. The lattice has elements and the sublattice has elements. At the construction is the 25-element example of Bhattacharjee. Thus the number of minimal elements in such a complement is unbounded even when the convex dimension is fixed at three, in contrast to the common-minimum theorem in convex dimension two.
math.RT — Representation Theory
We prove the Gorenstein symmetry conjecture for every finite-dimensional split square-zero extension of an algebra derived equivalent, over the ground field, to a finite-dimensional hereditary algebra.
math.RT — Representation Theory
Over any field, we reduce the Gorenstein symmetry conjecture to an explicit family of endomorphism algebras over a fixed five-dimensional commutative local symmetric algebra.
math-ph — Mathematical Physics
We construct reversible finite-state cellular automata whose integer lifts approximate smooth solutions of one-dimensional semilinear wave equations. The kick–drift update is bijective for every odd modulus. Separate rounding of spatial edge contributions and local nonlinear forces gives an exact one-cell support bound for the full local operator algebra. Under a strict Courant condition, a discrete energy estimate bounds the field and staggered-velocity errors by on a fixed physical time interval, where , , and are the spatial, temporal, and field spacings. An explicit modulus bound prevents modular wrapping throughout that interval. The choices , , and yield second-order convergence. Coupled scalar fields have a common-speed, locally Lorentz-covariant classical limit. Equal bare masses and equal quartic self-couplings preserve a symmetric invariant manifold. Unequal quartic couplings introduce a cubic source into the antisymmetric field equation, and we derive the first variation of the antisymmetric field. Numerical experiments compare exact integer trajectories with a nonlinear traveling wave and an independent continuum solver, measure light and massive dispersion branches, and examine continuously interacting wave packets. The accompanying programs reproduce the reported calculations.
math.RT — Representation Theory
We prove the Cartan determinant conjecture for every corner of finite global dimension in an Artin algebra of global dimension at most two. Consequently, the conjecture holds for torsionless-finite Artin algebras.
math.MG — Metric Geometry
For every complex -unconditional convex body , we prove \[ \operatorname{ill}(K)\le (2^{m+1}-1)\binom nm+\sum_{k=m+1}^{n}\binom nk-(n-m), \qquad m=\lceil2n/3\rceil. \] This bound is asymptotic to . We further obtain and , where is defined by an explicit scalar equation. For normalized bodies other than that contain a full coordinate -polydisc, we prove the sharp bound . We also prove the sharp bound for every normalized complex -unconditional body in other than , and the sharp bound in for every normalized non-polydisc. The four-dimensional proof includes one finite covering assertion verified by exact integer arithmetic; its complete verifier is included. Under full coordinate permutation symmetry, we improve the three-dimensional bound to by an explicit twelve-vector construction and an exact finite covering certificate. For complex Hanner bodies, we compute both illumination numbers exactly and determine the equality cases in their dimension bounds. If every extreme point has all coordinates nonzero, we prove and a quantitative strict fractional bound for normalized non-polydiscs. For real -symmetric non-cubes we obtain bounds in dimension four, in dimension five, and for every . We also determine the leading asymptotic maximum in the real -symmetric non-cube class: it is . An explicit binary construction proves this without an external coding theorem. A connection to connected domination in cube graphs improves the upper estimate to .
math.NT — Number Theory
Abstract We give a normalization-consistent coefficient formulation of the de Bruijn–Newman heat flow attached to the Riemann ξ-function. For the classical kernel Φ and the family Ht(z) = Z ∞ 0 e tu2 Φ(u) cos(zu) du, Ft(w) = Ht(i √ w) = X n≥0 qn(t)w n , we prove the exact evolution laws ∂tFt = 2F ′ t + 4wF′′ t , q(m) n (t) = (2n + 2m)! (2n)! qn+m(t). The coefficients have positive integral representations and the transformed entire function has order at most 1/2. We relate the zeros of Ft to the Pólya–frequency property of (qn(t)), derive the rectangular Jacobi–Trudi identity for the consecutive Toeplitz minors, and state carefully the strict consecutive-minor criterion needed to pass from these minors to total positivity. In particular, for this coefficient family the real-zero condition is equivalent to strict positivity of every consecutive minor Dt(n, r), not merely to nonnegativity of that selected family. This distinction avoids an invalid use of a weak version of Fekete’s criterion. We also correct the multiplicity bookkeeping for the squared-variable map and record a Chebyshev convolution identity without attributing to it an unjustified duplication of zeros. The paper proves no new unconditional upper bound for the de Bruijn–Newman constant and no proof of the Riemann hypothesis; its purpose is to provide an auditable set of exact identities and to isolate the remaining quantitative problem
math.CO — Combinatorics
We give a computer-assisted proof that the maximum cardinality of a planar set determining at most seven distinct positive distances is sixteen. A diameter-graph argument reduces a hypothetical seventeen-point example to an eleven-point set with at most six distances, except for a thirteen-cycle obstruction. We exclude the cycle by an exact interval certificate. Using a published exhaustive count of sixty-two candidate distance patterns, we classify the eleven-point cores by exact Gröbner-basis calculations and prove that none can have the required seventeen- point extension. All extension calculations use rational or algebraic arithmetic. An explicit sixteen-point triangular-lattice set attains the bound.
math.CO — Combinatorics
Let be the largest size of a complete arc in other than a hyperoval. We prove $m'_2(q) \le q-\floor{q^{2/3}-q^{1/3}}, q=2^h\ge512,\ h\text{ odd}$. The geometric statement underlying the proof is a degree obstruction for arbitrary geometrically irreducible Frobenius nonclassical plane curves; an origin from an arc is unnecessary. The argument uses the curve and a Frobenius twist of its dual, exact weighted point counts, and a local conductor inequality that allows arbitrary singularities. We give a sharper bound obtained by optimizing over powers of two, determine its leading constant according to , and prove further refinements using a characteristic-two normal form. Exact finite computations give, for example, , , and .
math.NT — Number Theory
Let be a totally real cubic field and a prime unramified in . The -adic regulator of is a determinant of -adic logarithms of units and is always divisible by ; call anomalous at if it is divisible by . Among all 592421 totally real cubic fields of discriminant up to , the proportion of anomalous fields matches a random-matrix prediction at every prime , but at it is instead of the predicted . We explain this. For cubic fields of fundamental discriminant prime to 3, we show that the 3-class group and the ray class group modulo 9 of the quadratic field can force every cubic field of discriminant to be anomalous at 3. When the 3-class group of is cyclic, we decide exactly when is anomalous, in terms of one invariant for which we give an explicit formula by cubic residue and Hilbert symbols. The phenomenon comes from the failure of semisimplicity of and has no analogue for . The results fix one or two 3-adic digits of the regulator and say nothing about Leopoldt's conjecture itself.
math.NT — Number Theory
We give complete solutions of thirty-eight Diophantine equations left open in Grechuk's 2024 monograph: fifteen affine equations, five generalized Fermat equations, eight plane quartics, and ten further homogeneous equations. All proofs were generated by AI and require substantial computer algebra computations.
quant-ph — Quantum Physics
We consider the rotated surface code of odd distance with its standard syndrome-extraction circuit, under circuit-level depolarizing noise in which every gate, idle step, preparation and measurement fails independently with probability , decoded by minimum-weight perfect matching with the log-likelihood weights of single faults. We prove that a memory experiment with rounds fails with probability at most , where , for every . Hence the logical error rate per round decays exponentially in for all . Earlier rigorous thresholds for matching on surface-code circuits are , due to Dennis, Kitaev, Landahl and Preskill, and , due to Fowler. We keep their reduction of a failure to a weighted self-avoiding path in the decoding graph, but bound these paths by a local criterion for non-backtracking walks, which gives the threshold in closed form. To reach we use the minimality of the correction along the path, for a canonical choice among the minimum-weight corrections: labellings of short stretches of the path into error and correction edges that contradict this minimality are excluded, and the remaining labelled walks are counted with a potential function that is checked in exact arithmetic. For a leaner schedule with fused measure-and-reset steps the two arguments give and , respectively. With error rates that depend on the type of operation, they certify exponential decay for error models built from the published component error rates of Quantinuum's Helios and H2 and of IBM's Heron r3 processor ibm_boston, mapped onto this circuit. All theorems are also proved in the proof assistant Lean 4, with all computations checked by its kernel. Any argument that bounds the failure probability by the probability of an increasing event, ours included, is limited by the smallest such event that contains all failures, and Monte Carlo estimates place the threshold of this event near for this circuit.
math.GR — Group Theory
Let and let be the unique subgroup of containing with . We prove that and have the same set of irreducible complex character degrees. Meanwhile, is centerless and is not isomorphic to for any finite abelian group . This provides a counterexample to Huppert's conjecture.
math.HO — History and Overview
Written numerically, the date October 24, 2026 corresponds to a Pythagorean triple---the last one of the twenty-first century! The associated ---- 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 is the smallest perimeter shared by two noncongruent integer-sided right triangles, one of which is the ---- triangle.
math.GM — General Mathematics
Let be the Taylor polynomials of a power series with nonzero rational coefficients. We study the proportions of degrees for which the Galois group over $\Q$ is symmetric, alternating, or neither. We prove that the set of degrees with symmetric group can be chosen arbitrarily, even for an entire function with positive rational coefficients whose Taylor polynomials have distinct negative real roots. More precisely, at each degree outside the chosen set, has exactly one rational root, and the group on the other roots is the full symmetric group. Thus the proportions need not converge; when they do, the proportion of other groups can be any number in . These conclusions answer negatively two questions of Katz and Rivin. Moreover, for fixed $s\in\Q\setminus\Z$, we also give a condition on the prime divisors of rational multipliers of the coefficients that forces symmetric groups in density one. For the Taylor polynomials of , we extend Wei's eventual group classification to fixed number fields. Over $\Q$, the number of exceptions to the symmetric group up to degree is , with an explicit constant . We also determine the groups of the central-binomial Taylor polynomials in every degree and prove that every nonconstant Catalan Taylor polynomial has symmetric group. This proves Sun's Catalan group conjecture and his irreducible-reduction criterion for the monic reciprocals of the central-binomial polynomials.
math.DS — Dynamical Systems
We prove that a Newtonian central configuration of finitely many positive masses on a circle whose center is the center of mass must be a regular polygon with equal masses. The proof selects an extremal mass–gap pair and lifts the circle to a periodic configuration on the line. A positive integral representation of the circular kernel converts the force equations into sharp weighted quadrature bounds. A scalar convexity estimate forces equality at the selected pair, and the equality conditions determine every mass and gap. The argument applies to every finite number of bodies and includes all analytic and rational estimates needed for the conclusion.
math.NT — Number Theory
Let be a finite extension of and a monic prime of . Anglès asked whether the -adic Leopoldt defect of Taelman's module of units of the Carlitz module over always vanishes, and Lucas conjectured this, together with the equivalence " iff is injective", for Anderson modules. We show that both statements fail. For every odd prime , the extension of generated by a root of is real, has Galois group , and has positive -adic Leopoldt defect and vanishing -adic zeta value at for every . The obstruction comes from modular representation theory at the infinite place. We attach to every separable an integer , depending only on the Galois group of the Galois closure, its decomposition group at and the character by which this group acts on the Carlitz period, and prove that the -adic defect is at least for all . Using Bosser's -adic Baker-Brumer theorem, we prove that the defect vanishes for every for real abelian extensions and for abelian extensions with cyclic Sylow -subgroup. We also show that a -adic analogue of Papanikolas's algebraic independence theorem for Carlitz logarithms would imply that the defect equals in general.
math.NT — Number Theory
We prove that a positive proportion of positive integers reach 1 within c log x ordinary Collatz steps for every fixed c > 3/log(4/3), with one positive lower natural-density bound independent of c. For each fixed positive target not divisible by three, the same range of times holds with a target-dependent bound, irrespective of its subsequent orbit. Targets divisible by three have predecessor basins of natural density zero. Diagonalization gives one positive-density set with a vanishing excess above the limiting time coefficient. The proof extends weighted inverse trajectories from a fixed finite family of roots and preserves positive weighted mass at every sufficiently large scale. We derive an explicit Fourier-decay estimate, at frequencies not divisible by three, for an auxiliary distribution on residue classes. Its proof uses paired geometric valuations and their exact binomial first-passage law. At order 6409, the coefficient C satisfies log_2 log_2 log_2 C < 176, compared with > 2^172 for the explicit coefficient in Mazur's work. Fractional-moment certificates, residue-capacity bounds, and an enlarged family of roots give explicit density estimates after harmonic and dyadic counting. Further refinements locate surviving mass within the root family, retain conditional residue information, and recover additional distinct sources with a bounded extra step cost. The primitive-decay theorem and the main qualitative density conclusions are formalized in Lean 4. The coefficient-size comparison and the complete optimized density bounds remain paper proofs.
math.MP — Mathematical Physics
Bayesian weak commutativity has been suggested as the most likely condition for reaching the Nagaoka–Hayashi (NH) bound in multiparameter estimation. We show that it is not sufficient. For a full-rank four-level ensemble obeying it exactly, the effects required for NH equality cannot sum to the identity. We find the optimal risk exactly: it lies strictly above the bound and needs seven outcomes, while projective readout on the four levels adds over seven times the NH gap. A robust normalization witness bounds the gap from below across a family including truncated oscillator ladders.
math.NT — Number Theory
We give a normalization-consistent coefficient formulation of the de Bruijn–Newman heat flow attached to the Riemann ξ-function. For the classical kernel Φ and the family Ht(z) = Z ∞ 0 e tu2 Φ(u) cos(zu) du, Ft(w) = Ht(i √ w) = X n≥0 qn(t)w n , we prove the exact evolution laws ∂tFt = 2F ′ t + 4wF′′ t , q(m) n (t) = (2n + 2m)! (2n)! qn+m(t). The coefficients have positive integral representations and the transformed entire function has order at most 1/2. We relate the zeros of Ft to the Pólya–frequency property of (qn(t)), derive the rectangular Jacobi–Trudi identity for the consecutive Toeplitz minors, and state carefully the strict consecutive-minor criterion needed to pass from these minors to total positivity. In particular, for this coefficient family the real-zero condition is equivalent to strict positivity of every consecutive minor Dt(n, r), not merely to nonnegativity of that selected family. This distinction avoids an invalid use of a weak version of Fekete’s criterion. We also correct the multiplicity bookkeeping for the squared-variable map and record a Chebyshev convolution identity without attributing to it an unjustified duplication of zeros. The paper proves no new unconditional upper bound for the de Bruijn–Newman constant and no proof of the Riemann hypothesis; its purpose is to provide an auditable set of exact
math.MP — Mathematical Physics
This note gives an affirmative answer to an open question posed in [Chelkak, Laslier, Russkikh'21]. Namely, it demonstrates the existence of perfect t-embeddings for each sufficiently non-degenerate planar bipartite graph with positive edge weights. The non-degeneracy condition on is formulated in terms of its perfect and almost perfect matchings and does not concern the choice of edge weights. The proof and the main part of the writing were produced by GPT-6 Astra in response to a series of prompts. We manually added Section 1.1 to put this result into a bigger context and slightly edited the introduction in order to improve the readability. We plan to provide a better human-digested version of this result later.