Pure Math · Mathematics & Statistics
Geometric Topology
The newest papers in Geometric Topology that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
55 papers, from 31 August 2026 to 5 November 2026: 50 OpenAlex records and 5 arXiv preprints.
Get the few papers worth your time in Geometric Topology every morning.
Follow Geometric Topology and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers
Using Transformers to Generate 3-Manifold Triangulations
Using dehydration signatures as an encoding, we train GPT-2-style transformers to generate triangulations of 3-dimensional manifolds.A proof of the Murty--Simon conjecture on diameter-$2$-critical graphs
The Murty-Simon conjecture states that every $n$-vertex diameter-$2$-critical graph has at most $\lfloor n^2/4 \rfloor$ edges, with equality only for the balanced complete bipartite graph.Mutation-acyclicity in rank four is decidable but not semialgebraic
We prove that mutation-acyclicity of quivers on four vertices is decidable.Contributions to the Stable Derived Categories of Gorenstein Rings
The stable derived category $D_{sg}(R)$ of a Gorenstein ring $R$ is the Verdier quotient of the bounded derived category $D^b(\mathsf{mod}\, R)$ by the thick subcategory of perfect complexes, and…Deterministic Root-Finding over Finite Fields with Elliptic Curves
Finding the roots of a polynomial over a finite field $\mathbb F_q$ in deterministic polynomial time is a long-standing open problem.Bistability with equal and independent removal in small bimolecular networks
We classify two-species mass-action networks with at most three internal directed reactions on $\{X,Y,2X,X+Y,2Y\}$, positive inflows, and linear removal of both species.Non-planar contact structures with Calabi-Yau Fillings and topological quantum computation
This paper is a non-planar counterpart of the author's earlier work on planar contact structures and topological quantum computation.An example of a non-sofic hyperbolic group
We construct a torsion-free, two-dimensional, word-hyperbolic group which is not sofic.A simpler proof that there are no Landau--Siegel zeros
This paper simplifies the recent OpenAI proof that there are no Landau--Siegel zeros.Failure of direct finiteness for group algebras in every odd characteristic
For every odd prime $p$, we construct a finitely presented group $G_p$ and elements $a,b,c\in\mathbb{F}_p[G_p]$ such that $ab=1$, $ac=0$, and $c\ne0$.On the Hardy--Littlewood--Chowla conjecture
An old conjecture dating back at least to Hildebrand's work in 1989, asserts that the Möbius function exhibits cancellation on shifted primes; that is, $$\sum_{p\le x}μ(p+2)=o(π(x)),\quad \text{or…Connectivity keeping pendant extensions of paths in $k$-connected triangle-free graphs
Motivated by Mader's conjecture on connectivity keeping trees, we study the corresponding problem in triangle-free graphs.Kaplansky's conjectures fail for torsion-free hyperbolic groups in positive characteristic
Do Kaplansky's group-ring conjectures hold for torsion-free word-hyperbolic groups?The symmetry group of Turk's head knots
For p, q >= 3 with gcd(p,q) = 1 we show that the symmetry group of the Turk's head knot Th(p,q), the closure of the braid (sigma_1 sigma_2^{-1} sigma_3 sigma_4^{-1} ... sigma_{p-1}^{+-1})^q, is the…A Counterexample to Three Conjectures of Luo
We give a single counterexample to Conjectures 1--3 as stated in Luo's paper: a minimal two-tetrahedron triangulation of the lens space L(3,1) with a null-homotopic loop edge.Ordinary and measurable colorings of Euclidean three-space
A proper coloring of Euclidean space is a coloring that assigns different colors to points at distance one.Finiteness of planar central configurations of five bodies for all positive masses
We prove that for every choice of five positive masses the planar five-body problem has finitely many central configurations up to similarity.Measurable obstructions for unmeasurable colourings
Due to the availability of powerful analytic techniques, vastly superior lower bounds are known for the measurable chromatic number of Euclidean spaces compared to their ordinary chromatic number.Computations of the slice genus and the unknotting number of links via machine learning
Links are disjoint unions of circles smoothly embedded in $S^3$.An AI-Assisted Formalization of the Poincaré Conjecture
We present an AI-assisted Lean 4 formalization of the Poincaré conjecture.