The Mathematics Gazette

Nov 16 – Nov 22, 2026 · Read a paper slowly, ask an honest question, and let the week's mathematics meet you on the way.

Polynomial bounds for quasiplanar graphs

Researchers found a much tighter upper limit on edges in quasiplanar graphs, growing far more slowly with k than earlier results suggested. It advances a long-standing problem and offers theoretical insight into these geometric structures.

Polynomial bounds for quasiplanar graphs · Aleksa Milojević, Patryk Morawski, Benny Sudakov et al. · arXiv:2611.21416

Counterexamples to Grad's conjecture of any knot type

The researchers disproved Grad's conjecture by showing stable plasma magnetic fields can take complex knotted shapes without simple symmetries. Plasma may be confined in more intricate ways, potentially opening new avenues for fusion energy research.

Counterexamples to Grad's conjecture of any knot type · Alberto Enciso, Javier Peñafiel-Tomás, Daniel Peralta-Salas · arXiv:2611.21574

Odd faces as a parameter for maximum independent set in embedded graphs

An efficient algorithm finds the largest set of unconnected points in networks on surfaces like a plane or torus with few odd faces. It resolves several open questions and makes the problem solvable for many important graph types.

Odd faces as a parameter for maximum independent set in embedded graphs · Samuel Fiorini, Stefan Kober, Caleb McFarland · arXiv:2611.21256

An Implementation of the 3-Dimensional Extended Persistent Homology Transform

The authors give a practical method that describes a complex 3D object's shape by tracking holes and connected parts as slices change direction. This offers a shape-aware analysis tool for comparing complex 3D data such as medical scans and material structures.

An Implementation of the 3-Dimensional Extended Persistent Homology Transform · Kiyoshi Takeuchi-Romo, Vanessa Robins · arXiv:2611.20413

Stochastic control representations for extremal solutions of HJB Dirichlet problems with measurable coefficients

For randomly changing systems with irregular behavior, the optimal cost is the smallest of several possible solutions to the usual equations. This helps find the correct outcome for noisy systems when approximations might mislead.

Stochastic control representations for extremal solutions of HJB Dirichlet problems with measurable coefficients · David Criens, Hyungbin Park, Jongjin Park · arXiv:2611.21092

Cyclic Hasse diagrams of manifolds and noncommutative path cohomology

The authors introduce path cohomology, an algebraic tool that studies manifolds as special directed graphs; its product often depends on order. It shows path cohomology can differ from classical invariants, with counterexamples to a fundamental formula.

Cyclic Hasse diagrams of manifolds and noncommutative path cohomology · Sergei O. Ivanov, Hequn Zhang · arXiv:2611.19813

The fastest series for $1/π$ due to Ramanujan. Proofs from modular polynomials

A systematic method to rigorously prove the incredibly efficient formulas Ramanujan discovered for calculating pi, including the very fastest ones. This is fascinating because it provides a solid mathematical foundation for these powerful series, which are still crucial for high-precision computations today.

The fastest series for $1/π$ due to Ramanujan. Proofs from modular polynomials · Jesús Guillera · arXiv:1911.03968

Ramanujan-type formulae for $1/π$: A second wind?

It revisits Ramanujan's pi formulas and their proofs, while new related formulas are being discovered and some await proof. It records current activity: new related formulas are being found, and some await proof.

Ramanujan-type formulae for $1/π$: A second wind? · Wadim Zudilin · arXiv:0712.1332

A method for proving Ramanujan series for $1/π$

A general method aims to prove why Ramanujan's 17 pi formulas work, formulas listed over a century ago. It aims to give a unified understanding of formulas that have intrigued researchers for over a century.

A method for proving Ramanujan series for $1/π$ · Jesús Guillera · arXiv:1807.07394

A detailed proof of the Chudnovsky formula with means of basic complex analysis -- Ein ausführlicher Beweis der Chudnovsky-Formel mit elementarer Funktionentheorie

The authors give a detailed, self contained proof of the Chudnovsky formula for pi using basic complex analysis and prove needed theorems from scratch. It makes a powerful pi formula easier to follow by proving the required advanced theorems from scratch.

A detailed proof of the Chudnovsky formula with means of basic complex analysis -- Ein ausführlicher Beweis der Chudnovsky-Formel mit elementarer Funktionentheorie · Lorenz Milla · arXiv:1809.00533

Ramanujan-type formulae for $1/π$: the art of translation

A new method for proving those incredibly precise formulas Ramanujan discovered for calculating pi. The core idea is to "translate" difficult mathematical expressions into a simpler form where their values can be easily computed.

Ramanujan-type formulae for $1/π$: the art of translation · Jesús Guillera, Wadim Zudilin · arXiv:1302.0548

All Gazettes · Mathematics Scholars Collective