The Mathematics Gazette

Nov 9 – Nov 15, 2026 · Read widely, read carefully, and let this week's hard papers sharpen your patience.

A geometric Kähler--Ricci flow proof of the Calabi--Yau theorem

The proof uses Kähler-Ricci flow to reach the unique Ricci-flat metric that the Calabi-Yau theorem guarantees for certain complex spaces. It gives a new geometric view of a foundational result, using a dynamic process instead of the traditional method.

A geometric Kähler--Ricci flow proof of the Calabi--Yau theorem · Bennett Chow, Yuan Liao · arXiv:2611.12800

Polytope Dimensions Reveal Gaps in Assignment Formulas

Lee's spectral method turns out to be a conjecture detector as much as a dimension calculator. The paper pins down the dimension of several integer-programming polytopes by reading it off an association scheme, and along the way finds two infinite families where the multi-index assignment polytopes of Appa, Magos, and Mourtos do not match the dimension of their linear relaxation, contradicting that trio's expectation. A Semantic Scholar record simply tracks the lineage of that earlier work, twenty citations deep, without taking sides on the new counterexamples. The method also hands the Latin-square transversal polytope its maximal possible dimension for every abelian group with a transversal, via freshly constructed complete mappings that serve as witnesses certifying whole eigenspaces at once.

The dimension of multi-index assignment polytopes and Latin-square transversal polytopes, via association schemes · Jon Lee · arXiv:2611.12780

Random Graph Colorings Get Closer to the Theoretical Limit

Shaving the color budget down to roughly the square root of the average degree still keeps Glauber dynamics fast, according to the paper's analysis. For sparse Erdős-Rényi graphs, the probability of drawing a graph where the dynamics mixes rapidly approaches one once the number of colors exceeds the average degree by about its square root, beating the earlier bound of 1.763 times the degree from Efthymiou, Hayes, Stefankovic, and Vigoda's SODA 2018 work. The proof decomposes the random graph into blocks wrapped around high-degree vertices, with singleton vertices left alone, then applies a Bochner-Bakry-Émery argument to get a spectral gap on block dynamics before comparing block and Glauber dynamics via a new recursive separator decomposition. The paper establishes an almost-quadratic mixing time.

Sampling Colorings on $G(n, d/n)$ via Glauber Dynamics · Leon Schiller · arXiv:2611.12444

Spectral Sequences Keep Their Ring Structure in Type Theory

Homotopy type theory just got its own multiplication table for spectral sequences. The paper defines relative homotopy groups inside this type-theoretic foundation and shows three equivalent ways to multiply them, then uses that product to prove the cohomological Serre spectral sequence is multiplicative in this setting too. The cohomology ring structure on the starting page turns out to match the familiar tensor-product-of-graded-rings picture from classical algebraic topology, tying the homotopy product directly to the cup product. As a payoff, the paper computes cohomology rings for several classifying spaces and loop spaces of spheres. Readers can decide whether this module-level bookkeeping actually simplifies the classical arguments or just relocates the bookkeeping.

Multiplicativity of the Serre Spectral Sequence in Homotopy Type Theory · Arseniy Kryazhev · arXiv:2611.11828

Eigenvalues Set Exact Rules for Hamilton Cycles in 3-Graphs

Pinning an exact number on when eigenvalues force a tight Hamilton cycle through every vertex of a three-uniform hypergraph turns out to need four different formulas depending on arithmetic mod three and mod nine. The paper fixes the minimum adjacency spectral radius of vertex links needed to guarantee loose Hamilton cycles at (1+√13)n/8 plus a bounded error, and tight Hamilton cycles at 2n/3 plus a bounded error, with matching constructions showing neither bound can be improved. The spectral and minimum-degree conditions turn out not to imply each other, so spectral radius is doing genuinely different work here than the usual degree count. Loose cycles fall to fractional packing stability plus absorption near a space barrier, while tight cycles reduce to three extremal configurations resolved by controlling spectral loss from missing triples.

Exact local spectral thresholds for loose and tight Hamilton cycles in $3$-graphs · Pei Liu · arXiv:2611.12453

Persistence landscape velocity: Closed formulas and a topological probe of quantum criticality

Simple formulas compute how fast the shape features of data change as a parameter varies, using when features appear and disappear. It accurately pinpoints critical transitions in quantum systems and gives a faster, more robust method with a unique topological fingerprint.

Persistence landscape velocity: Closed formulas and a topological probe of quantum criticality · Francisco Belchí, Nahuel Statuto · arXiv:2611.11358

Discrete Configuration Spaces of Simplex Skeleta: a Middle-Dimensional Manifold Phenomenon

Using higher-dimensional triangle pieces instead of two particular graphs, spaces of point arrangements consistently form an infinite family of higher-dimensional spheres. It reveals a broad, unexpected pattern linking discrete combinatorial objects to fundamental geometric shapes and gives new examples for topology and geometry.

Discrete Configuration Spaces of Simplex Skeleta: a Middle-Dimensional Manifold Phenomenon · Emilio J. González, Jesús González, Mary Carmen Pérez-Morales · arXiv:2611.12847

Counter-examples to Conjectures on NCCRs via a Reductive McKay Correspondence

Three significant conjectures about non-commutative resolutions and the stringy Euler characteristic are disproved using a new version of the McKay correspondence. The result forces a re-evaluation of established ideas in algebraic geometry and provides new computational techniques, with links to combinatorial problems.

Counter-examples to Conjectures on NCCRs via a Reductive McKay Correspondence · Matthew Satriano, Jeremy Usatine · arXiv:2611.12679

A Hoare Logic for Continuous-Time Stochastic Processes

A formal method adapts verification techniques for discrete programs to prove properties of systems that change randomly and continuously over time. It is relevant as AI and autonomous systems operate in complex, uncertain real-world environments where rigorous guarantees are crucial.

A Hoare Logic for Continuous-Time Stochastic Processes · Kei Imada, Justin Hsu · arXiv:2611.12761

On Poincaré spaces which are not manifolds

The work reviews when Poincaré spaces count as manifolds and uses the completed Kervaire invariant problem to identify examples that cannot be manifolds. The completed Kervaire invariant problem gives a new tool to understand the structure of these geometric objects.

On Poincaré spaces which are not manifolds · John R. Klein · arXiv:2611.11463

All Gazettes · Mathematics Scholars Collective