The Mathematics Gazette

Nov 2 – Nov 8, 2026

A proof of the spectral rigidity for complex projective space

If a complex geometric space has exactly the same Laplacian spectrum as the fundamental complex projective space, it must be that space. It answers how much a geometric object's shape is encoded in its sound, for a space crucial to mathematics and physics.

A proof of the spectral rigidity for complex projective space · Kefeng Liu, Hao Xu · arXiv:2611.03536

Construction of the 2D non-Abelian Yang-Mills-Higgs measure via stochastic quantisation

The authors give the first rigorous mathematical construction of the Yang-Mills-Higgs measure, which sets probabilities for how forces and particles behave in a simplified two-dimensional universe. It provides a solid foundation for understanding these theories even when interactions are strong.

Construction of the 2D non-Abelian Yang-Mills-Higgs measure via stochastic quantisation · Bjoern Bringmann, Sky Cao, Martin Hairer et al. · arXiv:2611.03640

Macroscopic scalar curvature bounds on graphs

This paper establishes fundamental limits on how "tightly packed" a graph can be. The local neighborhoods within any finite graph must always take up at least as much "space" as the simplest, most spread-out tree structures.

Macroscopic scalar curvature bounds on graphs · Steve Karam, Stéphane Sabourau · arXiv:2611.03277

A result of continuous stability for generalized persistence diagrams

The paper introduces generalized persistence diagrams, or topological fingerprints, for networks and graphs, and proves they change only a little when the network changes a little. It offers a promising way for shape-based data analysis to pull richer, dependable structural insights from large, complex datasets.

A result of continuous stability for generalized persistence diagrams · Yanga Bavuma, Martin Mijangos, Francesco G. Russo · arXiv:2611.00799

The 1-2-3 Conjecture for Borel Combinatorics

A version of the 1-2-3 puzzle for infinite Borel graphs can require up to five edge numbers to make each vertex sum unique. It shows how a simple rule for finite graphs becomes more complex on infinite structures.

The 1-2-3 Conjecture for Borel Combinatorics · Junhao Chen, Wei Dai · arXiv:2611.03320

Inferring geometric structure from eigenfunction triple products

When vibration products decay very smoothly, the space is perfectly smooth; when they combine simply, it is flat like a torus. It offers ways to infer a space's geometry by analysing its vibrations, and marks limits.

Inferring geometric structure from eigenfunction triple products · Josef Greilhuber, Romain Speciel · arXiv:2611.03619

A Topology-Based Approach to Representative Volume Element Assessment in Solid Oxide Cell Anodes Using Large Volume Tomography and Persistent Homology

It uses persistent homology to analyse pore networks and find the smallest sample that reflects a material's overall properties. It gives a more consistent, reliable assessment for designing and optimizing high-performance materials.

A Topology-Based Approach to Representative Volume Element Assessment in Solid Oxide Cell Anodes Using Large Volume Tomography and Persistent Homology · Aleksandra Kukiełka, Maksym Szemer, Szymon Buchaniec et al. · arXiv:2611.03176

Order-Invariant CFO Contains Local-Order-Invariant FO

This paper explores logical languages used to describe properties of structures like networks or databases, focusing on those whose descriptions don't depend on how you label or order the elements. For many common types of networks where no single node is overly connected, several sophisticated logics turn out to be just as powerful as simpler ones.

Order-Invariant CFO Contains Local-Order-Invariant FO · Derek R. Aoki · arXiv:2611.01501

All Gazettes · Mathematics Scholars Collective