Browse

All works

Browse the Hexagon catalog.

Newest works

1110 works

math.RT — Representation Theory

Broué's Abelian Defect Group Conjecture for 2-Blocks

Contributed by Qiyue Tang

We prove that every 2-block of a finite group with an abelian defect group is splendidly Rickard equivalent to its Brauer correspondent.

Author comments: v3(2026/11/14):The mathematical content is unchanged. This revision adds a brief motivation statement and a link to the related research materials on GitHub.

Primarily AI-generated textHuman understanding: no parts
Nov 11, 202648 pages
PDFView work

math.CT — Category Theory

Higher Galois Recognition and Parameter Descent

Contributed by Zhenyu Sun

Let n≥0n\geq0 and let X\mathcal X be a bounded coherent ∞\infty-topos. Suppose that finitely many noninitial coherent nn-truncated objects cover its terminal object, and that every coherent nn-truncated object in each of their slices has a finite covering family of sections. We identify X≤ncoh\mathcal X^{\mathrm{coh}}_{\leq n} with Fun⁡(M,Sπ,≤n)\operatorname{Fun}(M,\mathcal S_{\pi,\leq n}) for a π\pi-finite (n+1)(n+1)-type MM, recovered by all finite models preserving finite limits, finite coproducts, and effective epimorphisms. Descent uses degrees through n+2n+2 for objects and n+1n+1 for maps; both bounds are sharp for finite homotopy actions. Every exact functor FF between recognized categories has a universal parameter PF=F!(1)P_F=F_!(1) and a canonical factorization through its slice with fully faithful second functor. This parameter characterizes full faithfulness, conservativity, and all exact slice factorizations. For successive abelian Postnikov layers, we identify the space of marked exact lifts with a path space of Eilenberg--Mac Lane sections with local coefficients. The obstruction, classes of lifts, and relative automorphisms occur in degrees r+1r+1, rr, and r−1r-1. We compute a twisted parity obstruction and, for odd primes, classify cyclic self-equivalence components by a pp-adic valuation. A nonzero Postnikov class can persist in the identity component. For continuous finite families over a profinite (n+1)(n+1)-type, we prove that a uniform finite-section atlas exists precisely when the complete model space is π\pi-finite. Exact functors from finite model semantics, together with their lift spaces, satisfy finite-stage descent, while explicit profinite examples separate objectwise trivialization from uniform parameter elimination.

Author comments: 49 pages. Second paper in the series Model groupoids and finite homotopy semantics. Includes two verification scripts and their outputs.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 11, 202649 pages
PDFView work

math.LO — Logic

A Michael Space in the Laver model

Contributed by Morgan Jones

We show that a Michael space exists in the Laver model.

Author comments: I was stress testing Claude Fable 5.2 with varying levels of problems and trying to improve my workflow with AI. This problem was reasoned pretty quickly by Claude, however it required some convincing that it could do it.

Primarily AI-generated textHuman understanding: no parts
Nov 11, 202610 pages
PDFView work

math.NT — Number Theory

Watkins's Conjecture for Elliptic Curves with Rational Two-Torsion

Contributed by Qiyue Tang

We prove that the modular degree of every elliptic curve E/QE/\mathbb Q with E(Q)[2]≠0E(\mathbb Q)[2]\ne 0 is divisible by 2rank⁡E(Q)2^{\operatorname{rank}E(\mathbb Q)}.

Author comments: By posting this manuscript on this platform, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in preparing a finished account or checking the arguments; the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 11, 202635 pages
PDFView work

math.CO — Combinatorics

Positive bases and polytopes for Laurent phenomenon algebras

Contributed by Qiyue Tang

We prove that the cluster monomials of every graph Laurent phenomenon algebra form an atomic positive basis. For every finite normalized Laurent phenomenon algebra over a unique factorization domain, we construct a simple lattice polytope with unimodular normal fan whose polar realizes the cluster complex. We also prove that cluster monomials form a basis of the upper algebra in the finite case. In particular, every linear Laurent phenomenon algebra admits such a polyhedral realization.

Author comments: By posting this manuscript on this platform, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in preparing a finished account or checking the arguments; the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202626 pages
PDFView work

math.LO — Logic

The 51-state beeper M51M_{51}: every battle ends, and what Peano Arithmetic can prove about it

Contributed by Annanay Kapila

We study an explicit 51-state, 2-symbol beeping Turing machine M51M_{51} and its associated dispatch-level process RR. An ordinal descent below ε0\varepsilon_0 proves that every battle of RR terminates and hence that M51M_{51} beeps infinitely often. A growth lemma shows that the battle counters and beep times eventually dominate every function provably computable in Peano Arithmetic. Together with a Rocq-checked simulation theorem, these results establish that quasihalting of M51M_{51} is independent of Peano Arithmetic. The document includes the process definition, machine table, ordinal analysis, growth proof and an account of its external dependencies.

Author comments: Supporting materials: Rocq simulation development, https://github.com/a-kapila/maths-proofs/blob/2e2d689f198e7bd51d264cd5468d6b7606886d2e/beeping-busy-beaver-51/rocq51.tar.gz ; computational checks, https://github.com/a-kapila/maths-proofs/blob/2e2d689f198e7bd51d264cd5468d6b7606886d2e/beeping-busy-beaver-51/checks51.tar.gz . The Rocq materials support the simulation theorem; the complete independence argument is not claimed to be fully formalized.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202635 pages
PDFView work

math.FA — Functional Analysis

COUNTABLY INFINITE-DIMENSIONAL SPACES OF CRYSTALLINE MEASURES

Contributed by Jamie Martin

We construct a symmetric locally finite set Λ ⊂ R for which the space MΛ of crystalline measures with support and spectrum in Λ has countably infinite Hamel dimension; Meyer asked what the dimension of such spaces can be. More precisely, there is a sequence of crystalline measures such that every element of MΛ is a unique finite linear combination of them. Every layer of MΛ of fixed Hermite–Sobolev order is finite-dimensional, but the layer dimensions are unbounded; in one construction they grow linearly, and in general their growth can be prescribed up to a linear change of the order. (For every locally finite set the dimension is finite, countably infinite or equal to the continuum, and the countable case is exactly this behaviour of the layers.) The construction uses clusters of atoms that imitate derivatives of Dirac masses, which produce one-dimensional blocks of prescribed Hermite order. The main difficulty is to show that the union of infinitely many blocks supports no other crystalline measures. We prove this by placing the blocks at random scales, separated by rapidly growing gaps, and showing that every element of fixed Hermite order splits into finitely many block components. We also obtain disjoint sets A, B such that the crystalline measures with support in B and spectrum in A form a countably infinite-dimensional space, while MA = MB = {0}. The existence statement, without the symmetry of Λ, has been formalised and machine-checked in Lean 4; the formal development is recorded in Palomar

Primarily AI-generated textHuman understanding: no partsCrystalline MeasuresFourier Quasicrystals
Nov 11, 202657 pages
PDFView work

math.QA — Quantum Algebra

Another proof of quantum Laurent positivity, II

Contributed by Qiyue Tang

We give a further combinatorial proof of Laurent positivity for skew-symmetric quantum cluster algebras.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202650 pages
PDFView work

math.GR — Group Theory

Twisted conjugacy in spherical Artin groups and their crystallographic quotients

Contributed by Jason Davies

A group has property R∞R_\infty if every automorphism has infinitely many twisted conjugacy classes. Let AA be an irreducible spherical Artin group of Coxeter rank at least two, with pure subgroup PP. We classify property R∞R_\infty for the crystallographic quotient Γ=A/[P,P]\Gamma=A/[P,P]. If AA has Coxeter rank at least three, then Γ\Gamma has R∞R_\infty. In type I2(m)I_2(m), this holds exactly when 4∣m4\mid m, or when mm is odd and 3∣m3\mid m. Together with the known dihedral Artin-group cases, the positive quotient results imply that every irreducible spherical Artin group of rank at least two has R∞R_\infty. The positive proofs combine the rational representation theory of the holonomy action with integral lattice constraints and explicit fixed-vector witnesses. In the negative dihedral cases, we construct automorphisms compatible with the crystallographic extension. For type I2(5)I_2(5), we exhibit an automorphism with Reidemeister number 1818, showing concretely that the quotient construction does not preserve R∞R_\infty. This example, including the identification with the presented Artin quotient and the exact Reidemeister count, is formalised in Lean. An alternative proof for seven Artin groups is formalised under explicitly stated external hypotheses.

