{ "counts": { "adjacent": 16, "core": 2, "errors": 0, "negative": 71, "total": 89 }, "date": "2026-09-16", "errors": [], "fresh_content_days": 21, "generated_at": "2026-09-16T19:01:46Z", "items": [ { "age_days": 1, "arxiv_id": "2609.16991", "authors": [ "Xin Quan", "Reto Gubelmann", "André Freitas" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.16991", "kind": "paper", "label": "core", "matched_signals": [ "autoformalization", "verifier_guided_reasoning" ], "published": "2026-09-15", "score": 9.5, "source": "arxiv-ai4math-core", "summary": "Natural language arguments are compelling before they are formally explicit. A premise supports a claim through defeasible warrants, background commitments, and exception conditions that the text leaves implicit. However, formal verification requires the opposite. Making such arguments machine-checkable requires constructing the missing commitments, not only translating given sentences into logic. Construction, however, carries a risk that translation does not: a system free to add premises can make any claim provable, and a formally valid proof may assert the claim outright, prove it without the original premise, or establish more than the claim itself. We address this problem by formulating autoformalization for argumentative material inference as guard completion, in which non-monotonic material support is turned into monotonic formal inference relative to an explicitly constructed guard set. A completion is accepted only when its proof both passes the theorem prover and survives contrastive tests of premise dependence and claim selectivity. We implement this formulation in GUARD, a neuro-symbolic framework in which LLMs construct and formalize candidate guards, Isabelle/HOL verifies the resulting theories and returns step-level feedback for iterative refinement, and the system abstains when no faithful completion can be reached. Our empirical results on Debatepedia and ARCT using different LLMs demonstrate that GUARD yields significant improvements in verified-faithful (+35.3, +32.9 points) and substantial reductions in leakage (-25.9, -21.9 points) over the state-of-the-art LLM-driven theorem proving approach. Moreover, we show that the symbolic soft critique and the explicit assumption layer account for most of these gains, with the soft critique also improving the initial validity of the elicited context and reducing the number of iterations required for successful verification.", "title": "Autoformalizing Argumentative Material Inferences", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.16991" }, { "age_days": 3, "arxiv_id": "2609.14808", "authors": [ "Andre Panossian" ], "content_date": "2026-09-13", "freshness": "fresh", "id": "arxiv:2609.14808", "kind": "paper", "label": "core", "matched_signals": [ "autoformalization", "verifier_guided_reasoning" ], "published": "2026-09-13", "score": 6.5, "source": "arxiv-ai4math-core", "summary": "Scientific autoformalization turns verbal accounts into executable mathematics, but executable code does not settle which model has been constructed. We examine two sources of structural uncertainty: the formalizer that generates a response law, and the recurrence that turns that law into trajectories. In secondary analyses of an openly archived crossed experiment, we studied 320 response maps generated by two pinned language-model formalizers from five engineered cognitive accounts within one sparse quadratic grammar and 16 randomized blocks. With whole blocks held out, source-account identity was recovered at 78.8% accuracy (chance 20.0%) and formalizer identity at 96.3% (chance 50.0%; both p < 0.001). Program size was the stronger single feature family; a pre-specified exploratory comparison found no stable source-account predictive gain from local geometry beyond size. Holding every response map fixed, we then evaluated five recurrence families spanning 33 configurations and 1,013,760 finite-horizon trajectories. Added feedback, projection and leak produced sharply different outcome distributions. The consequential distinction was which comparisons survived: median cross-recurrence rank concordance was 0.73 for endpoint magnitude but 0.05 for settling, among the configuration pairs with defined rankings. Thus a common mathematical language did not erase translation provenance, and robust ordering under one observable did not transfer to another. Scientific autoformalization is usefully studied as model-space construction: the generated ensemble and its dynamical embedding are both part of the specification supporting a scientific claim.", "title": "Transformed in Translation: Two-Stage Structural Uncertainty in LLM-Based Scientific Autoformalization", "updated": "2026-09-13", "url": "https://arxiv.org/abs/2609.14808" }, { "age_days": 3, "arxiv_id": "2609.14351", "authors": [ "Yinjie Li" ], "content_date": "2026-09-13", "freshness": "fresh", "id": "arxiv:2609.14351", "kind": "paper", "label": "adjacent", "matched_signals": [ "general_ai_math_reasoning", "lean_formal_proving_agents" ], "published": "2026-09-13", "score": 4.9, "source": "arxiv-ai4math-core", "summary": "We prove the Colomo-Pronko conjecture for alternating sign matrices with a prescribed square of zeros at a corner, for all matrix sizes and freezing parameters. A known multiple-integral formula for the frozen-corner count yields determinant representations built from fixed polynomial kernels. We relate these kernels to the conjectured determinant through an inverse identity for the commutator of a signed Pascal matrix with reversal. In odd dimension, the comparison uses the one-dimensional nullspace and projection along it to eliminate the central coordinate. Combined with the asymptotic analysis of Colomo and Pronko, our result removes the conjectural assumption from their GUE Tracy-Widom fluctuation theorem for the intersection of the frozen boundary with the main diagonal in uniformly random alternating sign matrices. The finite-dimensional algebraic core of the proof has been formalized in Lean 4.", "title": "The Colomo-Pronko conjecture for frozen-corner alternating sign matrices", "updated": "2026-09-13", "url": "https://arxiv.org/abs/2609.14351" }, { "age_days": 4, "arxiv_id": "2609.14188", "authors": [ "Romain Popescu" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.14188", "kind": "paper", "label": "adjacent", "matched_signals": [ "general_ai_math_reasoning", "lean_formal_proving_agents" ], "published": "2026-09-12", "score": 4.9, "source": "arxiv-ai4math-core", "summary": "Let $s(m)$ be the Conway subprime function define the binary operation on the natural numbers $x \\circ y= s(x + y)$, and denote by $C_n$, $n \\ge 0$, the sequence of subsets of natural numbers defined by $C_0 = \\{1\\}$, and $C_{n+1} = C_n \\cup (C_n \\circ C_n)$. We prove the conjecture by Caragiu, Vicol and Zaki that $$\\lim_{n\\to \\infty} \\frac{ | C_{n+1}| }{ | C_n |}= \\frac{1+\\sqrt{5}}{2}.$$ The underlying mathematical proof in this paper was constructed with some algorithmic assistance from GPT-6 Astra and its correctness has been formally verified using the Lean 4 proof assistant.", "title": "Golden-ratio growth of Conway's subprime closure", "updated": "2026-09-12", "url": "https://arxiv.org/abs/2609.14188" }, { "age_days": 1, "arxiv_id": "2609.17027", "authors": [ "Junjie Liao" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.17027", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-15", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "Let $F=F(X)$ be a free group of finite rank, with palindromic length taken with respect to the fixed basis $X$. We embed $F$ as the index-two subgroup of the universal Coxeter group $W=F\\rtimes_θ\\langle t\\mid t^2=1\\rangle$, where $θ(x)=x^{-1}$ for $x\\in X$, and prove $\\mathrm{pl}(g)=\\min{\\ell_T(g),\\ell_T(gt)}$. Dyer's deletion theorem then identifies reflection length with the minimum number of unmatched positions in a noncrossing equal-label partial matching on a reduced Coxeter word. This gives an $O(n^3)$-time, $O(n^2)$-space algorithm for palindromic length, together with recovery of an optimal palindromic factorization. The matching model also gives a structural characterization. For every ordered full binary tree with $k$ leaves we define a literal word template whose leaves are palindromes and whose internal vertices carry arbitrary words. A reduced word $w$ represents an element of palindromic length at most $k$ if and only if $w$ is a literal instance of one of these templates. Hence the $C_{k-1}$ ordered binary-tree shapes give a complete finite family for each fixed $k$. For $k=4$ the five templates are exactly the five forms proposed by Frid, proving the completeness of that list. A companion Lean 4 development verifies the four-palindrome classification end to end for every finite rank, including the ordinary reduced-word formulation and the literal five-form conclusion.", "title": "Palindromic Length in Free Groups: Reflections, Noncrossing Matchings, and Catalan Forms", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.17027" }, { "age_days": 1, "arxiv_id": "2609.17283", "authors": [ "Antonio Acuaviva" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.17283", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-15", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "We construct two complemented subspaces of $L_1[0,1]$. The first has the Schur property but fails the Radon--Nikodým property. The second contains a copy of $\\ell_2$ but no copy of $L_1[0,1]$. Neither space is isomorphic to a Banach lattice. This gives a negative answer to the complemented-subspace question of Lindenstrauss and Rosenthal. A Lean 4 formalisation of the main results accompanies the paper.", "title": "On complemented subspaces of $L_1[0,1]$", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.17283" }, { "age_days": 1, "arxiv_id": "2609.16801", "authors": [ "Jacob Bedrossian" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.16801", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-15", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "We present a formalization in Lean 4 of Mouhot and Villani's theorem on nonlinear Landau damping in $\\mathbb T^d$ in all Gevrey regularity indices $s > 1/3$ for small backgrounds.", "title": "Formalization of Landau damping in the Vlasov--Poisson equations in Lean", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.16801" }, { "age_days": 1, "arxiv_id": "2609.16485", "authors": [ "Alex Borisevich" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.16485", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-15", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "We develop a certified continuation framework for equilibrium computation and for training deep equilibrium networks (DEQs), with training formulated as interpolation to accuracy $2^{-b}$. For inference, compact input homotopy selects a unique branch from a supplied start root, and a rounded Newton tracker follows it under certified boundary, conditioning, derivative, and tube-radius bounds. For training, we augment local-plus-low-rank recurrence with programmable dormant bilinear rank-one channels. Loaded Tikhonov solves diagnose a failed interpolation pass without spectral decomposition; an output-preserving repair aligned with the pass residual supplies the required direction. Training requires certified gate realization and column stability on each pass region, well-posed inference, and finite-update error budgets. With polynomial geometric, encoding, precision, and complete backend budgets, both certified inference and training have bit cost $O(\\operatorname{poly}(L+b))$, where $L$ is the encoded instance length. The trainer uses $O(b+\\ell)$ passes and reserve channels from an initial residual bounded by $2^\\ell$. These guarantees concern a certified promise class. Lean 4 verifies the quantitative core and concrete inference backend; numerical comparisons illustrate the loaded mechanism.", "title": "Certified Inference and Training for Deep Equilibrium Networks: A Continuation Framework with Polynomial Complexity Guarantees", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.16485" }, { "age_days": 2, "arxiv_id": "2609.15642", "authors": [ "Henning Ulfarsson" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.15642", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-14", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "We give an exact algorithm counting the permutations that avoid a fixed pattern from the following family: the direct sum of an increasing pattern and the pattern 231. The first members of the family are 1342 and 12453. For each member, the algorithm computes the number of avoiding permutations of every length up to a given bound using polynomially many arithmetic operations and polynomially many stored integers, with degrees that grow linearly in the length of the pattern. We first obtain an exact recurrence by reading a permutation from left to right and recording, at each step, the constraints that the letters read so far impose on those still unread. Its state space grows exponentially, so evaluating it directly takes exponential time. We then show that part of the state is protected: later steps carry it along unchanged and do not depend on it. Factoring the protected part out turns the recurrence into a dynamic program with polynomially many stored transfer entries, and this gives the polynomial bounds for every member of the family. For the pattern 12453, a translation symmetry sharpens the bounds to degree seven for the operations and degree four for the storage. Separately written implementations and exact Chinese-remainder certification determine the number of 12453-avoiding permutations of every length up to 150. The previously published series reached length 38. The same tables also generate uniformly random avoiders in polynomial time. We illustrate this with a heatmap of one million 12453-avoiding permutations of length 300 sampled with floating-point tables. The counting recurrences for 1342 and 12453 are verified in the Lean 4 proof assistant.", "title": "Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.15642" }, { "age_days": 2, "arxiv_id": "2609.14879", "authors": [ "Aaron Gregory" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.14879", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-14", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "A stencil computation repeatedly updates every cell of a grid from its neighbours' values at the previous timestep. Simulating T steps on N cells directly costs Theta(NT), and a line of work beginning with Ahmad et al. reduces this by composing many timesteps into one linear operator and applying it with a Fast Fourier Transform. That technique needs to know which cells will still obey the same operator when the composed step ends, and in a free-boundary problem they do not: the region governed by a given rule is determined by the solution and moves as it evolves. We study one spatial dimension, a three-point stencil with time-varying coefficients, and a computed region that is a single interval whose two endpoints move by arbitrary amounts at every step, revealed online. Let B be the horizon plus the total variation of the boundary trajectory. We give a schedule whose work is O((B+N) log T log(N+B)) and whose span is O(T log T log(N+B)), and we prove that the values it computes are exact. The best existing bound for a region that moves requires its boundary to travel at most one cell per timestep. We drop that requirement and lose nothing by it: a boundary obeying it has B <= 3T, so our bound stays near-linear on every trajectory the earlier result covers. Elsewhere, B grows only by the distance the boundary actually travels -- one jump of width N costs T + 2N. The reason total variation suffices is that everything the two endpoints touch over a time window of any length lies in two intervals, one per endpoint. This cannot be relaxed: with p regions the bound degrades by a factor p, and at p = sqrt(T) there is an instance on which the work is Theta(T^{3/2}) while B + N = Theta(T). All results are machine-checked in Lean 4, apart from the classical convolution bound, which is imported as an interface.", "title": "Fast Stencil Computations on a Single Arbitrarily Moving Interval", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.14879" }, { "age_days": 2, "arxiv_id": "2609.14912", "authors": [ "Celio Boulay", "Alexander Chai", "Anthony Chang", "Thomas Moulin" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.14912", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-14", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "The mathematics of Origami have been well studied and shown to develop several interesting results. We use Lean 4 tactics and build on Mathlib to redefine the 7 Huzita operations as theorems instead of axioms and prove their existence. We develop proofs for important origami constructions (such as trisecting an angle), implement origami-constructible numbers and prove the associated Cardano's formula, and formalize Haga's theorem. A Crease Pattern Inspector explores physical folding by providing a full pipeline to create and visualize models constrained by the Huzita formalism. The Lean codebase brings 100+ theorems and lemmas.", "title": "A Lean Paper About Paper: A Formal Framework for Origami", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.14912" }, { "age_days": 4, "arxiv_id": "2609.14102", "authors": [ "Lars Warren Ericson" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.14102", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-12", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "For a finite set $S$ with $\\lvert S\\rvert = N$, the number of families $\\mathcal{B} \\subseteq \\mathcal{P}(S)$ that are topological bases is $\\#(N) = \\sum_{\\mathcal{T} \\in \\operatorname{Top}(S)} 2^{\\lvert\\mathcal{T}\\rvert - \\lvert\\mathcal{M}_{\\mathcal{T}}\\rvert}$, where $\\mathcal{M}_{\\mathcal{T}}$ is the canonical minimal basis of minimal open neighborhoods. The identity is proved in Lean 4 / Mathlib (`CARDB.lean`): bases generating $\\mathcal{T}$ are exactly the sets with $\\mathcal{M}_{\\mathcal{T}} \\subseteq \\mathcal{B} \\subseteq \\mathcal{T}$. The small-$N$ table and the discrete-dominance sandwich are proved in `CARDB/SmallN.lean` and `CARDB/Asymptotics.lean`.", "title": "On the Number of Distinct Topological Bases of a Finite Set of Size $N$", "updated": "2026-09-12", "url": "https://arxiv.org/abs/2609.14102" }, { "age_days": 4, "arxiv_id": "2609.13780", "authors": [ "Shogo Saitou", "Mashu Noguchi" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.13780", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-12", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "We mechanized proof of Gödel's first and second incompleteness theorems, Solovay's arithmetical completeness theorem of \\mathbf{GL}, and related results in the Lean 4 theorem prover.", "title": "Mechanizing Gödel's Incompleteness Theorems and Provability Logic", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.13780" }, { "age_days": 4, "arxiv_id": "2609.13703", "authors": [ "Jiarui Yao", "Jiaxi Zhao", "Xiangxin Zhou" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.13703", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-12", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "In the best-arm identification problem, we are given $n$ stochastic arms with unknown means and wish to identify the arm with the largest mean with probability at least $1-δ$, using as few samples as possible. We consider independent Gaussian rewards with unit variance and means in $[0,1]$. Chen and Li [2016] conjectured that the instance-wise sample complexity of this problem is characterized by the gap entropy, up to an additive term arising from the two-arm problem. In this paper, we resolve their gap-entropy and almost instance-wise optimality conjectures. For an instance $I$, let $Δ_{[i]}$ be the gap between the largest and the $i$-th largest mean, let $H(I)=\\sum_{i=2}^{n}Δ_{[i]}^{-2}$, and let Ent$(I)$ denote the entropy of the normalized complexities of its dyadic gap groups. For every $0<δ<0.1$, we show that the order-oblivious instance-wise lower bound is $ Θ (H(I)[\\log(1/δ)+Ent(I)]). $ We also give a single $δ$-correct algorithm with expected sample complexity $ O ( H(I)[\\log(1/δ)+Ent(I)] +D\\log(e+\\log(e+D))),D=Δ_{[2]}^{-2}, $ without prior knowledge of the gaps. Our lower bound removes the dyadic-gap and monotonicity restrictions of previous work, and our upper bound removes the additional polylogarithmic factor multiplying the two-arm term. Thus, a single algorithm attains the instance-wise lower bound up to an additive two-arm term. The main theorems have been formalized and proved in Lean 4.", "title": "Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification", "updated": "2026-09-12", "url": "https://arxiv.org/abs/2609.13703" }, { "age_days": 4, "arxiv_id": "2609.13641", "authors": [ "Angel Ivanov Raychev" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.13641", "kind": "paper", "label": "adjacent", "matched_signals": [ "lean_formal_proving_agents" ], "published": "2026-09-12", "score": 3.5, "source": "arxiv-ai4math-core", "summary": "We classify the polyominoes obtained by adjoining four straight arms to a single square, allowing zero arm lengths, according to their ability to tile rectangles, half-strips, bent strips, quadrants, strips, half-planes, and the plane. We also classify their ability to tile an integer enlargement of themselves. Tiles occupy whole square-grid cells; translations, rotations, and reflections are permitted. Exactly five capability profiles occur. For the family $P(n,1,1,0)$, the rectangle profile holds for $n\\le3$ and the bent-strip profile, with no half-strip or rep-tiling, for every $n\\ge4$. A cross with four positive arms tiles the plane precisely when two opposite arms have length one; it never tiles a half-plane. Explicit periodic constructions and geometric obstructions are combined with finite symbolic case certificates. A Lean 4 development verifies the full classification for every natural four-tuple, including the interpretation of the certificates as statements about arbitrary infinite tilings. The account incorporates the author's 2020--2021 L- and T-polyomino work, reconstructs Dahlke's gun argument, and documents the subsequent AI-assisted proof development and formalization.", "title": "Four-arm polyominoes in Golomb's hierarchy: A complete classification with Lean verification", "updated": "2026-09-12", "url": "https://arxiv.org/abs/2609.13641" }, { "age_days": 0, "authors": [ "Jiedong Jiang" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:4075d7326a09", "kind": "github_update", "label": "adjacent", "matched_signals": [ "seed_author:Jiedong Jiang" ], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 2.0, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: fix(Algebra/MonoidWithZeroHom): normalize to `.toMonoidWithZeroHom` (#43728)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/4075d7326a0909dc38fa4f499d12335b68b09c73" }, { "age_days": 2, "arxiv_id": "2609.15757", "authors": [ "Julius A. Zeiss" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.15757", "kind": "paper", "label": "adjacent", "matched_signals": [ "general_ai_math_reasoning" ], "published": "2026-09-14", "score": 1.9, "source": "arxiv-ai4math-core", "summary": "Entanglement can reduce the communication required for coding tasks, but establishing the minimum achievable cost is essential to understanding its limits. We address this question in a zero-error source-coding task where Alice receives a word and Bob knows an unordered pair of candidates containing it. Alice does not know the pair and must enable Bob to identify her word without error using shared entanglement and one classical message. The candidates satisfy a balanced-difference promise: for words in $\\mathbb{Z}_q^n$ with $n=q\\ell$, each residue modulo $q$ occurs exactly $\\ell$ times in their coordinatewise difference. For all integers $q\\geq2$ and $\\ell\\geq1$, we prove that the task requires exactly $n$ messages when $(q-1)\\ell$ is even and two messages when it is odd. These minima allow arbitrary finite-dimensional shared states independent of the inputs and arbitrary local measurements. In even parity, this establishes optimality of an existing entanglement-assisted protocol. In odd parity, an explicit deterministic protocol achieves the optimum of one bit without entanglement. Our proof combines Fourier analysis with a combinatorial counting argument to determine the smallest eigenvalue of the associated graphs. In even parity, this resolves the spectral assertion of Cao et al.'s Conjecture 6.3 for balanced cyclic generalized Hadamard graphs. Together with an explicit odd-parity bipartition, this determines the quantum chromatic number as $n$ in even parity and $2$ in odd parity, where the classical chromatic number is also $2$. All lemmas, theorems, and corollaries are formalized and verified in Lean.", "title": "Optimal entanglement-assisted source coding under a balanced-difference promise", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.15757" }, { "age_days": 4, "arxiv_id": "2609.13831", "authors": [ "Sichen Wang" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.13831", "kind": "paper", "label": "adjacent", "matched_signals": [ "general_ai_math_reasoning" ], "published": "2026-09-12", "score": 1.9, "source": "arxiv-ai4math-core", "summary": "Let $ν(G)$ be the maximum number of edge-disjoint triangles in a graph $G$ and $τ(G)$ the minimum number of edges meeting every triangle. Tuza conjectured that $τ(G)\\le 2ν(G)$. We prove that $τ(G)\\le (165/59)ν(G)$. The constant $165/59\\approx 2.797$ improves the bound $66/23\\approx 2.870$ that Haxell proved in 1999. The key observation is that, for a suitable red-blue coloring, the families left over in Haxell's construction contain every triangle with exactly one red edge. Such a family $\\mathcal{F}$ admits an exchange that forces certain red edges to lie in a single triangle once the blue edges of a maximum packing are deleted, which gives $τ(\\mathcal{F})\\le (8/3)ν(\\mathcal{F})$.", "title": "A Bound Below 2.8 for Tuza's Conjecture", "updated": "2026-09-12", "url": "https://arxiv.org/abs/2609.13831" }, { "age_days": 0, "authors": [ "Sebastian Ullrich" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover/lean4:eea2a2db6338", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: fix: link the bundled Rust checkers against the toolchain's sysroot (#15173)", "updated": "2026-09-16", "url": "https://github.com/leanprover/lean4/commit/eea2a2db633891faa7a07eef4b7e006df8c4fc62" }, { "age_days": 0, "authors": [ "Garmelon" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover/lean4:0c4050af2529", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: update ci after mathlib renamed a file (#15184)", "updated": "2026-09-16", "url": "https://github.com/leanprover/lean4/commit/0c4050af2529ed24c7770872f2d8c0d83ae7d48a" }, { "age_days": 0, "authors": [ "Garmelon" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover/lean4:41aa79c394d9", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: add downstream labels with app token (#15185)", "updated": "2026-09-16", "url": "https://github.com/leanprover/lean4/commit/41aa79c394d9d615f61cadcf4b3b053a4f016d6d" }, { "age_days": 0, "authors": [ "Xavier Roblot" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:ffcee224136b", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: refactor(GroupTheory/Subgroup/Simple): make normality an instance argument in `IsSimpleGroup` (#43864)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/ffcee224136b879329c21e3a444d3cc41e8da21f" }, { "age_days": 0, "authors": [ "Kim Morrison" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:83b9f16b1f8c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: fix(Tactic/Inclusion): record the module registering an inclusion family (#43784)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/83b9f16b1f8cd032de8fc72bea617fd5141fcda0" }, { "age_days": 0, "authors": [ "Jireh Loreaux" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:6399adacbe10", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat: geometric series in `WithLp 1 (Unitization 𝕜 A)` are summable if they are in `A` (#42779)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/6399adacbe10f58e65bdbc6c3bfd9dd33122fbfe" }, { "age_days": 0, "authors": [ "Jesse Alama" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:96f4f6ca6e9d", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(TacticAnalysis): tag pass messages with the linter option name (#43399)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/96f4f6ca6e9dcdb26fec36ec10fa90c7f424e94d" }, { "age_days": 0, "authors": [ "Kirill Kondrashov" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:1001f9283405", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(LinearAlgebra/ExteriorPower): add HodgeStar (#43140)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/1001f9283405e049c5f2a92378a181ddc311ccd1" }, { "age_days": 0, "authors": [ "Xavier Roblot" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:09a9e06e4e5c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(GroupTheory/PGroup): a finite p-group is simple iff it has cardinality p (#43836)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/09a9e06e4e5ccd5b783f25e52ad3ebecfb1e2d68" }, { "age_days": 0, "authors": [ "Xavier Roblot" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:cda808628483", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(Algebra/QuadraticAlgebra): quadratic extensions are quadratic algebras (#42554)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/cda8086284838a2432f0a2b6687eb9bdb6496576" }, { "age_days": 0, "authors": [ "Marcelo Lynch" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:fcabd43b034f", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: ci: bump mathlib-ci pins (#43854)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/fcabd43b034f7cc13b777feb1dcc84af140c8ce7" }, { "age_days": 0, "authors": [ "Sebastien Gouezel" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:722a69d463ef", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore: use `Unit` instead of `Fin 1` in seminorm files (#43866)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/722a69d463ef1758c9175aeee94ba579900d8aee" }, { "age_days": 0, "authors": [ "Garmelon" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:b90818238cb4", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore: remove lean-pr-testing-* infrastructure (#43715)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/b90818238cb45962aaf36efc8ab08900578b5e5a" }, { "age_days": 0, "authors": [ "Michael Rothgang" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:5d90fca6613c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore: make m(v)fderiv(Within)_eq_fderiv(Within) more type-correct (#43521)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/5d90fca6613c5f05019e55f1eb2bd91068a99a21" }, { "age_days": 0, "authors": [ "María Inés de Frutos-Fernández" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:e62525005d00", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(Topology/Algebra/Valued/NormedValued): generalize Valuation.norm to Ring (#43590)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/e62525005d00cf680e9ad9d22b87c98bdfcac77e" }, { "age_days": 0, "authors": [ "Xavier Roblot" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:7fa22735254d", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(NumberTheory/RamificationInertia/HilbertTheory): weaken hypotheses (#43754)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/7fa22735254ddf7e11f119250a9f2d0352bc7c3a" }, { "age_days": 0, "authors": [ "Harald Husum" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:4bff7981c2c3", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(FieldTheory): tidy markdown headers (#42683)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/4bff7981c2c387b562358eab3d6bc6878f2bcd2f" }, { "age_days": 0, "authors": [ "Dagur Asgeirsson" ], "content_date": "2026-09-16", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:b66661967ea2", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-16", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(CategoryTheory): mark equivalence and product constructions implicit_reducible (#43867)", "updated": "2026-09-16", "url": "https://github.com/leanprover-community/mathlib4/commit/b66661967ea268e870af649362576332daf0b7b1" }, { "age_days": 1, "authors": [ "Kim Morrison" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:c90fd306302b", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: test: cross-check integer `@[extern]` implementations with `test_extern` (#14288)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/c90fd306302b99b3297c0cfe68b081e14d1b6029" }, { "age_days": 1, "authors": [ "Kim Morrison" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:be72ee5915f6", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: perf: share grind modifier parser construction (#15161)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/be72ee5915f68b0b26ccf8b7be21243f3eb7913b" }, { "age_days": 1, "authors": [ "Kim Morrison" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:001828be3b5a", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: perf: compute library suggestion indexes on demand (#15159)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/001828be3b5ab4457dded84bffcc2fb2399f00ab" }, { "age_days": 1, "authors": [ "Sofia Rodrigues" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:f6e80ec7810f", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: fix: tcp and udp recv truncated datagram and parallel accept (#14795)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/f6e80ec7810f382c7e5c62559bf08c4b779dd477" }, { "age_days": 1, "authors": [ "Sofia Rodrigues" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:49cc3a6da964", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: fix: double release when two threads stop the same libuv handle (#14793)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/49cc3a6da9644ca80348432b7f77da89030321f6" }, { "age_days": 1, "authors": [ "Dennj" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:2e59fe327f7b", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: lake: make job cancellation a first-class JobState flag (#14835)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/2e59fe327f7b7af5960fee2c280cc1515cb101c5" }, { "age_days": 1, "authors": [ "Sebastian Graf" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:95f4f3c3fd67", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: frame the exception channel (#15067)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/95f4f3c3fd6754b2d909ffc3c14bdd912c701e5f" }, { "age_days": 1, "authors": [ "Sebastian Ullrich" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:368d11660402", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: bundle the `con-ron` external checker (#15153)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/368d1166040283e0e8b1199c593b2abb060c8180" }, { "age_days": 1, "authors": [ "Kim Morrison" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:86704eea9a8c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: add Nat.powMod with GMP-backed extern for fast modular exponentiation (#13490)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/86704eea9a8cf46d7f20f4eb2c293cdaae7ac2d7" }, { "age_days": 1, "authors": [ "Marc Huisinga" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:ceed043084c0", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: `ChoiceResolutionInfo` (#15070)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/ceed043084c059e11957e47f047b4fdfde3b5682" }, { "age_days": 1, "authors": [ "Sebastian Ullrich" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:90dc0c50a4db", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: recompile stdlib C files when `lean.h` changes (#15164)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/90dc0c50a4dba536f9445024c9c453ae8255c49b" }, { "age_days": 1, "authors": [ "Garmelon" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:d1e94ac5e25c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: prepare development cycle for v4.36.0 (#15169)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/d1e94ac5e25c00c204492a77844441cba72c2330" }, { "age_days": 1, "authors": [ "Henrik Böving" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:2c429479f1eb", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: denylist slow fsanitize tests (#15168)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/2c429479f1ebb099466296e2643984d33e3c2dd5" }, { "age_days": 1, "authors": [ "Julia Markus Himmel" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover/lean4:1d0e18022c71", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: ci: update Grove action to v0.7 (#15163)", "updated": "2026-09-15", "url": "https://github.com/leanprover/lean4/commit/1d0e18022c712c6708d3efc2c011d0c100f45c33" }, { "age_days": 1, "authors": [ "emlis" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:e06e14b71d82", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat: `Icc a b - Icc c d = Icc (a - d) (b - c)` (#43304)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/e06e14b71d82002ee32ce854c8ec9ebba95f9627" }, { "age_days": 1, "authors": [ "Yaël Dillies" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:cfdbbde28625", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(Tactic/Positivity): cover `Finset.sum_pos'` with the `Finset.sum` extension (#43613)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/cfdbbde28625244d157e0686551820cc03834236" }, { "age_days": 1, "authors": [ "David Loeffler" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:76675ff6cd61", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(RingTheory/PowerSeries): characterize natural bounds on order (#43828)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/76675ff6cd61a69a2e1bc6a8632eb0b65ebe77a0" }, { "age_days": 1, "authors": [ "ajirving" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:e83933a68d21", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(MeasureTheory/Integral/CircleAverage): add norm_circleAverage_le_circleAverage_norm (#43458)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/e83933a68d217ebc2220aed3cc3d0f1310d8fc85" }, { "age_days": 1, "authors": [ "Snir Broshi" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:695d840c1dab", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(GroupTheory/Index): index of infimum (#43800)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/695d840c1dabb4c98dc38ff1874d51e0d465d6a4" }, { "age_days": 1, "authors": [ "David Loeffler" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:dbc2b2ba8bde", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(Analysis/Analytic): analytic order of zero function (#43829)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/dbc2b2ba8bdecf880fc07bf897333d139ae33843" }, { "age_days": 1, "authors": [ "Raphael Douglas Giles" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:dc8cecbd5c7a", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(AlgebraicGeometry): define Weil divisors (#43255)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/dc8cecbd5c7a2df0e86504473f4ce4b7e8c1adeb" }, { "age_days": 1, "authors": [ "Vlad Tsyrklevich" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:5f8d82964168", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: feat(AffineIndependent): add `AffineIndepOn` (#43459)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/5f8d829641684affdf2a2ee6bb6c0b2633df2da0" }, { "age_days": 1, "authors": [ "Marcelo Lynch" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:fd634dd29761", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: ci: upload the master cache to R2 from the upload_cache job (#43648)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/fd634dd29761b5d32af50e2b8f6d8ad043024303" }, { "age_days": 1, "authors": [ "Garmelon" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:c32e1ec0d1eb", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore: bump toolchain to v4.35.0-rc1 (#43843)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/c32e1ec0d1eb5237ba344eee50162f45d5b0fc76" }, { "age_days": 1, "authors": [ "Lua Viana Reis" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:d2b0fef2ba7c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(MeasureTheory): break import cycle between `QuasiMeasurePreserving` and `AEMeasurable` (#43190)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/d2b0fef2ba7cf65e895ba96ab112f4f7ae1b563d" }, { "age_days": 1, "authors": [ "Monica Omar" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:224c33990e57", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(LinearAlgebra/Matrix/PosDef): generalize and golf `PosSemidef.posDef_iff_isUnit` (#43627)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/224c33990e5723deee0d5f30c9b23e6a5d3ac0d4" }, { "age_days": 1, "authors": [ "Jovan Gerbscheid" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:ba22a8986c7b", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(CategoryTheory): remove many `backward` options (#43838)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/ba22a8986c7bb38a6f340cc151b98692dc4ce6bf" }, { "age_days": 1, "authors": [ "Attila Vajda" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "github:leanprover-community/mathlib4:478a11d4aac1", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-15", "repo": "leanprover-community/mathlib4", "score": 0.8, "source": "mathlib4-github", "summary": "Recent commit on leanprover-community/mathlib4.", "title": "leanprover-community/mathlib4: chore(Analysis/Normed/Lp/PiLp): fix stale docstring cross-references (#42509)", "updated": "2026-09-15", "url": "https://github.com/leanprover-community/mathlib4/commit/478a11d4aac14002443b1a7f84909fb663dc0537" }, { "age_days": 2, "authors": [ "Marc Huisinga" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:5e7db968cc3e", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: refactor: move infotree and snapshottree utils (#15133)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/5e7db968cc3e288662c34d148fe934d7c2929882" }, { "age_days": 2, "authors": [ "Marc Huisinga" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:088be5f36f2e", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: fix: remove lossy syntax separator array coercions (#15020)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/088be5f36f2ec96da3279f0e56f164dc6a2e7ce9" }, { "age_days": 2, "authors": [ "Marc Huisinga" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:9632ea4c76f8", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: fix: keep the space before a `hygieneInfo` antiquotation (#15025)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/9632ea4c76f83a21119f89a14871b3236d4d51d9" }, { "age_days": 2, "authors": [ "Henrik Böving" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:dc34e5f5cf9c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: support loading lake check and lake comparator input directly from export files (#15157)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/dc34e5f5cf9c42dd783471b525abbe66c0194270" }, { "age_days": 2, "authors": [ "Gaëtan Serré" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:d3a0781b9001", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: add `Float.fma` and `Float32.fma` with logical model (#15024)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/d3a0781b9001b66763f1e61c400cbc5f49abb5f5" }, { "age_days": 2, "authors": [ "Sebastian Ullrich" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:669e6b41806c", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: add `--paranoid` to `lake check` and `lake comparator` (#15145)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/669e6b41806c0fade055f6fe05cd8abba200982f" }, { "age_days": 2, "authors": [ "Henrik Böving" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:a2233a321503", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: add --inadvisably-no-sandbox to comparator (#15156)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/a2233a3215034a623e36ffda47bf7ed2458cca29" }, { "age_days": 2, "authors": [ "Lean stage0 autoupdater" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:2f417f704211", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: update stage0", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/2f417f704211f4413b857f4afae3cc46fd5b7cd3" }, { "age_days": 2, "authors": [ "Marc Huisinga" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:db1b21a57c5d", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: remove redundant `sepBy1` in `subst` parser (#15029)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/db1b21a57c5dbeae231bbf78fa3e88d43b714558" }, { "age_days": 2, "authors": [ "Garmelon" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "github:leanprover/lean4:e20f62782c5e", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-14", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: chore: add downstream labels via comment (#15155)", "updated": "2026-09-14", "url": "https://github.com/leanprover/lean4/commit/e20f62782c5e3293519c1db2c4b1e0a2e27b21a3" }, { "age_days": 3, "authors": [ "Wojciech Nawrocki" ], "content_date": "2026-09-13", "freshness": "fresh", "id": "github:leanprover/lean4:d48866da828a", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-13", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: fix: trigger PR body check on label removal (#15149)", "updated": "2026-09-13", "url": "https://github.com/leanprover/lean4/commit/d48866da828ada369bae5ec95dd0aee5ef0f29c7" }, { "age_days": 3, "authors": [ "Mac Malone" ], "content_date": "2026-09-13", "freshness": "fresh", "id": "github:leanprover/lean4:d01ad55af54a", "kind": "github_update", "label": "negative", "matched_signals": [], "published": "2026-09-13", "repo": "leanprover/lean4", "score": 0.8, "source": "lean4-github", "summary": "Recent commit on leanprover/lean4.", "title": "leanprover/lean4: feat: lake: uploadable dependency outputs (#15141)", "updated": "2026-09-13", "url": "https://github.com/leanprover/lean4/commit/d01ad55af54a91cdc7bbd118ba654404613d2cbd" }, { "age_days": 1, "arxiv_id": "2609.16603", "authors": [ "Jeng Wen Joshua Lean", "Ting-Yu Yen", "Wei-Fang Sun", "Simon See", "Hung-Kuo Chu", "Shih-Hsuan Hung" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.16603", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-15", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "Full-context neural visual geometry is impractical for thousands of images, while sequence-based chunking poorly captures irregular non-local overlap in multi-sequence aerial collections. We present Graph-Guided Neural Visual Geometry for Aerial Registration (G3AR), a graph-guided framework for scalable dense neural geometry. Before local inference, G3AR builds a geometrically verified image-proximity graph that guides bounded overlapping chunks and induces a chunk graph whose maximum spanning tree defines alignment topology. Compatible backbones process chunks independently; shared-image predictions then estimate three-dimensional similarity (Sim(3)) transforms that register local cameras and geometry in a common frame. Across four real aerial scenes, G3AR improves pose error and runtime in matched VGGT- and Pi3-backed comparisons, while its DA3 variant achieves the lowest pose error among evaluated neural-geometry methods.", "title": "G3AR: Graph-Guided Neural Visual Geometry for Scalable Multi-Sequence Aerial Registration", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.16603" }, { "age_days": 1, "arxiv_id": "2609.16470", "authors": [ "Levent Alpöge", "Tristan Buckmaster", "Matei P. Coiculescu" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.16470", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-15", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "By adapting the techniques used in the IPM blowup result of Córdoba-Martínez-Zoroa with spatially smooth force, we prove finite-time blow-up for the IPM equation on $\\mathbb T^2$ with a uniformly spacetime smooth force. In particular, we show there exist a smooth odd initial density, a smooth odd force $F\\in C^\\infty([0,1]\\times\\mathbb T^2)$, and a classical solution $ρ$ on $[0,1)$ whose density gradient and spatial velocity gradient diverge in $L^\\infty$ as $t\\uparrow 1$. Nevertheless, $ρ(t)$ converges in $C^η$ for every $0\\leqη<1$.", "title": "Extending the Córdoba-Martínez-Zoroa IPM Blow-Up to Uniformly Space-Time Smooth Forcing", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.16470" }, { "age_days": 1, "arxiv_id": "2609.16555", "authors": [ "Nikita Lebedev" ], "content_date": "2026-09-15", "freshness": "fresh", "id": "arxiv:2609.16555", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-15", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "We study the augmented Zarankiewicz problem, in which disjoint pairs of cells are added to a binary matrix with no all-one $2\\times2$ submatrix. The pairs must satisfy compatibility conditions, and the objective counts each original occupied cell and each added pair once. We show that starting with a maximum $C_4$-free matrix can lower the final optimum, answering a question of Qi, Cui, and Xu. Let ${z_A}(m,n)$ be the optimum over all $C_4$-free initial matrices, and ${z_L}(m,n)$ the optimum when the initial matrix must have the maximum number of occupied cells. As $n\\to\\infty$ with $n\\le m=o(n^2)$, we prove \\[ {z_A}(m,n)-{z_L}(m,n)\\ge\\left(\\frac1{30}-o(1)\\right)mn \\] and determine the sharp second-order term: \\[ {z_A}(m,n)=\\frac{mn}{3}+\\left(\\frac1{\\sqrt6}+o(1)\\right)n\\sqrt m. \\] An explicit construction gives a separation at $m=n=1893$. We also find a sharp density threshold: when $n\\to\\infty$ and $m/n^2\\to c>0$, the limited density ${z_L}(m,n)/(mn)$ tends to $1/3$ if and only if $c\\ge1/12$. The proofs combine density and stability estimates, combinatorial constructions, and an exact polynomial certificate.", "title": "Density and separation for augmented Zarankiewicz numbers", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.16555" }, { "age_days": 2, "arxiv_id": "2609.15648", "authors": [ "Son Ho", "Cédric Fournet", "Jonathan Protzenko", "Michael Naehrig", "Joshua Clune", "Patrick Longa", "Guillaume Boisseau", "Fernando Leal Sánchez", "Aymeric Fromherz", "Antoine Delignat-Lavaud" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.15648", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-14", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "We develop a new methodology for verifying cryptographic software. We target production code written in Rust for performance and system integration, rather than verification convenience. Rust's ownership discipline enables Aeneas to extract a pure model of this code in Lean, relieving us from low-level reasoning about pointer liveness and aliasing. Lean's extensibility lets us develop tactics and libraries that greatly simplify reasoning about extracted Rust code. We design and tune our toolchain to facilitate the use of AI. Agents autonomously write formal proofs, which are independently verified by the Lean kernel. Agents also assist in the formalization of cryptographic standards and platform-specific intrinsics, which still requires expert design and review. We apply our methodology to SymCrypt, Microsoft's cryptographic provider. We verify its implementations of algorithms such as SHA-3 and ML-KEM, which were ported from C to Rust. We also extend SymCrypt with experimental optimizations and implementations of algorithms such as FrodoKEM, ML-DSA, and HPKE to explore the scalability of writing, adapting, and verifying cryptographic code. Our 237~KLOC Lean development establishes safety, panic-freedom, and functional correctness of 16.7~KLOC of Rust code supporting post-quantum cipher suites for x86-64 and ARM platforms. Our evaluation shows that verified Rust can meet SymCrypt's performance, portability, deployment, and maintainability requirements.", "title": "Scaling Verification of Cryptographic Software with Aeneas, Rust, and Lean", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.15648" }, { "age_days": 2, "arxiv_id": "2609.16299", "authors": [ "Yuquan Fu", "Carlo Angiuli", "Sam Tobin-Hochstadt" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.16299", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-14", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "Over the past two decades, numerous systems have brought some of the benefits of dependent typing to a wide variety of new programming languages, often by restricting which terms can appear inside types. Such techniques are known as refinement types, occurrence typing, liquid types, and path dependent types, among others. However, the restrictions adopted by these systems often break the substitution property, because they explicitly disallow the ability to substitute arbitrary terms for variables inside types. This leads to significant complexity in the design and metatheory of these systems, increasing the possibility of significant errors. We consider a specific line of work on occurrence typing, namely, the calculus underlying Typed Racket due to Tobin-Hochstadt and Felleisen 2010. We show that the fundamental challenge of substitution into types resulted in multiple flaws in the formalism and the syntactic type soundness theorem of this work. These flaws are replicated in several other papers building on this work, and also surface as a soundness bug in Typed Racket itself. We identify and repair these problems, revising the core calculus of Typed Racket and giving a \\emph{semantic type soundness} proof using step-indexed logical relations, formalized in Lean. We argue that this approach is simpler than it may seem, and easily scales to handle the complexity of the occurrence typing in Typed Racket.", "title": "Revisiting Soundness for Occurrence Typing, Semantically", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.16299" }, { "age_days": 2, "arxiv_id": "2609.14925", "authors": [ "Nathan Peterson", "Avik Mahata", "Nick Beaver", "Mohsen Kivy" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.14925", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-14", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "Refractory alloys with a ductile body-centered-cubic (BCC) matrix strengthened by ordered B2 precipitates offer a high-temperature analogue to the gamma/gamma-prime architecture of Ni-based superalloys. Ruthenium is particularly attractive as a B2 stabilizer because RuHf, RuZr, and RuTi can retain ordered phases well above 1300 C. In this work, equilibrium CALPHAD calculations were coupled with random-forest-guided active learning to explore a ten-element Nb-based, Ru-bearing composition space containing Nb, Ta, Mo, V, Ru, Ti, Zr, Hf, Al, and Y at 1 at.% resolution. Across 500 CALPHAD-evaluated alloys, the calculations reproduced the principal trends reported for the Ru-B2 design space. RuHf and RuZr remained stable to the solidus, RuTi commonly exhibited a solutionizing window, and Al-containing alloys preferentially formed competing sigma and A15 phases. The upper bound of the BCC+B2 field increased from a median of approximately 1570 C at 5 at.% Ru to approximately 1980 C near 9-10 at.% Ru. Among the group-IV additions, Hf, Zr, and Ti produced progressively lower two-phase stability. Re-screening using physically motivated criteria identified 100 alloys satisfying requirements for high-temperature BCC+B2 stability, absence of liquid, phase purity, and appropriate secondary-phase fraction, including 19 Ru-lean compositions and two independently reported HfRu-B2 alloys. The results establish practical compositional design rules for Ru-stabilized dual-phase refractory alloys and identify phase-specific BCC/B2 lattice misfit as a key target for future design cycles.", "title": "Machine Learning Guided CALPHAD Design of Ru-Stabilized BCC B2 Refractory Alloys", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.14925" }, { "age_days": 2, "arxiv_id": "2609.15554", "authors": [ "Javier Aguilar Martín" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.15554", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-14", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "We study packings of annuli of a common width, allowing each ring to nest inside the hole of a larger one. The objectives of maximizing contact area and cardinality diverge: area is superadditive in the radius, cardinality is not. Under superincreasing radii, every descending greedy maximizes every positive, strictly increasing, superadditive objective. More strongly, any choice among feasible containers yields the lexicographically maximal feasible set, for containers of arbitrary shape in every dimension. This placement irrelevance holds unconditionally for at most three rings and fails at four in disks and squares; twin instances exclude every universal rule based only on the observable state. Write $ρ=\\max_i(\\sum_{j>i}r_j)/r_i$. The additive model has threshold exactly $1$. For disks we prove the exact global threshold $τ=\\varphi$, with no failure at $ρ\\le\\varphi$, for every finite inventory, even with independent hole radii. The key geometric theorem states that, under golden tail bounds, an entire disk list fits a circular container if and only if its three largest disks fit; this supplies the uniform exchange of parents that the threshold proof needs. The Tribonacci constant $T\\approx1.83929$ remains the exact floor of a rigid subfamily. A dimension-reduction lemma transfers spherical sharpness results to all dimensions $d\\ge2$, and a separate argument proves the golden threshold for at most five rings in those dimensions. For square pans, a Cartesian confinement criterion gives twins and a family proving $τ_{\\square}\\le Y\\approx1.6845$; its optimality is open. For independent holes, the exact universal area guarantee under $ρ\\leκ<1$ is $\\min(1,κ^{-2}-1)$, with threshold $1/\\sqrt2$. The repository has 122 Lean theorems. Euclidean geometry, forest assembly and continuity remain written proofs; numerical checks do not substitute for them.", "title": "Greedy Packing of Nested Rings: Placement Rules, a Golden Counterexample, and a Tribonacci Floor", "updated": "2026-09-15", "url": "https://arxiv.org/abs/2609.15554" }, { "age_days": 2, "arxiv_id": "2609.15986", "authors": [ "Tzu-Chen Huang" ], "content_date": "2026-09-14", "freshness": "fresh", "id": "arxiv:2609.15986", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-14", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "We construct a complex spherical fusion category with cyclic Haagerup-Izumi fusion rules for every odd n >= 3, and deduce pseudo-unitary existence. The proof has four parts: explicit real coefficients and their quadratic identities; a contour calculation for a range of cubic Fourier coefficients; algebraic completion of all cubics; and categorical reconstruction. Matrix inversion supplies reflection, and an extension of the dimension-field automorphism supplies the positive-dimensional category.", "title": "Cyclic Haagerup-Izumi fusion categories at every odd order", "updated": "2026-09-14", "url": "https://arxiv.org/abs/2609.15986" }, { "age_days": 3, "arxiv_id": "2609.14314", "authors": [ "S P Suresh" ], "content_date": "2026-09-13", "freshness": "fresh", "id": "arxiv:2609.14314", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-13", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "We present a new proof of weak normalization for intuitionistic natural deduction. The distinguishing features of this proof are that it works only with cuts rather than cut segments, provides explicit local rules for determining whether to contract a whole proof or reduce one of its subproofs, and in the latter case, which subproof to reduce. We also discuss a formalization of the entire proof in Lean, and present a deterministic algorithm for weak normalization.", "title": "Simplified proofs of Weak Normalization for propositional logic", "updated": "2026-09-13", "url": "https://arxiv.org/abs/2609.14314" }, { "age_days": 3, "arxiv_id": "2609.14525", "authors": [ "Zhipeng Lu", "Sichen Wang" ], "content_date": "2026-09-13", "freshness": "fresh", "id": "arxiv:2609.14525", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-13", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "We study how far a fixed Ramsey upper bound can be improved by descending through blue neighborhoods in one vertex set while keeping a second set fixed. A weighted inequality in the two set sizes determines when the descent can stop. For the source bound specified here, the infimum diagonal exponent over all finite derivations lies in $[1.305,\\,1.307]$. A finite derivation gives $R(k,k)\\le3.69507^k$ for all sufficiently large $k$; a concave polygon proves the lower bound for every finite depth. We also characterize the infimum as a greatest fixed point and show that every larger exponent has a finite derivation valid uniformly for nearby clique-size ratios.", "title": "Retained-Set Descent for Diagonal Ramsey Numbers", "updated": "2026-09-13", "url": "https://arxiv.org/abs/2609.14525" }, { "age_days": 4, "arxiv_id": "2609.13946", "authors": [ "Yuning Yang" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.13946", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-12", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "This work studies subspace embeddings obtained by two normalized real Walsh transforms, two independent sign diagonals, and uniform coordinate sampling without replacement. The main result shows that the prescribed sample size $k=\\min\\{n,\\lceil Cr/\\varepsilon^2\\rceil\\}$, for a universal constant $C$, suffices to preserve all squared norms on each fixed $r$-dimensional subspace within $1\\pm\\varepsilon$ with probability at least $0.99$. The result holds for every ambient Walsh dimension and all ranks, and answers Problem TR-01 in the Open Problems in Numerical Linear Algebra repository. The proof controls joint entry cumulants of the transformed projection through connected graph contractions and Walsh character identities. These estimates then bound the expected trace of even powers of a product of centered projections. A two-projection decomposition converts this estimate into control of both spectral edges. Bernoulli sampling at arbitrary densities and a deterministic upper bound near full sampling yield the prescribed number of coordinates.", "title": "Subspace embeddings with the rerandomized SRHT", "updated": "2026-09-12", "url": "https://arxiv.org/abs/2609.13946" }, { "age_days": 4, "arxiv_id": "2609.13879", "authors": [ "Yiling Wu" ], "content_date": "2026-09-12", "freshness": "fresh", "id": "arxiv:2609.13879", "kind": "paper", "label": "negative", "matched_signals": [], "published": "2026-09-12", "score": 0.5, "source": "arxiv-ai4math-core", "summary": "An acquired representation can enlarge a system's cognitive repertoire without transferring the capacities exercised in producing that representation. This paper develops a framework for specifying that enlargement and its limits. Its central contribution is a five-part attribution table distinguishing effective tracking, application of acquired structures, acquisition from explicit specifications, acquisition from identifying observations, and retention and reuse. Each entry identifies a positive capacity commitment and a further claim requiring additional support. The argument deliberately grants meaningful content, causal efficacy, and productive inference, so that its conclusion does not depend on treating representations as inert encodings. Map and category examples show why even complete application competence leaves acquisition capacity undetermined, and why acquiring a criterion from its description differs from finding it in examples. Short formal proofs appear in an appendix. The framework is applied to Andrew Ng's world-model interpretation of Othello-GPT and to the specific indicators discussed in contemporary accounts of machine concepts. It preserves demonstrated recognition, classification, inference, and qualified acquisition while specifying what remains unestablished about criterion discovery and accumulation. The result concerns the scope of cognitive attribution rather than the constitutive conditions of concept possession: cognitive achievements deserve credit for the capacities they establish, without silently importing a broader repertoire through the labels attached to them.", "title": "Map Users and Mapmakers: The Scope of Cognitive Attribution from Acquired Representations", "updated": "2026-09-12", "url": "https://arxiv.org/abs/2609.13879" }, { "age_days": 3, "arxiv_id": "2609.14572", "authors": [ "Sushan Adhikari" ], "content_date": "2026-09-13", "freshness": "fresh", "id": "arxiv:2609.14572", "kind": "paper", "label": "negative", "matched_signals": [ "negative:generic_llm_rag" ], "published": "2026-09-13", "score": -2.5, "source": "arxiv-ai4math-core", "summary": "Teaching abstract theoretical computer science (TCS) concepts such as algorithm analysis and complexity theory is challenging because students must handle formal proofs and asymptotic reasoning that conventional resources rarely explain in an adaptive, on-demand way. We present AlgoRAG, a specialized Retrieval-Augmented Generation (RAG) system that couples a large language model (LLM) with a curated, domain-specific knowledge base to address these challenges. The knowledge base integrates authoritative textbooks, 847 lecture slides, 312 practice problems with solutions, 156 worked proof templates, and 89 complexity worksheets. AlgoRAG incorporates domain-specific optimizations including mathematical entity recognition, notation-aware retrieval, and pedagogical re-ranking. We evaluate AlgoRAG on 179 curated exam-style questions spanning asymptotic analysis, recurrence relations, dynamic programming, graph algorithms, NP-completeness, sorting, and divide-and-conquer. The system achieves a 100% success rate with a mean response time of 38.0 seconds. While BLEU-4 scores are zero -- a known limitation of n-gram matching on mathematical proofs where equivalent reasoning may use entirely different notation -- AlgoRAG attains ROUGE-1 F1 of 0.0963, ROUGE-L F1 of 0.0683, and a pedagogical quality score of 0.7620, indicating that responses are well-structured and didactically sound even when surface wording diverges from reference answers. Performance is especially strong on NP-completeness (ROUGE-1 F1 = 0.1285, pedagogical quality = 0.7643) and graph algorithms (ROUGE-1 F1 = 0.1023, pedagogical quality = 0.8086). These results support the conclusion that RAG is an effective architecture for personalized theoretical-CS instruction, providing correct, context-rich explanations even for highly abstract topics.", "title": "AlgoRAG: Retrieval-Augmented Generation for Theoretical Computer Science Education -- A Comprehensive Evaluation Framework for Algorithm Analysis and Complexity Theory", "updated": "2026-09-13", "url": "https://arxiv.org/abs/2609.14572" } ], "lookback_days": 21, "schema": "ai4math-radar-run-v1", "timezone": "America/Los_Angeles" }