math.AG — Algebraic Geometry
A Counterexample to the Realizability Conjecture for Surface Classes
We give a counterexample to Huang–Huh–Michałek–Wang–Wang’s conjecture on the real realizability of universally pseudoeffective surface classes.
Browse
Browse the Hexagon catalog.
math.AG — Algebraic Geometry
We give a counterexample to Huang–Huh–Michałek–Wang–Wang’s conjecture on the real realizability of universally pseudoeffective surface classes.
math.CO — Combinatorics
We give an inclusion-minimal circular-minor positivity test on five boundary vertices that is not weakly separated. This refutes the inclusion-minimal version of Conjecture 6.3.4 of Alman, Lian and Tran.
math.RT — Representation Theory
Let be an odd prime and let be a finite extension of . We study the distinction between multiplicity one for unramified representations and multiplicity one for irreducible unitary representations. We prove that (G2, SL3) has the former property but not the latter. The unramified multiplicity one assertion uses spherical functions and the spherical Hecke module. For the failure of multiplicity one property, we use Weil representations and theta lifting to obtain an irreducible unitarizable representation with at least two independent SL3(k)-invariant linear forms.
math.CO — Combinatorics
We prove Cuenca’s conjecture that every cluster variable of the matrix cluster algebra associated with a double wiring diagram evaluates to a Schur nonnegative symmetric function on every generalized Jacobi–Trudi matrix. The result extends to cluster monomials.
math.DS — Dynamical Systems
We study the complex solution sets of the polynomial system for planar central configurations of five bodies, modulo rotations, at the masses , and , where the proof of finiteness for all positive masses in a companion paper counts the real central configurations. At the solution set is the union of explicit, pairwise disjoint irreducible curves and a finite set; the curves contain the modified Roberts continuum of Albouy and Kaloshin, up to relabelling the bodies, but none of their points is a positive central configuration. At the solution set is finite, and at the potential, which is positive at every central configuration, vanishes identically on every curve in the solution set, so these curves contain no positive central configuration. Finiteness at these masses, their positive multiples and their permutations therefore follows without a count. We also show that at positive masses two of the limit diagrams of Albouy and Kaloshin occur only for masses on finitely many explicit curves in the projective space of masses.
math.CA — Classical Analysis and ODEs
Bourgain, Clozel and Kahane proved that a nonzero even real function on with and integrable, and cannot have and both nonnegative outside an arbitrarily small neighborhood of the origin. The sharp constant in this sign uncertainty principle is , the infimum of over all such , where is the radius beyond which is nonnegative; its square is the constant of Problem 6.11 in the list of Georgiev, Gómez-Serrano, Tao and Wagner. We prove , improving the previous bounds ; in particular , as conjectured by Gonçalves, Oliveira e Silva and Ramos. The lower bound comes from a weight in the spirit of the summation formulas of Cohn and Gonçalves, built from Gaussians and cosines and corrected near the origin by an approximate solution of a Fredholm integral equation, and the upper bound from an explicit self-dual combination of Gaussians. The numerical inequalities in both proofs are verified in ball arithmetic, and the bounds also have formal proofs in Lean 4.
math.CV — Complex Variables
We prove that the Bohr radius of the bidisc, whose exact value is unknown, satisfies , improving Patel's bound . As in his argument, we pass to functions with positive real part and value at the origin; we bound the sum of the moduli of their coefficients of degree by instead of , where is the Sidon constant of , and we bound , and with computer-assisted certificates. In Lean 4 we also prove , assuming Patel's inequality coupling the coefficients of degrees two and three.
math.NT — Number Theory
Pritsker's areal analog of the Mahler measure replaces the integral of over the unit circle by its integral over the unit disc with respect to normalized area. For an algebraic number of degree with minimal polynomial , taken primitive with positive leading coefficient, let . Flammang proved that for every totally positive algebraic integer outside an explicit finite set. We prove that the smallest limit point of the values of on totally positive algebraic integers and their essential minimum lie between and . The lower bound improves on Flammang's constant: it holds for all but finitely many totally positive algebraic numbers, not only integers, although the exceptions are not determined. Infinitely many totally positive algebraic integers satisfy . The lower bound comes from an auxiliary function with a logarithmic energy term, and the upper bound from an explicit measure that, by a criterion and a theorem of Smith, is a limit of distributions of conjugates of totally positive algebraic integers. The inequalities behind both bounds are verified in ball arithmetic, and both bounds are also proved in Lean, the upper one assuming Smith's theorem.
math.NT — Number Theory
Let be the smallest limit point of the values of the absolute Mahler measure on totally positive algebraic integers . Smyth's work gives , where is the limit point that he found for totally real algebraic integers. We prove , and that infinitely many totally positive algebraic integers satisfy . Together with the lower bound of a companion paper, this places in an interval of length less than . The proof exhibits a measure on with a piecewise linear density on rational nodes. Its logarithmic potential is bounded below by a combination of for irreducible polynomials , namely and polynomials taken from Flammang's work. By a criterion of Smith, , normalized to mass , is a limit of distributions of conjugates of totally positive algebraic integers, and its integral of gives the bound. Two separately written programs verify the conditions in ball arithmetic. Both results are also proved in the Lean proof assistant, assuming Smith's theorem and a lower bound for the potential of the arcsine measure, with the checks of the certificate run either as compiled code or by Lean's kernel.
math.NT — Number Theory
Let be the smallest limit point of the absolute Mahler measures of totally positive algebraic integers . By work of Smyth, , and the best lower bound was Flammang's . We prove that all but finitely many totally positive algebraic numbers satisfy , and that . We also prove that all but finitely many totally real algebraic numbers have absolute logarithmic Weil height . The proof adds to Smyth's method of auxiliary functions the logarithmic energy term that Orloski, Talebizadeh Sardari and Smith derived from the integrality of discriminants for the Schur–Siegel–Smyth trace problem. The resulting inequality is verified rigorously by computer, and the lower bounds are also proved in the Lean proof assistant.
math.CA — Classical Analysis and ODEs
Let be the best constant in the weak type inequality for the centred Hardy–Littlewood maximal operator over axis-parallel squares in the plane. We prove , improving the bounds obtained by Lin. The upper bound comes from a new kernel in Lin's comparison principle, which bounds by half the integral of a suitable kernel; closed forms for the fractional operator in this principle make its conditions checkable. The lower bound comes from a periodic measure obtained by modifying Lin's lattice of point masses. Both proofs are computer-assisted and formally verified in Lean.
math.NT — Number Theory
For an algebraic number let be its absolute logarithmic Weil height, and let . The essential minimum of is the supremum of the numbers for which only finitely many algebraic numbers satisfy . Zagier showed that it is at least , and the best lower bound so far is , due to Flammang. We prove that the essential minimum is at least . The proof combines Smyth's method of auxiliary functions, here with five integer polynomials in , with a logarithmic energy term relative to a measure on the circles and . Resultants and discriminants of minimal polynomials are nonzero integers. They bound the polynomial terms and the energy term, and a condition on the degrees absorbs the leading coefficients, so the argument applies to all algebraic numbers. A superharmonicity argument reduces the positivity of the auxiliary function to the unit circle, where two separately written programs verify it in ball arithmetic for a certificate with exact rational data. We also prove this lower bound in Lean.
math.MG — Metric Geometry
The moving sofa problem in a snake-shaped corridor, posed by O'Rourke and by Georgiev, Gómez-Serrano, Tao and Wagner, asks for the largest volume of a connected body that can be moved through a corridor of unit-square cross-section with two turns that are far apart, one in the – plane and one in the – plane. The largest reported body has volume at least , and Tang obtained upper bounds for this problem, the best of which is . We prove by hand that the largest volume is at most whenever the straight section between the turns is longer than . The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle meet in volume at most . With it, Hammersley's argument for the planar moving sofa problem carries over to three dimensions. The same argument gives explicit bounds for shorter straight sections; these and the main bound have also been proved in Lean 4 with Mathlib.
math.PR — Probability
Let be the supremum of over all probability measures on , where are independent with the given law. Determining is Problem 6.39, the beat the average game, in the list of Georgiev, Gómez-Serrano, Tao and Wagner. Bellec and Fritz proved and conjectured that the lower bound, , is the exact value. We prove , less than above the conjectured value. The proof applies Razborov's flag algebra method to samples of nine points. Since the points are independent, the positivity constraints of flag algebras hold for every single measure, so that no limit objects are needed. An exact certificate is checked in rational arithmetic, and the bound is also proved in the Lean 4 proof assistant, with Lean's kernel checking the certificate.
math.MG — Metric Geometry
In its convex form, Moser's worm problem asks for the least area of a convex set in the plane that contains a copy of every arc of length . For the version in which the copies may be rotated and translated but not reflected, we prove that this least area satisfies ; the best bound before, , follows from Keller's bound for the version with reflections. The proof bounds the area of the convex hull of copies of five polygonal arcs, among them two zigzags that turn in opposite directions, so that without reflections the hull must contain a zigzag turning each way. A branch and bound over the placements of the arcs, with second-order Taylor bounds for signed areas of polygons, produces a certificate, which is checked in ball arithmetic and in the Lean proof assistant.
math.CO — Combinatorics
We prove that the connective constant of the square lattice , the exponential growth rate of the number of -step self-avoiding walks, satisfies . The previous best upper bound, , is due to Couronné. Like the bounds of Pönitz and Tittmann and of Couronné, ours comes from a finite automaton that remembers a bounded part of the past of the walk. The new idea is to count bridges. Since they can all be preceded by the same infinite history, the automaton may treat as visited the unvisited cells that no infinite self-avoiding continuation can reach, and three tests on the current state and the next step recognize such cells. The bound is checked in exact integer arithmetic and proved in the Lean proof assistant.
math.NT — Number Theory
We prove that is irrational, where are the Fibonacci numbers. To our knowledge the only odd value of the Fibonacci zeta function previously known to be irrational was . The proof is a Hankel-determinant construction over , , adapted from a recent unrefereed construction for the -zeta value at integers . Four estimates are combined: a real decay of size , a smallness at the Galois conjugate, which replaces the base-prime content gain of the integer case, local cyclotomic denominator bounds at the twisted roots of unity that occur, and nonvanishing by rational interpolation. The whole argument is formalised in Lean 4 with Mathlib.
math.NT — Number Theory
Romanoff proved in 1934 that the integers of the form , with prime and , have positive lower density . We prove that and, conditionally on an upper bound for prime pairs that Johnston and Trudgian derive from Lichtman's work on primes in arithmetic progressions, that ; the best lower bound so far was . The proof refines the method of Elsholtz and Schlage-Puchta, which bounds the second moment of the number of representations in each residue class modulo a fixed integer. Both bounds are certified by computer and also proved in the Lean proof assistant, with the analytic inputs as hypotheses.
math.NT — Number Theory
The Schur–Siegel–Smyth trace constant is the lower limit of over totally positive algebraic integers . We prove . For the upper bound we exhibit a measure on that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of integer polynomials. This improves the upper bounds of Orloski and Talebizadeh Sardari and of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree found by McKee and Smyth. It is larger than the bound reported by Giraudin, whose verification evaluates its bounds in floating-point arithmetic with fixed safety margins; ours encloses every rounding error. For each bound, two separately written programs check the certificate in ball arithmetic. Both bounds are also proved in Lean 4, the upper bound under the assumption of Smith's theorem, also in a version in which all checks on the certificates are carried out by Lean's kernel. We also give evidence that certificates of this kind cannot lower the upper bound much further without integer polynomials of high degree.
math.CV — Complex Variables
For a transcendental entire function let be its maximum term and its maximum modulus on . Erdős asked for the largest possible value of . An argument of Clunie gives , and Clunie and Hayman proved for an absolute constant that they did not compute. We prove . We make the stability argument of Clunie and Hayman quantitative by testing against trigonometric polynomials at one or both of two consecutive radii where the central index jumps. The proof is computer-assisted, and the theorem is also proved in the Lean proof assistant.
math.CO — Combinatorics
For finite sets of real numbers and , Katz and Tao proved in 1999 that has at most elements whenever , and have at most elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent to , and to in every abelian group. We also prove for all finite sets of integers, improving the exponent of Kleinwaks; through his transfer theorem, this lowers the upper bound for the sum-difference constant of Gyarmati, Hennecart and Ruzsa from to . Both proofs add up entropy inequalities among integer combinations of coordinates of several copies of a random pair, with rational weights found by linear programming; all four bounds are also proved in Lean 4.
math.PR — Probability
Duncan and Schweinhart proved that the -dimensional plaquette random-cluster model with cluster weight on the -dimensional torus has a sharp homological percolation transition at the self-dual point, for coefficients in a field of characteristic other than . Their proof needs the point group of the lattice to act irreducibly on the -th homology of the torus. In characteristic it does not, and the most important case is excluded: with coefficients, which represents the -form Ising lattice gauge theory. We prove the theorem for with and coefficients. The representation-theoretic step is replaced by a transfer-matrix inequality, the classical positivity of the partition functions of 't Hooft's electric-flux sectors; read in the random-cluster representation, this inequality compares the probabilities of homological events. As a corollary, for the ferromagnetic -form Ising gauge theory on the -dimensional torus (Wegner's model when ), the free energy of every nontrivial 't Hooft twist tends to below the self-dual coupling and to infinity above it as the torus grows. For Bernoulli plaquette percolation () the characteristic- case remains open for ; we describe obstructions to proving it, and on the -torus we prove a computer-assisted divisibility theorem for the classes of integral giant cycles just above .
math.PR — Probability
Let be the Chvátal–Sankoff constant, so that the expected length of a longest common subsequence of two independent uniformly random binary strings of length is . Lueker proved with a finite automaton that reads a pair of strings as a sequence of minimal match pairs and remembers the last symbols of each string, for . We carry out his method up to and prove . For the certificate lists states of the automaton, reduced by a symmetry. The bound rests on an explicit positive vector for the weighted transition matrix of the automaton; a checker rebuilds every transition with its own code and verifies the required inequalities in exact integer arithmetic. We also give a complete proof that the automaton accepts the truncated canonical decomposition of every pair of strings, the property on which the method depends. The bound is also proved in the Lean 4 proof assistant, with a computation evaluated by compiled code, and the bounds , , and for , , and by formal proofs that are checked entirely by the Lean kernel.
quant-ph — Quantum Physics
Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is open. For the Werner states , a criterion of Costa Rico reduces -copy undistillability to an inequality for matrices of rank at most two: an alternating sum of the squared norms of their partial traces must be nonnegative. At we call it the endpoint inequality. It is known for two and three copies, and if it held for every in some dimension , NPT bound entanglement would exist. For two copies we show that every equality case has rank two, with its range and that of its adjoint in products of two-dimensional subspaces. We also show that a first failure would produce, at some , an equality case whose range has reduced states of rank at least three on every copy, unlike all known equality cases at . For every we prove the endpoint inequality on an explicit class of matrices whose ranges generically have such reduced states. For four copies we give a computer-assisted proof of it in every dimension for all matrices such that the ranges of and of its adjoint lie in one two-dimensional subspace, as they do for all normal matrices of rank two.
math.PR — Probability
We prove Conjecture 1 of Balister, Bollobás and Riordan for site percolation on in every dimension : for every essential enhancement, activated at any positive density, the enhanced configuration percolates for all close enough to the critical probability . Aizenman and Grimmett gave an argument for this in 1991, but Balister, Bollobás and Riordan found that its combinatorial step can fail. They proved the cases , outlined proofs for bond percolation on and for site percolation on the triangular lattice, and left the cases open. Near a site that is pivotal for a long connection, our proof reroutes the open path through a finite configuration in which the enhancement creates a connection, inside a ball that need not be centred at the pivotal site. A theorem valid in every dimension makes this possible unless the first and last sites of the path in the ball lie at a corner of the ball, and a mass-transport argument finds a ball where they do not. The method extends to site percolation on fourteen further periodic lattices, among them all Archimedean lattices other than the square lattice, and to bond percolation on the honeycomb lattice. The proof for uses no computer, parts of most lattice proofs are finite computer checks of local configurations, and the main theorems for and for nine of the lattices have been checked in the Lean proof assistant.
quant-ph — Quantum Physics
Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is a long-standing open problem of entanglement theory. It reduces to the Werner states , which for and are NPT but cannot be distilled from one copy; if one of them stays undistillable from every number of copies, NPT bound entanglement exists. We prove that for every the state is three-copy distillable if and only if , the threshold known for one and two copies, so a third copy does not help. In every dimension we also prove four-copy undistillability for and five-copy undistillability for , and improved bounds of order for copies. The proofs use a criterion of Costa Rico and computer-verified certificates for quartic moment relaxations that hold for all large dimensions at once; for many copies they combine the resulting inequalities with known partial-trace inequalities. Whether remains the threshold from four copies on is open.
math.NT — Number Theory
We construct an algebraically independent set with divergent reciprocal-logarithmic weight, arbitrary prescribed proximity to selected integers and growing integer-power separation on tails. Nevertheless, every tail contains arbitrarily close rational-dilation pairs for each member of a dense family. The necessary integer-power finite-state lemmas and their proofs are included. This supplies a contrasting construction to the bounded-denominator rational-power example in the companion paper.
math.NT — Number Theory
Starting from Apicella’s private-prime construction, we give a proof draft of divergent reciprocal-logarithmic-weight examples that are algebraically independent, admit any prescribed positive integer-anchor error and have growing mixed-power gaps for rational dilations with bounded denominators. The integer numerator remains unrestricted. We record transcendence and field consequences and retain an elementary reconstruction of Apicella’s rational example in an appendix, with its prior-work attribution explicit.
math.NT — Number Theory
(i) At the arithmetic parameter \delta = 1/3, the three short face diagonals of the negative-cycle ternary Gram form become mutually orthogonal and generate a simple-cubic sublattice of index two; the full lattice is body-centered cubic. (ii) The positive- and negative-cycle Gram tetrahedra admit matching hinge faces. A four-tetrahedron Regge star consisting of one negative-cycle tetrahedron and three positive-cycle tetrahedra has an exactly computable positive deficit angle. (iii) A figure-eight graph with quaternionic cycle holonomies i and j has a nonzero spectral gap; its characteristic polynomial is computed exactly and its smallest eigenvalue is isolated by rational bounds. (iv) The commutator [i, j] = -1 identifies the graph's central Z_2 obstruction with the negative signed-cycle class of the Gram construction. The statements are finite-dimensional results about lattices, piecewise-Euclidean complexes, and unitary graph connections. They do not construct a closed shell, a Lorentzian spacetime, or a solution of the Einstein-matter equations; they do not prove the dominant energy condition or dynamical stability. The term "negative-cycle" refers only to a sign invariant and has no implication of negative physical energy.
math.NT — Number Theory
Terras’s coefficient stopping time conjecture asks whether the shortcut Collatz orbit of every integer n ≥ 2 lies below n when its coefficient ρk = 3d/2k first falls below one. Here k counts shortcut steps and d counts their odd inputs. We prove that every eligible realizer descends when the first-crossing word has at most 75 maximal runs of odd inputs. Any counterexample requires at least 76 such runs, 10 439 860 591 steps and 6 586 818 670 odd inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational approximations to log2 3, the verified range of Rozier and Terracol, and Rhin’s estimate for a linear form in logarithms. We also prove descent for a family with arbitrarily many odd runs. Two further restrictions narrow the remaining words. An initial square U U in a failing word satisfies |U | < 35 log2 k. For a counterexample of shortest crossing length, the reciprocal-sum estimate of Nikzad, Frinkle and Bagherzadeh gives a lower bound on ρk whose value begins 0.9441733669 . . .. The open inequality compares the least eligible starting value in each remaining parity class with an explicit threshold.
math-ph — Mathematical Physics
Continuing the axiomatic program for astrophysics initiated in previous works, we introduce a gravity-model-independent and scale-independent definition of an astrophysical system and of clusters of astrophysical systems over arbitrary piecewise smooth spatial manifolds. A cluster is modeled as a subspace of piecewise differentiable sections of matter and gravitational bundles (modulo coincidence on dense open sets), endowed with macroscopic observable functionals and coupled through a parametric field operator encompassing Newtonian gravity, General Relativity, and modified gravity theories (, Rastall, scalar-tensor, and MOND-type models). Restricting local equations of state to bounded extended-norm balls (which form affine Banach spaces on fixed partitions) and applying Implicit Function Theorems in locally convex spaces, we prove four universal obstruction theorems: (i) a direct multi-observable obstruction theorem; (ii) a gravity-coupled structural obstruction theorem via locally density-solvable field equations and reference evaluation operators; (iii) a causal lifting theorem for general acoustic cones; and (iv) an inverse obstruction theorem, showing that combining causality-constrained equations of state with empirical observable relations induces a priori bounds on the parameter space of the gravitational theory. We also prove that finite-dimensional gravity-coupled clusters are closed and nowhere dense in any Hausdorff locally convex topology, and apply our results to compact stars in Rastall and perturbative gravity, Bowers--Liang anisotropic stars, and galaxies obeying the Baryonic Tully--Fisher Relation.
math.NT — Number Theory
We study two rational sequences, called SeqImpar and SeqPar, originally defined by recurrences and converging to the common limit 5. The ratio of their convergence errors tends to 1/2. Using this ratio, we construct two Dirichlet series weighted by the von Mangoldt function and associated with the Riemann zeta function and the Dirichlet beta function. We prove that these series admit meromorphic continuations whose poles in the critical strip correspond exactly to the zeros of the respective functions, with residues equal to minus one-half of their multiplicities. We then prove that an estimate for the partial sum weighted by SeqImpar and SeqPar is equivalent to the Riemann Hypothesis, and state a parallel criterion for the Dirichlet beta function. The paper rigorously distinguishes proved identities, equivalences, and open problems: the coincidence of the number 1/2 with the critical line does not, by itself, constitute a proof of the Riemann Hypothesis.
math.GR — Group Theory
A uniform group is a quotient on which acts by permuting the generators, and a flat representation is a representation such that each has the -th roots of unity as eigenvalues. These are the quasi-flat matrix models of the group duals . We show that is flat linear, in the sense that its flat representations separate points, and that for finite groups, flat linearity and stationarity reduce to exact covering problems. We use this to compute a census, and to prove results on the Heisenberg and metabelian groups.
math.NT — Number Theory
Robin's criterion states that the Riemann Hypothesis holds if and only if for every . Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if for every , where is the -th primorial and ; for this inequality reads . Let be a colossally abundant number, let be the largest prime not exceeding the number associated with by Nicolas, and write . For we prove unconditionally that . Consequently, the second inequality for implies . We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every with , then Robin's inequality holds for every with . A computation over the primes up to verifies this hypothesis, so Robin's inequality holds unconditionally for . To the author's knowledge, this is the largest range for which Robin's inequality has been verified: it extends the range of Morrill and Platt.
math.SG — Symplectic Geometry
We identify the rational Ekeland–Hofer capacities of convex bodies with Clarke’s homogeneous dual-action selectors by a direct minimax argument. Convex reduction and a common nonresonant quadratic tail give the cohomological real analogue for bodies invariant under a linear anti-symplectic involution. In the real case, the mod-two index of half-period translation requires linking in the presence of fixed Fourier modes. The real selectors are full actions of generalized brake characteristics and converge to twice the least brake action. Convex approximation includes nonsmooth bodies, and Fourier decomposition computes both sequences on diagonal ellipsoids.
math.FA — Functional Analysis
We construct a separable Banach space with the Daugavet and Schur properties whose norm is midpoint locally uniformly rotund and G\^ateaux smooth. The construction combines the ergodic orbit norm of Dantas, Kaasik and Perreau with a Bourgain--Rosenthal enlargement in the form developed by Kadets and Werner.
math.CO — Combinatorics
Let be the maximum number of incidences between distinct points and distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing and , the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent . The second gives balanced configurations along an unbounded sequence with exponent , and further unbalanced configurations. The upper bound is , where . The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.
math.GR — Group Theory
We prove the inductive Alperin–McKay condition at every prime for finite simple groups of types , , , , and , and for those of type in characteristic two. We also prove the corresponding block condition for all unipotent blocks of natural groups of type on their prescribed central quotients.
math.RT — Representation Theory
We verify the inductive Alperin–McKay condition for () and () at every odd prime.
math.CO — Combinatorics
We prove a packing theorem in real and complex normed spaces. Given a possibly infinite family of vectors whose span has finite dimension , let be the supremum of the norms of its finite linear combinations with coefficients of modulus at most one. If is finite, the family splits into nonempty sets, each with sum of norms at most . The same partition works for every norm on the span, using that norm's value of . We also determine exactly which finite lists of nonnegative numbers can be realized as the norms of a family of capacity one in some normed space of dimension at most . We also obtain sharp rank-dependent bounds for products of the moduli of the entries on generalized diagonals and the permanent of the entrywise modulus, extending the known nonnegative-matrix bounds to real and complex matrices. The packing theorem also gives sharp support and entropy bounds for doubly stochastic matrices of bounded rank.
math.LO — Logic
Whitehead held that neither points of space nor instants of time should be primitive: both ought to be definable from relations between material things. Region-based theories of space have largely carried out the spatial half of this program, but the temporal half has remained informal. This paper offers an expository and philosophical account of Dimiter Vakarelov’s dynamic mereotopology, developed in five papers between 2010 and 2016, which aims at a theory of space and time that is point-free in this double sense. We argue that the program is best read as a staged realization of Whitehead’s demand. Each stage enriches the primitive spatio-temporal relations between changing regions just enough to recover a further layer of temporal structure: first moments without order, then an ordered time, and finally nameable, spatially non-trivial epochs. The staging culminates in a structural result Whitehead anticipated but never formalized: points of space and points of time turn out to be different aggregations of one and the same stock of abstract atoms. We also argue that the representation theorems on which the program rests deliver a reconstruction, rather than a reduction, of points, and that reconstruction is what Whitehead’s program requires.
math.PR — Probability
Let be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least in , with and both signs included. The total variation distance to the Poisson law with nominal or exact mean has an explicit equivalent of order , with a coefficient depending on and . After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power : for every fixed , its error lies between constant multiples of and , uniformly in each fixed critical band. The leading correction comes from rational pairs. Keeping all channels up to a fixed height gives an explicit distance equivalent with power , determined by the first omitted height. The third factorial cumulant has optimal power . The proof expands around the exact Bernoulli marginals and stops at the first excluded dependent configuration. Arithmetic bounds for fixed configurations and a separate uniform tail estimate control the resulting positive boundary mass. Short square relations and a common algebraic curve bound the triple interactions; a fourth Charlier test detects the two-pair contribution that makes the quadratic exponent optimal.
math.OA — Operator Algebras
For the subfactor associated to a generic Karlsson matrix of order 6, the first 18 fixed-space dimensions are the Catalan numbers. We obtain this from the quantum group of a Di\c t\u a limit. A first additional invariant tensor for a quantum -transitive overgroup of this group would give a probability measure on closed walks on the kagome lattice with prescribed local distributions. At every even level a straight walk forces its return path and rules out such a measure. At odd levels a family of staircase tests and a 7-letter certificate at level 15 exclude further first occurrences. The least remaining level is 19. We also give an application to free wreath products and examine the second-order variation of the fixed spaces at special parameters.
math.QA — Quantum Algebra
We extend Victoria Lebed’s construction of idempotent solutions of the braid equation by introducing four families of solutions associated with posets. We show that every group can be realized as the automorphism group of such a solution, and establish a classification of solutions that either preserve or interchange the components of each pair. We also characterize when two solutions arising from posets are isomorphic. Finally, for finite posets, we construct two families of involutive solutions whose automorphism groups are explicitly described in terms of the automorphisms and anti-automorphisms of the underlying posets.
math.LO — Logic
We give a countable homogeneous finitely bounded Ramsey structure in a finite relational language with finitely many reducts up to first-order interdefinability but infinitely many self-embedding monoids of reducts. The reducts producing these monoids are first-order interdefinable, while their monoids form a strictly increasing chain. This refutes the existential strengthening of Thomas' conjecture even under the Ramsey hypothesis. The example is an ordered expansion of an equivalence-relation structure. Before the order is added, that structure has exactly five reducts up to first-order interdefinability. We also give a revised proof of the classification of self-embedding monoids for reducts of the countable existentially closed binary branching semilinear order. Exactly five monoids occur, refining its three-class first-order classification. The proof transfers the known classification for the homogeneous binary branching -relation from antichains to arbitrary finite configurations. The additional step is a connectivity argument on finite labelled trees, using both preservation and reflection of the reduct's basic relations.
math.NT — Number Theory
We show that every automorphism of a modular curve of genus at least , where , is induced by the normalizer of in , except for five curves, namely , , , a curve of level found by Jeon, Kim and Schweizer, and a curve of level whose non-modular automorphisms had, to our knowledge, not been noticed before. In particular every automorphism of normalizes the group of diamond operators, as claimed for square-free in an unpublished preprint of Momose. The proof combines a twisted Hecke relation, which comes from the Galois action on the Tate module of the Jacobian, with a uniform bound for the dimension of the CM part of the Jacobian and with computations for finitely many levels.
math.MG — Metric Geometry
We construct an origin-symmetric convex body of revolution in , with real-analytic boundary and positive principal curvatures, whose planar sections tangent to a concentric inner ball all have the same area. The body is nonspherical and has the same section data as a centered ball. The construction bifurcates from the unit ball at height , where degree two is the only even Legendre resonance. We construct approximate solutions to arbitrary order and correct them by a Newton iteration on nested closed parameter sets. A finite-order reduction of the linearized section operator and measure estimates for its small divisors provide the inverse bounds needed for convergence.
math.AG — Algebraic Geometry
We prove the Hausel–Letellier–Rodriguez-Villegas conjecture on the mixed Hodge polynomials of generic semisimple character varieties.
math.NT — Number Theory
Fix nonincreasing positive integer weights and define by . If the total weight is at least two, we prove irrationality of whenever the positive integers are strictly increasing and . For every nonconstant nonincreasing weight profile, this lowers the sufficient base in the general criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3), with the classical base-2 criterion included in the comparison. For weights the base becomes ; staircase weights give . Irregular growth is allowed. A more general form permits nondecreasing sequences and positive integer numerators under polynomial size bounds.
cs.CC — Computational Complexity
For every real polynomial threshold function f of degree at most d on the uniform cube {-1,1}^n we prove AS(f) <= min{n, 6 d b_n (n+d)/(n+2d)} <= (6/sqrt(2 pi)) d sqrt(n) < 2.394 d sqrt(n), where b_n = E|B_n - n/2| for B_n ~ Bin(n,1/2). The previous coefficient was 8/sqrt(2 pi) = 3.1915... The new ingredient is an edge comparison with constant 3/2 in place of 2 in OpenAI's weighted-grading argument: for every positive weight and every sign function h, the number of ordered equal-sign edges of h is at most (3/2)||MH+HM||_HS^2. The proof rests on the exact identity (Z_i M Z_i - M)^2 = I - A_i^2, where A_i is the grade-diagonal part of the multiplication by x_i. Combined with OpenAI's original coupling estimate alone, the lemma already gives AS(f) <= 6 d sqrt(n).