Primarily AI-generated textHuman understanding: no partsArtin groupsCoxeter groupsReidemeister numberscrystallographic groupsproperty R-infinitytwisted conjugacy
Nov 11, 202622 pages
PDFView work

math.GN — General Topology

Smooth functions with isolated critical values and systems of fibers

Contributed by Naok Kitazawa

In the 2020s, Marzantowicz and Michalak have introduced the notion of system of smooth hypersurfaces and discussed Morse functions compatible with them: the hypersurfaces are regular level sets of the functions. This is a kind of fundamental theory on Morse functions and related differential topology and geometric topology. We extend this to a certain case: we discuss systems of regular level sets and critical level sets (regular fibers and singular fibers) of smooth functions with isolated critical values.

Primarily human-written textHuman understanding: all parts
Nov 11, 20268 pages
PDFView work

math.NT — Number Theory

The Exact Second Order Term In Ramanujan's Bound For σ(n)/n\sigma(n)/n

Contributed by Jacob Crim

Let σ(n)\sigma(n) be the sum of the divisors of nn, and assume the Riemann hypothesis. Ramanujan showed that σ(n)/n≤eγ(log⁡log⁡n−2(2−1)/log⁡n+S1(log⁡n)+O(1/(log⁡nlog⁡log⁡n)))\sigma(n)/n\le e^\gamma(\log\log n-2(\sqrt2-1)/\sqrt{\log n}+S_1(\log n)+O(1/(\sqrt{\log n}\log\log n))), where S1S_1 is a sum over the zeros of ζ\zeta. Nicolas made this effective, placed the coefficient of 1/(log⁡nlog⁡log⁡n)1/(\sqrt{\log n}\log\log n) in [0.9567,3.789][0.9567, 3.789] at colossally abundant numbers, and asked for its exact asymptotic value. We show that this coefficient is κ+W2(log⁡n)\kappa+W_2(\log n) with κ=2(2+log⁡2)−2=1.80868…\kappa=\sqrt2(2+\log2)-2=1.80868\ldots, where W2(x)=−∑ρxiℑρ/(1−ρ)2W_2(x)=-\sum_\rho x^{i\Im\rho}/(1-\rho)^2 oscillates in [−β,β][-\beta,\beta], β=2+γ−log⁡4π\beta=2+\gamma-\log4\pi. The next coefficient is the constant c0=8−2(8+4log⁡2+34log⁡22)=−7.7443…c_0=8-\sqrt2(8+4\log2+\frac34\log^2 2)=-7.7443\ldots, up to an oscillation of amplitude at most 0.00660.0066. In particular, the rescaled residual studied numerically by Leshchiner, Musin and Thompson does not converge, and it exceeds 3/23/2 at every colossally abundant number with parameter ξ≥4.4⋅1015\xi\ge4.4\cdot10^{15}; this answers their Questions 3 and 4, the second in the negative. We also prove explicit two-sided bounds for the remainder at every colossally abundant number above Nicolas's threshold N(0)N^{(0)}, where log⁡N(0)≈109\log N^{(0)}\approx10^9. This part is computer-assisted: rigorous interval arithmetic covers every real parameter ξ∈[109,e300]\xi\in[10^9,e^{300}], and an analytic argument covers ξ>e300\xi>e^{300}. As corollaries, σ(n)/n≤eγ(log⁡log⁡n−0.699/log⁡n)\sigma(n)/n\le e^\gamma(\log\log n-0.699/\sqrt{\log n}) for all n≥N(0)n\ge N^{(0)}, improving Nicolas's constant 0.582; Ramanujan's limsup is approached from above at every colossally abundant number with ξ≥109\xi\ge10^9; and an odd-integer analogue holds with an essentially sharp constant. The proof reads colossally abundant numbers as ground states of a free gas of prime modes, in which κ\kappa splits into a prime-square term, a saturation-deficit term and a shell-energy term. All enclosures are checked against exact values computed from a sieve to 101010^{10}.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202614 pages
PDFView work

math.LO — Logic

Definability and Lifting in Model Subgroupoids

Contributed by Zhenyu Sun

Restriction to a wide subgroupoid of a model groupoid can introduce invariant relations, maps, and objects. For open topological groupoids, a map between restricted objects lifts exactly when its graph is invariant under the full groupoid, and a specified quotient presentation lifts exactly when its kernel relation is invariant. Under coherent restriction, these criteria recover definable maps and coherent quotient presentations. For finite continuous actions of a group with an open subgroup of finite index, coinduction identifies extensions with invariant subsets on which evaluation is bijective. For a finite group GG and a normal subgroup NN, we classify extensions of finite NN-sets by normalizer extensions of their orbit types. Multiplicities must be constant on conjugacy orbits of types; within each such block, the liftable multiplicities form the additive monoid generated by indices of subgroups over which the normalizer extension splits. The same subgroup data determine the groupoid of lifts and its isomorphism-class and mass generating functions. This classification also applies to finite continuous actions of profinite groups with an open normal subgroup. For a fixed action, a centralizer extension gives the splitting obstruction, with an H2H^2 obstruction and an H1H^1 classification when its kernel is abelian. The center of SL2(F5)\mathrm{SL}_2(\mathbb F_5) gives the monoid ⟨12,20⟩\langle12,20\rangle; Heisenberg groups over fields of odd prime order give unbounded lifting indices at fixed cohomological period. Finite torsor theories and infinite pure sets realize the definability criteria. For profinite extensions with finite kernel, one finite quotient detects all liftable multiplicities, though it need not carry every lift.

Author comments: 37 pages. Exact finite-group computations and their output are included as ancillary files.

Primarily human-written textHuman understanding: all partsBurnside ringscoherent toposesdefinabilityfinite group actionsgroup extensionsmodel groupoids
Nov 11, 202637 pages
PDFView work

math.NT — Number Theory

The Schur-Siegel-Smyth trace problem: the lower bound 1.8022246

Contributed by David Niedbala Giraudin

We prove lambda_SSS >= 9011123/5000000 = 1.8022246 for the smallest limiting trace-to-degree ratio of totally positive algebraic integers. The previous best bound is 1.8022225 (Tomar). The certificate consists of fourteen integer polynomials with rational multipliers and a continuous piecewise-linear density with 8678 rational hat weights; its dual inequality is verified on (0,infinity) in ball arithmetic. For the same family of polynomials the value of the underlying optimisation problem is 1.8022247 to within 10^-9 (numerical), so the bound is within 1.1*10^-7 of what this family can give.

Author comments: 3 pages. Ancillary files: the exact certificate (cert_SSS_1802224600.json), a rigorous checker in ball arithmetic (check_sss.py, python-flint), its run log, an independent numerical cross-check (pointcheck_mp.py) and SHA-256 sums.

Primarily AI-generated textHuman understanding: no partsSchur-Siegel-Smyth trace problemauxiliary polynomialsball arithmeticcomputer-assisted prooflogarithmic energytotally positive algebraic integers
Nov 11, 20263 pages
PDFView work

math.AG — Algebraic Geometry

Ideal generation for general reduced projective points

Contributed by Vlado Vojdanovski

We prove the Ideal Generation Conjecture for general reduced points in projective space over an algebraically closed field of characteristic zero. Equivalently, if the ideal of the points has initial degree D, multiplication by linear forms from degree D to degree D + 1 has maximal rank. The proof combines hyperplane specialization with a construction using two transverse hyperplanes. In the latter construction, motion of their common trace gives the required rank. A uniform induction for all degrees D ≥ 4 reduces the theorem to explicit quadratic and cubic constructions.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202639 pages
PDFView work

math.PR — Probability

An exact moment criterion for survival under renewed spatial catastrophes

Contributed by Man Huang

We prove an exact moment criterion for survival in a binary growth process subject to independently renewed spatial catastrophes. Occupied sites spread through a finite set of allowed increments on the integer lattice, and Poisson catastrophes with unbounded cube sizes empty all occupied sites in each affected cube. Under finite one-site hitting intensity, a positive finite-seed survival phase exists if and only if the cube-size measure has a finite moment of order one more than the spatial dimension. The divergent endpoint yields extinction at every positive intensity. The proof centres on a one-dimensional positive-phase construction for connected interval errors under a finite second moment. Extremal-path resampling gives a conditional correlation inequality, which controls exact interval insertion counts and a finite-history potential. Coordinate restriction and envelope covering then establish the criterion in every dimension. We also prove the bulk-to-seed reversal identity and extend the criterion to uniformly fat shapes. For the one-sided one-dimensional rule, the stationary hole density has a quadratic dilute expansion under the same second-moment condition. Its excess over independently eroded Poisson events is strictly positive at every positive intensity, with an explicit quadratic coefficient in the dilute limit.

Author comments: Based on Zenodo v1 (3 November 2026), https://doi.org/10.5281/zenodo.23911961. Mathematical text and references unchanged; portable font and provenance updates only. Original source and finite diagnostics: same DOI.

Primarily AI-generated textHuman understanding: some partsdependent percolationinteracting particle systemsprobabilistic cellular automataspatial catastrophessurvival criterion
Nov 11, 202617 pages
PDFView work

math.PR — Probability

Quartic exponential matching in the unit square

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Take two independent samples of nn uniform points in the unit square. We prove that, with probability at least one half, the points can be paired so that the average of the exponential of the fourth power of the normalized pair distance is at most two. The distance normalization is Llog⁡n/nL\sqrt{\log n/n}, with LL an absolute constant. One pairing therefore satisfies both coordinate inequalities in the symmetric (4,4)(4,4) case of Talagrand's matching problem. The argument first controls a vector field transporting smoothed point densities, and then converts that control to a pairing. The main estimate comes from a Gaussian construction whose successive partitions depend only on noise already revealed; a correction using the classical bottleneck matching preserves the required density balance.

Primarily AI-generated textHuman understanding: all partsTalagrand matching problemgeometric probabilityrandom matching
Nov 11, 202613 pages
PDFView work

cs.FL — Formal Languages and Automata Theory

Sublinear-space recognition for Boolean grammars

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

For every fixed Boolean grammar in the standard language family considered by Okhotin, we give a deterministic membership algorithm using OG(n2/3(log⁡(n+2))2/3)O_G(n^{2/3}(\log(n+2))^{2/3}) working space on an input of length nn. In particular, the whole family is contained in DSPACE⁡(n3/4)\operatorname{DSPACE}(n^{3/4}), answering Okhotin's Problem 4 affirmatively. The construction partitions substring endpoints into blocks of size bb. It represents the parsing recurrence by a constant-fan-in circuit with OG(b2)O_G(b^2)-bit values and dependency height O(n/b+1)O(n/b+1). Splits in the endpoint blocks are resolved locally, and an ordering of the remaining splits controls the height even when a split is highly unbalanced. Applying the Cook–Mertz tree-evaluation algorithm to the implicitly unfolded circuit gives the space bound.

Primarily AI-generated textHuman understanding: all partsBoolean grammarsparsingspace complexitytree evaluation
Nov 11, 20266 pages
PDFView work

math.DS — Dynamical Systems

Palindromic sections in two Kolakoski phase actions

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove the two specified-phase orbit statements in Shen's Conjectures 3.4 and 3.7. The all-ones phase for the alphabet {1,n}\{1,n\}, with nn positive and even, and both alternating phases for {−1,n}\{-1,n\}, with nn any even integer, have orbit length 2⌈d/2⌉2^{\lceil d/2\rceil} at depth dd. The proof uses unreduced signed words and a palindrome class preserved by taking the section of the square at two phase coordinates. It also gives the all-ones statement for nonpositive even nn under Shen's displayed signed recursion. These are finite phase-orbit results; they do not imply the density conjecture for the classical Kolakoski sequence.

Primarily AI-generated textHuman understanding: all partsKolakoskicombinatorics on wordspalindromesphase orbits
Nov 11, 20265 pages
PDFView work

math.DS — Dynamical Systems

Two exact frequency extrema for smooth sequences over {1,3}

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Using the frequency coding of Jamet, Marcovici, Poirier, and de la Rue, we determine the largest frequency of 11 in a smooth sequence over {1,3}\{1,3\} and the largest such frequency below 1/21/2. They are 1/2+1/(3+5)1/2+1/(3+\sqrt{5}) and 1/2−1/(13−5)1/2-1/(13-\sqrt{5}), respectively. The unique attaining type directives are 1∞1^\infty and 0001∞0001^\infty. The proof is an order comparison for two planar homographies. The first value corrects the numerical expression in the stated extremum question.

Primarily AI-generated textHuman understanding: all partsKolakoskiletter frequenciessmooth sequencessymbolic dynamics
Nov 11, 20266 pages
PDFView work

math.RA — Rings and Algebras

A Counterexample to the Subtraction-Free Conjecture for Bounded Ratios of Minors

Contributed by Qiyue Tang

We disprove the subtraction-free conjecture of Boocher and Froehle for bounded ratios of minors of totally positive matrices. We construct products (P,M,Q) of ordinary minors of a matrix of order (3207) such that [ 0<\frac{P}{MQ}\leq\frac1{64} ] throughout the totally positive locus, whereas (MQ-P) has a coefficient equal to (-1) in the standard bidiagonal parameters.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202616 pages
PDFView work

math.NT — Number Theory

Irrationality of χ₂ and Ti₂ at units of real quadratic fields

Contributed by Shawn Krisman

We prove that χ2(m2+1−m)\chi_2(\sqrt{m^2+1}-m), a value of Legendre's chi function at a unit of norm −1-1, is irrational for every integer m≥2m\ge2 except m=3,5,7,9,15m=3,5,7,9,15. For m=2m=2 this shows that π2−18log⁡2φ\pi^2-18\log^2\varphi is irrational, where φ\varphi is the golden ratio. The method extends to all units of norm −1-1 in real quadratic fields, giving χ2(ε)∉Q\chi_2(\varepsilon)\notin\mathbb{Q} outside an explicit set of 4747 units, and, through a twist identity, to the inverse tangent integral Ti2\mathrm{Ti}_2 at units of norm +1+1, outside 5757 units. The proof combines Hankel determinants of a reflection-symmetric Padé machine, arithmetic bounds on their denominators, a discrete log-gas bound certified in interval arithmetic, and a nonvanishing argument modulo a prime. Below the range covered by the criteria of David, Hirata-Kohno and Kawashima, these results appear to be new. All three theorems are formalised in Lean 4 with Mathlib, using only the standard axioms.

Primarily AI-generated textHuman understanding: no partsClausen functionGolden RatioHankel determinantsLeanLegendre chi functiondilogarithminverse tangent integralirrationalitylogarithmic potential theoryunits of real quadratic fields
Nov 11, 202659 pages
PDFView work

math.AT — Algebraic Topology

Singularity Projection in Three-Dimensional Space and the Discretization of a Continuous Interval

Contributed by zoushanzhong zou

We study the projection geometry induced by a singular point on the boundary of a three-dimensional fan-shaped cylinder. The cylinder is defined in the first quadrant of the real coordinate plane, with x and y both between zero and one, and a singular point located at x=1 on the boundary. Through an iterative projection process involving the angle bisector of the quadrant, we prove that the continuous interval [0,1] is precisely discretized to an infinite set of boundary points.

Primarily human-written textHuman understanding: all parts
Nov 10, 20264 pages
PDFView work

math.CO — Combinatorics

The Cereceda (2007) conjecture holds for bipartite 2-degenerate graphs

Contributed by Dave Goel

For a graph GG and a positive integer kk, the kk-recolouring graph Rk(G)\mathcal{R}_{k}(G) has the proper kk-colourings of GG as vertices, two of them adjacent when they differ at exactly one vertex. A graph is dd-degenerate if each of its non-empty subgraphs has a vertex of degree at most dd. The Cereceda (2007) conjecture states that, for fixed dd and k≥d+2k \ge d+2, the diameter of Rk(G)\mathcal{R}_{k}(G) is O(n2)O(n^2) for every dd-degenerate graph GG on nn vertices. For d=2d = 2, the conjecture was known to hold for k≥5k \ge 5 by a result of Cereceda; for k=4k = 4, the best bound known for all 22-degenerate graphs is O(n3)O(n^3), due to Bousquet and Heinrich. We prove that the diameter of R4(G)\mathcal{R}_{4}(G) is at most 2n(n+1)2n(n+1) for every bipartite 22-degenerate graph GG on nn vertices; hence the conjecture holds for these graphs. We also show that the order n2n^2 cannot be improved for this class, even for graphs of girth 66. For the upper bound, we fix an ordering of the vertices in which each vertex has at most two later neighbours. In nn stages, we transform any proper 44-colouring into the colouring in which every vertex has the least colour not used by its later neighbours, recolouring each vertex at most twice per stage. Both of our bounds have also been proved in the Lean proof assistant.

Author comments: An expanded version of this paper, with many other results, is posted on Zenodo: https://doi.org/10.5281/zenodo.23603237

A mix of human-written and AI-generated textHuman understanding: some partsCereceda conjecturebipartite graphsdegenerate graphsgraph recolouringreconfiguration
Nov 10, 202617 pages
PDFView work

math.HO — History and Overview

The Rising-Sea Theses: Twelve Theses on Mathematics and Machine Reasoning

Contributed by Vincent Liu

The Grothendieckian Programme is a set of seven works on machine reasoning about mathematics (34 volumes, 26,021 pages), released openly in October 2026 as first drafts that have not been peer-reviewed. This paper draws from them twelve theses on how mathematics and machine reasoning should be combined. Each thesis is stated in one sentence, argued, tied to the passages of the seven works on which it rests, related to existing work, and paired with an observation that would refute it. The theses concern the unit of mathematical knowledge for a reasoning system, the place of epistemic status, the latent space of mathematical reasoning, attention, failure, authority, and the method of discovery. The paper adds no mathematical result to the seven works; none of them claims a proof of the Riemann Hypothesis, the Birch and Swinnerton-Dyer conjecture, the Hodge conjecture, the abc conjecture or the Langlands correspondence.

Author comments: 26 pages, 5 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734424 (all versions: 10.5281/zenodo.23734423). This copy was typeset with pdfLaTeX for Hexagon: its text is identical to version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX, except that a broken cross-reference on page 3 ("igref{works}") is corrected to "Figure 1"; a few line and page breaks differ. The twelve theses are also set out at https://github.com/AlienMuse/grothendieckian-problems/blob/main/THESES.md; the seven works on which they rest, each with its DOI, are listed at https://github.com/AlienMuse/grothendieckian-programme. Corrections recorded since version 1.0 to the seven works and to the papers: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Grothendieckian Programme: An Overview (DOI 10.5281/zenodo.23734421) and The 57 Grothendieckian Problems (DOI 10.5281/zenodo.23734426).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian Programmedescentepistemic statusformal verificationmachine reasoningrecursive mathematical discovery
Nov 10, 202626 pages
PDFView work

math.CV — Complex Variables

Smale's mean value constant (1981) exceeds 1.1559

Contributed by Dave Goel

We prove that Smale's mean value constant exceeds 1.15598371.1559837, improving the bound 1.10181.1018 of Jatar and Ng. Smale proved in 1981 that for every complex polynomial PP of degree at least 22 and every point zz with P′(z)≠0P'(z)\neq0, some critical point ζ\zeta of PP satisfies ∣P(z)−P(ζ)∣≤K ∣z−ζ∣ ∣P′(z)∣|P(z)-P(\zeta)|\le K\,|z-\zeta|\,|P'(z)| with K=4K=4, and he conjectured that K=1K=1 suffices. The best constant K∗K^* is called Smale's mean value constant. Smale's conjecture is false: a proof that K∗>1K^*>1 appeared in 2026. Jatar and Ng showed that every pair (W,B)(W,B) of a normalized univalent map WW of the unit disk and a finite Blaschke product BB with B(0)>0B(0)>0, such that (WB)′(WB)' has no zero in the disk, gives K∗≥1/B(0)K^*\ge1/B(0). We construct such a pair explicitly, with BB of degree two, from a polynomial of degree 1818 with Gaussian rational coefficients, and we verify the required properties by a computation in exact arithmetic. Since the best constant K(d)K(d) for degree dd is nondecreasing in dd (Crane), K(d)K(d) also exceeds 1.15598371.1559837 for all large dd. All theorems, lemmas and corollaries of this paper, and the results of Jatar and Ng that it uses, are also proved in the Lean 4 proof assistant and checked with the Lean comparator.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 10, 20269 pages
PDFView work

math.NT — Number Theory

Spectral synthesis for the Báez–Duarte step space

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove that the closed Báez–Duarte subspace of the Mellin step space is exactly the common kernel of the derivative evaluations prescribed by the zeros of the Riemann zeta function in Re⁡s>1/2\operatorname{Re}s>1/2, with their multiplicities. No finiteness or sparsity assumption on this zero set is required. The proof combines a uniform fractional regularity estimate for Mellin transforms of step functions with a comparison obtained by reflecting zeros in a shifted vertical line. These estimates produce a holomorphic Hardy-space family whose membership in the Báez–Duarte subspace continues from large positive shifts to every sufficiently small positive shift. A uniformly bounded weak limit then gives the synthesis theorem.

Primarily AI-generated textHuman understanding: all partsBlaschke productBáez–Duarte criterionHardy spaceRiemann Zeta Functionspectral synthesis
Nov 10, 20269 pages
PDFView work

math.NT — Number Theory

Period relations as period terms: linear independence at CM and Beta periods

Contributed by Shawn Krisman

We prove linear independence results for periods of CM abelian varieties and Beta values by using a known relation between periods as the period term in the algebraic subgroup theorem. For example, 11, B(27,27)B(\frac27,\frac27), B(37,37)B(\frac37,\frac37) and B(37,37)/B(17,17)B(\frac37,\frac37)/B(\frac17,\frac17) are linearly independent over Q‾\overline{\mathbb{Q}}, and families of such relations attached to the CM types of Q(ζN)\mathbb{Q}(\zeta_N) give the linear independence of 11, a common ratio and κ≥2\kappa\ge2 periods. The same method proves Waldschmidt's Conjecture 42 at six classes of CM ratios (for instance, ℘(log⁡2/ϖ)\wp(\log 2/\varpi) and ℘(log⁡3/ϖ)\wp(\log 3/\varpi) are not both algebraic on the lemniscatic curve) and several four exponentials statements at CM periods. All results are explicit consequences of theorems of Waldschmidt and of Roy and Waldschmidt.

Primarily AI-generated textHuman understanding: no partsBeta valuesalgebraic subgroup theoremcomplex multiplicationelliptic functionsfour exponentials conjecturelinear independenceperiodstranscendence
Nov 10, 202630 pages
PDFView work

math.QA — Quantum Algebra

Prime factors of fusion-category dimensions: weak group-theoreticity, rank and decomposition

Contributed by Sebastian Burciu, Jingcheng Dong, Sebastien Palcoux

Let DD be the Frobenius–Perron dimension of a weakly integral fusion category and Q(D)Q(D) its square-full part. For a divisor-minimal braided obstruction to weak group-theoreticity, we bound the conductors of character fields by formal codegrees and relate residue blocks to primary twists through local Weyl operators. For primes p<q<r<sp<q<r<s these restrictions give weak group-theoreticity whenever Q(D)Q(D) divides p5qarbp^5q^ar^b or p3q3rasbp^3q^3r^as^b, with a,ba,b arbitrary. Fixing the cofactor of a prime power gives a finite test even when its exponent is unrestricted. A braided category is weakly group-theoretical for Q(D)<29 160 000Q(D)<29\,160\,000 and solvable for odd Q(D)<6 087 156 075Q(D)<6\,087\,156\,075. The corresponding bounds without a braiding are D<5400D<5400 and odd D<121 275D<121\,275. Combining the dimension families with an exhaustive degree search gives rank at least 3232 for a non-pointed simple integral modular category, at least 3333 in nonsquare dimension, 5757 in odd dimension and 7575 in odd nonsquare dimension. We also obtain rank bounds without simplicity and prime-divisor criteria for a braided product decomposition.

Author comments: Strengthened the general rank bound to 32, incorporating the optimized degree search with dimension-family pruning. Unified verification code and certificates through rank 31, refreshed the manuscript–GitHub links, and preserved the 252-page length.

Primarily AI-generated textHuman understanding: some partsFusion categoriesmodular categoriesweak group-theoreticity
Nov 10, 2026252 pages
PDFView work

math.NT — Number Theory

The rational points of the non-split Cartan modular curve of level 121

Contributed by Manvir Jaswal

We prove that the modular curve Xns+(121)X_{\mathrm{ns}}^{+}(121) of the normalizer of a non-split Cartan subgroup of level 121, of genus 511, has exactly seven rational points, all of them CM. This is the level 121 case of a conjecture of Rouse, Sutherland and Zureick-Brown, and with their theorem it determines the 11-adic images of Galois of non-CM elliptic curves over Q\mathbb{Q}. The Jacobian has rank equal to the genus. We work at the primes 17 and 43, at each of which one Hecke block of the Mordell–Weil group has logarithm divisible by p2p^2 while its pp-adic height has valuation exactly one. A comparison of valuations in the quadratic Chabauty identity then shows that the residue disc of each CM point holds no other rational point, with no computation of the local height at pp, no basis of the Mordell–Weil group and no model of the curve. The inputs come from expansions of differentials at CM points and from a formula we prove for intersection numbers of CM divisors under Hecke correspondences on Xns+(ℓe)X_{\mathrm{ns}}^{+}(\ell^e), at every prime v≠ℓv \ne \ell, and at v=ℓv = \ell when ℓ≥7\ell \ge 7, ℓ≡3 mod 4\ell \equiv 3 \bmod 4 and e≤2e \le 2.

Primarily AI-generated textHuman understanding: no partsElliptic CurvesGalois representationsMazur's Program Bmodular curvesnon-split Cartanp-adic heightsquadratic Chabautyrational points
Nov 10, 202640 pages
PDFView work

math.CO — Combinatorics

Critical edges in labelled complete graphs

Contributed by Dr. András Pongrácz

In a complete graph whose edges have labels 1,...,ell, an edge is critical for a matching if its label is smaller than that of a matching edge sharing an endpoint. The parameter gamma(ell) is the asymptotic worst-case, over labelings, of the smallest critical-edge count obtainable by choosing the matching, normalized by the number of pairs of covered vertices; gamma'(ell) is its perfect-matching version. These parameters arise in bounds for finding cliques in random graphs by edge queries in a prescribed number of rounds. We prove 0.419772820486... <= gamma'(4) <= gamma(4) <= 0.4334035. For every ell >= 2 we give an explicit construction proving gamma'(ell) >= 1/2-1/[4(ell-1)]. We also improve the state-of-the-art upper bounds for general ell, obtaining gamma(ell) <= 1/2-4/(5*2^ell) +O(2^(-3*ell/2)) as ell tends to infinity, together with explicit finite bounds. The proofs of upper bounds compare matchings obtained by local exchanges. The proofs of lower bounds use labelings that are constant on pairs of vertex parts; the stronger four-label construction has six parts and an algebraic value of degree six. Exact-arithmetic verification programs and their data are included for the computer-assisted parts of the proofs.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 10, 202662 pages
PDFView work

math.CO — Combinatorics

Shared triangular sides in pseudoline arrangements

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let dd be the number of edges incident to two bounded triangular faces in a finite affine arrangement of pseudolines, with each pair crossing exactly once and with only double and triple crossings. If t3t_3 is the number of triple crossings, we prove d≤3t3d\leq 3t_3, answering the compensation question of Parpalak and Utkin. The proof distributes charge along the normalized boundary of the union of triangular faces. A double crossing incident to four triangles is treated by restricting the arrangement to the four pseudolines supporting their opposite sides. This restriction provides two boundary edges whose unused endpoint charges pay for the crossing.

Primarily AI-generated textHuman understanding: no partsdischargingmultiple crossingspseudoline arrangementstriangular faces
Nov 10, 20264 pages
PDFView work

math-ph — Mathematical Physics

Holographic entropy inequalities without unscaled contraction proofs

Contributed by Antti Hippeläinen

We show that a valid holographic entropy inequality can lack a proof by contraction until all its coefficients are multiplied by a common integer, even when it is balanced, that is, every party has the same total coefficient on both sides, or superbalanced, that is, this remains true after any party is exchanged with the purifier. Every facet of the holographic entropy cone other than subadditivity is superbalanced. A proof by contraction is a map between Boolean cubes that respects the terms in which each party occurs and does not increase weighted Hamming distances. A balanced seven-party inequality and a superbalanced six-party inequality fail at a single point of the cube. Six of their right-hand side terms correspond to the edges of two disjoint triangles of parties, and at that point an unscaled map would have to choose three of these edges that together touch all six vertices, which is impossible. The seven-party one has a proof after doubling. Superbalanced eight- and seven-party inequalities have no unscaled proof even on their realizable domains, the subsets of the cube on which a map already proves validity, and they keep this property when instances of the monogamy of mutual information are subtracted in five successive steps. Splitting further into valid inequalities leads to a superbalanced facet F7F_7 of the seven-party cone that we did not find in the literature. It has unscaled maps on its realizable domain, all of which break its symmetry. For star inequalities, whose left-hand side contains only single-party entropies, the least scaling is the least kk for which an explicit polytope contains a point with coordinates in 1kZ\frac1k\mathbb{Z}. From the weighing matrices of Alon and V\~u we obtain valid NN-party star inequalities whose least scaling exceeds N(1/4−ε)NN^{(1/4-\varepsilon)N} for every ε>0\varepsilon>0 and large NN, while every finite least scaling of an NN-party star inequality is below NN/2N^{N/2}. Non-existence rests on DRAT proofs, validity on exact rational maps or identities, and the facet property on 126126 explicit graph models, except for the star inequalities of arbitrary size, whose results rest on written proofs.

Primarily AI-generated textHuman understanding: no partsRyu-Takayanagi formulabalancecontraction mapholographic entropy coneholographic entropy inequalityinteger scalingsuperbalance
Nov 10, 202637 pages
PDFView work

math.PR — Probability

Nonuniqueness of site percolation on nonamenable quasi-transitive graphs

Contributed by Yan Ru Pei

Benjamini and Schramm conjectured in 1996 that site percolation on every nonamenable quasi-transitive graph has pc<pup_c<p_u. We prove this in Hutchcroft's operator form: for Bernoulli site percolation on every connected, locally finite, nonamenable quasi-transitive graph, the critical two-point operator is bounded on ℓ2\ell^2, pc<p2→2≤pup_c<p_{2\to2}\le p_u, and in the standard monotone coupling infinitely many infinite clusters coexist at every parameter of a nondegenerate interval. Since bond percolation is site percolation on the line graph, this contains OpenAI's recent bond theorem. For unimodular automorphism groups we adapt OpenAI's proof: cut vertices replace bridges, a pruning lemma handles retained contact vertices, a rejection step controls the junctions created by opening a vertex, and pivotal corridors become induced paths. For nonunimodular groups we extend Tran and Nguyen's site argument from vertex-transitive to quasi-transitive graphs.

Author comments: 60 pages: main text pp. 1-28, appendices A-G. An earlier version is on Zenodo, doi:10.5281/zenodo.24023209; this version differs only in adding the companion paper's DOI to its bibliography entry. The proof uses three unrefereed inputs, listed in the introduction: OpenAI's manuscript on nonuniqueness of bond percolation (both cases), Section 5 of Tran and Nguyen, arXiv:2609.07026 (nonunimodular case), and the companion paper "Critical site percolation dies on (almost) every quasi-transitive graph", doi:10.5281/zenodo.24023188 (critical finiteness and the nonunimodular case).

A mix of human-written and AI-generated textHuman understanding: some partsBenjamini-Schramm conjecturenonamenable graphsnonuniquenessoperator normquasi-transitive graphssite percolation
Nov 10, 202660 pages
PDFView work

math.DS — Dynamical Systems

No arrivals: complete periodicity and degenerate orbits in rational right triangles

Contributed by Joshua Boorstein

Boshernitzan conjectured in 1992 that in a rational right or isosceles triangle every direction of an explicit finite set is purely periodic: every billiard orbit in it that avoids the vertices is periodic. For a right triangle with acute angle Pπ/2QP\pi/2Q in lowest terms the set is two classes of directions, each containing the perpendicular to a side, and the conjecture says that both are completely periodic. It fails at one known right triangle, (4/15,7/30,1/2)π(4/15, 7/30, 1/2)\pi. We prove it, when min⁡(P,Q−P)≥2\min(P, Q - P) \geq 2, whenever P+2P + 2 and P−2P - 2 are both prime to QQ, a set of density about 0.620.62, and whenever QQ has at most one odd prime factor, with a computer-assisted check of finitely many cases; and, through the fold, for the corresponding isosceles triangles. Everything turns on one object, an orbit from a vertex to a vertex that never strikes a side at a right angle: if there is none, both classes are completely periodic, and at odd PP the retracing band of a companion paper exists. Such an orbit satisfies an identity among roots of unity whose coefficients have signs fixed by the geometry, and Galois conjugation — or, at a single odd prime, a slowest-rotation argument — makes it impossible. When neither P+2P + 2 nor P−2P - 2 is a unit modulo QQ, no argument from these inputs can succeed, and the counterexample lies there. A second method reads the poles of a minimal component as a word of a binary code attached to QQ; it reaches further composite QQ and, with interval arithmetic, the triangles (4,Q−4,Q)(4, Q - 4, Q) at every Q≡3(mod4)Q \equiv 3 \pmod{4}. Beyond right triangles we prove, with computer assistance, that Boshernitzan's Conjecture 2.2(a) fails for infinitely many triangles.

Author comments: First version. Companion papers: "The orphan theorem" (hexagon:2611.00191) and "The necklace of a rational right triangle" (hexagon:2611.00213), whose results this paper imports; "Non-perpendicular periodic orbits in mirror directions of right triangles" in preparation. Code: https://doi.org/10.5281/zenodo.24037744

Primarily AI-generated textHuman understanding: some partsBoshernitzan conjectureGalois conjugationcomplete periodicitycyclic codesgeneralized diagonalshalf-translation surfacesisosceles trianglesrational billiardsright trianglesvanishing sums of roots of unity
Nov 10, 202694 pages
PDFView work

cs.CG — Computational Geometry

Propagation and Optimization of Low-Frequency Spectral Alignment in ReLU Networks on a Fixed Sample Graph

Contributed by Cameron Ryan

We study how low-frequency structure, measured with respect to the Laplacian of a fixed graph built on the training samples, propagates through a ReLU network to the least-squares readout gg, and how individual neurons h=SΦθh=S\Phi\theta can be optimized to capture low-frequency eigenvectors. The readout error splits into a low-frequency part controlled by coverage (how well the feature span contains the low eigenvectors) and a high-frequency part controlled by the smoothness (Dirichlet energy) of the target. We prove an error bound that makes this precise, with coverage measured by the coverage gap, the largest principal-angle sine between the low eigenvectors and the feature span, and show that coverage can always be preserved across ReLU layers. Finally, we define a count NKN_K of captured low-frequency features, relate it to our error bounds, and prove that error can be reduced to a smoothness component when NKN_K captures every low frequency feature. Lastly, we show that a ReLU layer can strictly increase NKN_K whenever the previous layer keeps the samples distinct and coverage is not yet full, that 2K+22K+2 neurons suffice to preserve coverage, that greedily chosen neurons drive the coverage gap down at rate O(1/t)O(1/t) governed by a ReLU variation norm of the low eigenvectors, and that tt neurons can reduce the coverage gap no further than the (t+1)(t+1)-st principal-angle sine.

Primarily AI-generated textHuman understanding: some parts
Nov 10, 20269 pages
PDFView work

math.CO — Combinatorics

R(12,12) ≥ 1661 by extending the Mathon–Shearer coloring

Contributed by Yue Ma

We prove that R(12,12)≥1661R(12,12)\ge 1661 by constructing a red/blue coloring of the edges of K1660K_{1660} with no monochromatic K12K_{12}. We start from a classical (11,11)(11,11)-coloring on 1596 vertices, delete 21 of its vertices and add 85 new ones. Toward the remaining 1575 vertices, each new vertex has either the same colors as one of the deleted vertices or a single color. The deleted vertices include two pairs whose members have complementary colors toward every other vertex, and these pairs weaken the conditions that the new vertices must satisfy. The proof reduces to a finite check on the new vertices and is formally verified in Lean 4.

Author comments: 11 pages. The coloring, the check programs, the outputs of two exhaustive searches and the Lean 4 proof are at https://github.com/YueMa0/r1212-1661, archived as version 1.0.1 at https://doi.org/10.5281/zenodo.24087657.

Primarily AI-generated textHuman understanding: some partsLean 4Mathon–Shearer coloringRamsey numbersantipodal pairscomputer-assisted prooflower bounds
Nov 10, 202611 pages
PDFView work

math.NT — Number Theory

Second moments of pattern counts in dual Melas codewords

Contributed by David Niedbala Giraudin

Let α\alpha be a primitive element of F2k\mathbb{F}_{2^k} and, for c∈F2k∗c\in\mathbb{F}_{2^k}^*, let Sc=(Tr(αi+cα−i))0≤i≤2k−2S_c=(\mathrm{Tr}(\alpha^i+c\alpha^{-i}))_{0\le i\le 2^k-2} be the corresponding codeword of the dual Melas code. Let Xk,c(w)X_{k,c}(w) be the number of occurrences of a uniformly random pattern w∈F2kw\in\mathbb{F}_2^k in ScS_c. Sac Himelfarb and Schwartz conjectured that Xk,ckX_{k,c_k} converges to the Poisson law P(1)\mathcal P(1) for every choice of ck∈F2k∗c_k\in\mathbb{F}_{2^k}^*; they proved that the second factorial moment satisfies lim sup⁡M2≤2\limsup M_2\le 2, and M2→1M_2\to1 for almost every sequence (ck)(c_k). We prove that ∣M2(k,c)−1∣≤2−(1/22+o(1))k|M_2^{(k,c)}-1|\le 2^{-(1/22+o(1))k} uniformly in c∈F2k∗c\in\mathbb{F}_{2^k}^* and in the primitive element α\alpha. Thus the second factorial moment converges to 11 for every sequence (ck)(c_k). The proof expresses M2M_2 through a norm form of the quadratic extension F2(x)/F2(x+x−1)\mathbb{F}_2(x)/\mathbb{F}_2(x+x^{-1}), which turns it into a bilinear Kloosterman sum of full length, and bounds the latter in characteristic two. We also show that the counts Nw(Sc)N_w(S_c), as functions of (w,c)(w,c), are the fibre sizes of a family of quadratic maps, and deduce that for almost every sequence of patterns wkw_k the first two factorial moments of c↦Nwk(Sc)c\mapsto N_{w_k}(S_c) converge to 11, as they would under the Poisson law conjectured by Sac Himelfarb and Schwartz for fixed patterns.

Author comments: 7 pages. Proves, uniformly in c, the second-moment case of Conjecture 35 of Sac Himelfarb-Schwartz (arXiv:2610.38017), and the first two moments of their fixed-pattern conjecture for almost every pattern. Ancillary verifier VERIF_MELAS_M2.py (pure Python).

Primarily AI-generated textHuman understanding: no partsKloosterman sumsLFSR sequencesPoisson randomnessdual Melas codesfunction fields
Nov 10, 20267 pages
PDFView work

math.DG — Differential Geometry

Seven Research Directions in Differential Geometry and Differential Topology Enabled by AI

Contributed by Jianqiao Shang

This article presents seven AI-generated research directions in differential geometry and differential topology, each centered on a proposed research object or formulation. For each direction, we provide basic definitions and theorems, discuss connections with existing mathematical problems and theories, and outline questions for further study. The definitions introduced in these seven directions are relatively new. The article is intended as a collection of AI-generated research guides rather than a conventional research paper.

Primarily AI-generated textHuman understanding: all parts
Nov 10, 202656 pages
PDFView work

cs.CC — Computational Complexity

Non-computable derivatives of the fractional-part autocorrelation

Contributed by Michael Yampolsky

We describe a natural new example of non-computability in analysis. Namely, the multiplicative autocorrelation of the fractional-part function, \[ A(x)=\int_0^\infty \{t\}\{xt\}\,\frac{dt}{t^2}, \] is computable and differentiable almost everywhere, but its finite derivative can be non-computable even for a computable xx. We derive these results from an adaptation of our earlier work on computability of Brjuno-like functions.

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 10, 202611 pages
PDFView work

math.CO — Combinatorics

Autocorrelation Phase Lattices on Cyclic Groups: Unit Supports, 2pq Orbit Profiles, and Binary Reconstruction

Contributed by Oleksiy Babanskyy

For a finite cyclic group and an exact Fourier support SS, we study the lattice L≤d(S)\mathcal{L}_{\le d}(S) generated by zero-sum relations of length at most dd inside the full relation lattice K(S)K(S). Its closing degree is both a local separating degree and the order at which every invisible phase ratio becomes a translation character. For the exact unit support of every even cyclic group, we compute $$ \mathbb{Z}^{U_{n}}/\mathcal{L}_{\le4}(U_{n})\cong \begin{cases} \mathbb{Z}/n\mathbb{Z},&3\nmid n,\\ \mathbb{Z}\oplus\mathbb{Z}/(n/6)\mathbb{Z},&6\mid n. \end{cases} $$ Moreover L≤5(Un)=L≤4(Un)\mathcal{L}_{\le5}(U_{n})=\mathcal{L}_{\le4}(U_{n}). Thus fourth- and fifth-order rational ambiguity coincide: fourth order reconstructs up to translation when 3∤n3\nmid n, while for n=6mn=6m the complete surviving family has normalized ratios parameterized by norm-one elements of Q(ζ6)\mathbb{Q}(\zeta_6), modulo the residual translation subgroup μ6\mu_6; order six closes it. For n=2pqn=2pq with distinct odd primes, we classify every nonempty Aut⁡(Cn)\operatorname{Aut}(C_n)-stable support. The distributions of these 255 supports by closing degree are $$ (1,2,154,80,4,14)\quad(p=3),\qquad (1,2,154,92,4,2)\quad(p,q\ge5). $$ The proof uses seven local CRT presentations, cubic and quartic Skeletons, and explicit depth-five and depth-six obstructions. Galois-equivariant lower-bound ratios show that the lattice, rational-signal and integer-signal closing degrees coincide on every stable support. Finally, for binary indicators, a supportwise crosswalk and a uniform exclusion of all deep supports give rset(C2pq)=4r_{\rm set}(C_{2pq})=4 under translations. The value is also four for the same oriented analytical deck when outputs are identified up to translation or reflected translation.

Author comments: Mathematics unchanged from aiXiv 2609.03274 v1. This version adds an explicit AI-assistance statement and a CC BY 4.0 notice. Companion and reproducibility instructions: https://github.com/aconsciousfractal/FCIG-Autocorrelation-Phase-Lattices-on-Cyclic-Groups/tree/74a839355ba9ffd96a73fea8aadceabea3f9e57b

Primarily AI-generated textHuman understanding: no partsGalois descentPhase retrievalfinite cyclic groupshigher-order autocorrelationset reconstructionzero-sum lattices
Nov 10, 202649 pages
PDFView work

math.CO — Combinatorics

A Parity Theorem for Reverse-Complement-Invariant Minimum Decycling Sets in q-ary de Bruijn Graphs

Contributed by Oleksiy Babanskyy

Let A\mathcal{A} be a finite alphabet with a fixed-point-free involutive complement, and let reverse complement act on the directed de Bruijn graph B(q,k)B(q,k) by reversing a word and complementing every letter. We prove that a reverse-complement-invariant ordinary minimum decycling set exists if and only if kk is even, for every integer k≥2k\geq2. This simultaneously covers the binary alphabet and the DNA alphabet with A↔TA\leftrightarrow T and C↔GC\leftrightarrow G. For odd kk, a primitive rotation cycle joins two reverse-complement-fixed lower states in opposite directions. Disjoint complementary alphabet pairs force at least qq deletions beyond the ordinary minimum. For even kk, choose injective antisymmetric real weights on the alphabet and form a weighted cyclotomic selector. We prove that arbitrary representatives on its zero-embedding rotation cycles preserve acyclicity, resolve those ties equivariantly, and establish the exact defect identity 1RC⁡(M)−1M=∇χ. \mathbf{1}_{\operatorname{RC}(M)}-\mathbf{1}_M=\nabla\chi . A finite sequence of legal full-alphabet source firings removes this nonnegative symmetric defect two coordinates at a time. We also identify a self-dual spectral ideal that gives a deterministic direct selector, rather than a simulated firing path. For integer weights, membership is decidable with polynomial bit complexity. The executable finite panel in the repository checks the binary specialization only; it is convention-level assurance and is not used in the all-order proof.

Author comments: 15 pages. Companion code and exact binary checks: https://github.com/aconsciousfractal/FCIG-RC-Invariant-Minimum-Decycling-Sets

Primarily AI-generated textHuman understanding: no partscyclotomic constructionde Bruijn graphsdecycling setsparity theoremreverse complement
Nov 10, 202615 pages
PDFView work

math.QA — Quantum Algebra

Another proof of Laurent positivity for skew-symmetric quantum cluster algebras

Contributed by Qiyue Tang

We give another proof of Laurent positivity for skew-symmetric quantum cluster algebras.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 10, 202635 pages
PDFView work

math.AC — Commutative Algebra

Another Proof of Laurent Positivity for Generalized Cluster Algebras

Contributed by Qiyue Tang

We prove Laurent positivity in the original exchange coefficients for skew-symmetrizable Chekhov–Shapiro generalized cluster algebras of arbitrary finite rank.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 10, 202641 pages
PDFView work

math.HO — History and Overview

The Grothendieckian Programme: An Overview — Seven Open Works on Mathematics and Machine Reasoning

Contributed by Vincent Liu

The Grothendieckian Programme is a series of seven works on machine reasoning about mathematics (34 volumes, 26,021 pages), released openly on Zenodo in October 2026 with an overview volume. Two of the works specify a reasoning architecture — a core that holds mathematical worlds as typed, versioned and verifiable objects, and a kernel that reasons inside such worlds by sites, sheaves and descent. Five apply one method, recursive mathematical discovery, to the Riemann Hypothesis, the conjecture of Birch and Swinnerton-Dyer, the Hodge conjecture, the abc conjecture and the Langlands programme, and record what it proves, what it reduces to stated hypotheses and what it leaves open. This paper describes the architecture, the five research subjects, the method, the published corpus and the open process by which the works are to be reviewed and continued. None of the works claims a proof of any of these conjectures; they are first drafts and have not been peer-reviewed.

Author comments: 10 pages, 3 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734422 (all versions: 10.5281/zenodo.23734421). This copy was typeset with pdfLaTeX for Hexagon: its text, and its line and page breaks, are the same as in version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX. The seven works it describes, each with its DOI, are listed at https://github.com/AlienMuse/grothendieckian-programme. Corrections recorded since version 1.0 to the seven works and to the papers: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Rising-Sea Theses (DOI 10.5281/zenodo.23734423) and The 57 Grothendieckian Problems (DOI 10.5281/zenodo.23734426).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian Programmedescentmachine reasoningmathematical worldsopen sciencerecursive mathematical discovery
Nov 10, 202610 pages
PDFView work

math.CO — Combinatorics

Sharp thresholds for five-colour cube assemblies

Contributed by Jason Davies

We determine the least pool sizes guaranteeing a frame or a complete a×b×ca\times b\times c box from unit cubes whose faces use all five colours of a fixed palette, for every a,b,c≥2a,b,c\ge2. Proper rotations are allowed; the target has monochromatic exterior faces using all five colours. The frame threshold is max⁡{15,4(a+b+c)−16,2(a+b+c)+1}\max\{15,4(a+b+c)-16,2(a+b+c)+1\}, and the complete-box threshold is max⁡{abc,15,2(a+b+c)+1}\max\{abc,15,2(a+b+c)+1\}. The proof combines a certified fifteen-cube corner theorem with elementary Hall arguments and a uniform three-variety obstruction. It completes the five-colour frame column left open by Berkove, Eickemeyer and Schulman (2018). All threshold statements are formalised in Lean. A fixed-size flow formulation decides feasibility and constructs assemblies in time linear in the explicit source list. We also determine the corner thresholds when the number of source varieties is bounded, and classify all fourteen-cube obstructions into 56 classes under common colour relabelling and simultaneous reflection, described by three structural forms. The minimum size of a collection capable of reproducing every 2×2×22\times2\times2 target is also fifteen.

Primarily AI-generated textHuman understanding: some partsHall's theoremLean formalisationMacMahon puzzlescoloured cubescomputer-assisted proofextremal combinatoricsinterval certificates
Nov 10, 202634 pages
PDFView work

cs.FL — Formal Languages and Automata Theory

Decomposable disjoint-union circuits for primitive words

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

For every fixed finite alphabet AA with at least two letters, we construct smooth decomposable circuits representing the primitive words of each length nn. The gates are literals, Cartesian products on disjoint position sets, and disjoint unions on equal position sets. The total number of gates and wires is OA(n25ω(n))=n2+o(1)O_A(n^2 5^{\omega(n)})=n^{2+o(1)}, and the construction takes n2+o(1)n^{2+o(1)} bit operations. Prime periods are expressed as coordinate directions of independent rectangular grids. A recursion at the first nonconstant vertex computes the exact set of failed directions; sharing its continuations gives the size bound. This resolves the primitive-word instance of the circuit question posed by Amarilli, Monet, Raphael, and Salvati. It does not determine whether primitive words form a context-free or a poly-slicewise-unambiguous language. The same circuit bound holds for any union of exact power orders at a fixed length.

Author comments: First version. Addresses the complement-free primitive-word circuit question in STACS 2026, Section 6. The main circuit-size theorem has a locally compiled Lean proof; the running-time and optional exact-order claims are separate from that formal verification. Independent mathematical review and priority have not been established.

Primarily AI-generated textHuman understanding: all partsdecomposable circuitsdisjoint unionsformal verificationprimitive words
Nov 10, 20267 pages
PDFView work

math.NT — Number Theory

Torsion of elliptic curves over number fields of degree 1010

Contributed by Filip Najman

We determine all the groups that appear as the torsion group of an elliptic curve over a number field of degree 1010. There are 6969 such groups. For 44 of them, namely Z/2Z×Z/26Z\mathbb{Z}/2\mathbb{Z}\times\mathbb{Z}/26\mathbb{Z}, Z/3Z×Z/15Z\mathbb{Z}/3\mathbb{Z}\times\mathbb{Z}/15\mathbb{Z}, Z/3Z×Z/18Z\mathbb{Z}/3\mathbb{Z}\times\mathbb{Z}/18\mathbb{Z} and Z/6Z×Z/12Z\mathbb{Z}/6\mathbb{Z}\times\mathbb{Z}/12\mathbb{Z}, we also determine all the elliptic curves over number fields of degree 1010 that realize them, and there are only finitely many. These four groups were not known to occur over number fields of degree 1010. The proofs combine the global method of Derickx, Hecke sieves, formal immersion criteria at the prime 22, and Riemann-Roch computations on modular curves and their quotients over finite fields.

Author comments: Code: https://github.com/F-Najman/deg10_torsion (large data files in its release large-files-2026-11).

Primarily AI-generated textHuman understanding: some partsElliptic CurvesNumber fieldsmodular curvessporadic pointstorsion
Nov 10, 2026124 pages
PDFView work

math.CO — Combinatorics

A proof of a conjecture of Cazenave on graph eigenvalues

Contributed by Alexander Kramer

We prove Cazenave's conjecture μ22≥4λ2+1\mu_2^2\ge4\lambda_2+1 for connected graphs, where λ2\lambda_2 and μ2\mu_2 are the second largest adjacency and Laplacian eigenvalues. We also characterize equality in this inequality and in the linear bound μ2≥λ2+1\mu_2\ge\lambda_2+1.

Primarily AI-generated textHuman understanding: some partsLaplacian eigenvaluesadjacency eigenvaluesspectral graph theory
Nov 10, 20262 pages
PDFView work

math.NT — Number Theory

Rational points on the non-split Cartan modular curve of level 121121

Contributed by Santiago Arango-Piñeros, Filip Najman, David Zureick-Brown

We show that the modular curve Xns+(121)X_{\mathrm{ns}}^+(121), attached to the normalizer of a non-split Cartan subgroup of GL2(Z/121Z)\mathrm{GL}_2(\mathbb{Z}/121\mathbb{Z}), has exactly 77 rational points, all of them CM points. Together with the work of Rouse, Sutherland and Zureick-Brown, this completes the classification of the possible 1111-adic images of Galois of elliptic curves over Q\mathbb{Q} without complex multiplication. We do not use a model of Xns+(121)X_{\mathrm{ns}}^+(121), which has genus 511511. Instead we use the map Xns+(121)→Xns+(11)X_{\mathrm{ns}}^+(121)\rightarrow X_{\mathrm{ns}}^+(11), whose target is an elliptic curve of rank 11, a descent with the cusps of Xns+(11)X_{\mathrm{ns}}^+(11) and a Mordell-Weil sieve to reduce the problem to 77 hyperelliptic curves of genus 55 over a number field of degree 1515. We deal with these curves by a version of Stoll's Selmer group Chabauty method for the isogeny 1−ζ111-\zeta_{11} of their Jacobians.

Author comments: 19 pages. Code, logs and certificates: https://github.com/F-Najman/Xns-121-

Primarily AI-generated textHuman understanding: some partsChabauty methodGalois representationsSelmer groupsmodular curvesnon-split Cartan subgroups
Nov 10, 202619 pages
PDFView work