arXiv subjects

Benjamin A. Burton

Publications and source records attributed to Benjamin A. Burton.

At least 19 recordsLinked to original sources

arXiv2026

Small Triangulations of $4$-Manifolds: Introducing the $4$-Manifold Census

We present a framework to classify PL-types of large censuses of triangulated $4$-manifolds, which we use to classify the PL-types of all triangulated $4$-manifolds with up to six pentachora. This is successful except for triangulations homeomorphic to the $4$-sphere, $\mathbb{C}P^2$, and the rational homology sphere $QS^4(2)$, where we find at most four, three, and two PL-types respectively. We conjecture that they are all standard. In addition, we look at the cases resisting classification and discuss the combinatorial structure of these triangulations -- which we deem interesting in their own rights.

math.GT↗

arXiv2025

Computing closed essential surfaces in 3-manifolds

We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to its practicality, we run the algorithm over a comprehensive body of closed 3-manifolds and knot exteriors, yielding results that were not previously known. The algorithm derives from the original Jaco-Oertel framework, involves both enumeration and optimisation procedures, and combines several techniques from normal surface theory. Our methods are relevant for other difficult computational problems in 3-manifold theory, such as the recognition problem for knots, links and 3-manifolds.

math.GT↗

arXiv2025

Connecting 3-manifold triangulations with unimodal sequences of elementary moves

A key result in computational 3-manifold topology is that any two triangulations of the same 3-manifold are connected by a finite sequence of bistellar flips, also known as Pachner moves. One limitation of this result is that little is known about the structure of this sequence; knowing more about the structure could help both proofs and algorithms. Motivated by this, we consider sequences of moves that are "unimodal" in the sense that they break up into two parts: first, a sequence that monotonically increases the size of the triangulation; and second, a sequence that monotonically decreases the size. We prove that any two one-vertex triangulations of the same 3-manifold, each with at least two tetrahedra, are connected by a unimodal sequence of 2-3 and 2-0 moves. We also study the practical utility of unimodal sequences; specifically, we implement an algorithm to find such sequences, and use this algorithm to perform some detailed computational experiments.

math.GT↗

arXiv2025

The Montesinos-Nakanishi 3-move conjecture for links up to 20 crossings

Yasutaka Nakanishi formulated the following conjecture in 1981: every link is 3-move equivalent to a trivial link. While the conjecture was proved for several specific cases, it remained an open question for over twenty years. In 2002, Mieczysław D{\c a}bkowski and the last author showed that it does not hold, in general. In this article, we prove the Montesinos-Nakanishi $3$-move conjecture for links with up to 19 crossings and, with the exception of six pairwise non-isotopic links including the Chen link and its mirror image, for links with 20 crossings. Our work completely classifies links up 20 crossings modulo $3$-moves. This work includes computational methods, including new code in Regina that generalises pre-existing knot functions to work with links.

math.GT↗

arXiv2024

Crushing Surfaces of Positive Genus

The operation of crushing a normal surface has proven to be a powerful tool in computational $3$-manifold topology, with applications both to triangulation complexity and to algorithms. The main difficulty with crushing is that it can drastically change the topology of a triangulation, so applications to date have been limited to relatively simple surfaces: $2$-spheres, discs, annuli, and closed boundary-parallel surfaces. We give the first detailed analysis of the topological effects of crushing closed essential surfaces of positive genus. To showcase the utility of this new analysis, we use it to prove some results about how triangulation complexity interacts with JSJ decompositions and satellite knots; although similar applications can also be obtained using techniques of Matveev, our approach has the advantage that it avoids the machinery of almost simple spines and handle decompositions.

math.GT↗

arXiv2024

Effective Computation of the Heegaard Genus of 3-Manifolds

The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and practical for implementation. Current algorithms use almost normal surfaces, which are an extension of the algorithm-friendly normal surface theory but which add considerable complexity for both running time and implementation. Here we take a different approach: instead of working with almost normal surfaces, we give a general method of modifying the input triangulation that allows us to avoid almost normal surfaces entirely. The cost is just four new tetrahedra, and the benefit is that important surfaces that were once almost normal can be moved to the simpler setting of normal surfaces in the new triangulation. We apply this technique to the computation of Heegaard genus, where we develop algorithms and heuristics that prove successful in practice when applied to a data set of 3,000 closed hyperbolic 3-manifolds; we precisely determine the genus for at least 2,705 of these.

math.GT↗

arXiv2024

Finding large counterexamples by selectively exploring the Pachner graph

We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of triangulations increases super-exponentially with size, there is no way to expand a census beyond relatively small triangulations; the current census only goes up to $10$ tetrahedra. Here, we show that it is feasible to search for large and hard-to-find counterexamples by using heuristics to selectively (rather than exhaustively) enumerate triangulations. We use this idea to find counterexamples to three conjectures which ask, for certain $3$-manifolds, whether one-vertex triangulations always have a "distinctive" edge that would allow us to recognise the $3$-manifold.

math.GT↗

arXiv2023

Arc diagrams on 3-manifold spines

We develop a theory of link projections to trivalent spines of 3-manifolds. We prove a Reidemeister Theorem providing a set of combinatorial moves sufficient to relate the projections of isotopic links. We also show that any link admits a crossingless projection to any special spine and we refine our theorem to provide a set of combinatorial moves sufficient to relate crossingless diagrams. Finally, we discuss the connection to Turaev's shadow world, interpreting our result as a statement about shadow equivalence of a class of 4-manifolds.

math.GT↗

arXiv2021

On the hardness of finding normal surfaces

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms for these problems is normal surface theory. However, we currently have a poor understanding of the computational complexity of problems in normal surface theory: many such problems are still not known to have polynomial-time algorithms, yet proofs of $\mathrm{NP}$-hardness also remain scarce. We give three results that provide some insight on this front. A number of modern normal surface theoretic algorithms depend critically on the operation of finding a non-trivial normal sphere or disc in a $3$-dimensional triangulation. We formulate an abstract problem that captures the algebraic and combinatorial aspects of this operation, and show that this abstract problem is $\mathrm{NP}$-complete. Assuming $\mathrm{P}\neq\mathrm{NP}$, this result suggests that any polynomial-time procedure for finding a non-trivial normal sphere or disc will need to exploit some geometric or topological intuition. Another key operation, which applies to a much wider range of topological problems, involves finding a vertex normal surface of a certain type. We study two closely-related problems that can be solved using this operation. For one of these problems, we give a simple alternative solution that runs in polynomial time; for the other, we prove $\mathrm{NP}$-completeness.

cs.CG↗

arXiv2021

Hard Diagrams of the Unknot

We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying previously proposed methods. The proof of their hardness uses significant computational resources. We also determine that no small "standard" example of a hard unknot diagram requires more than one extra crossing for Reidemeister moves in $\mathbb{S}^2$.

math.GT↗

arXiv2020

Embeddings of 3-manifolds in S^4 from the point of view of the 11-tetrahedron census

This is a collection of notes on embedding problems for 3-manifolds. The main question explored is `which 3-manifolds embed smoothly in the 4-sphere?' The terrain of exploration is the Burton/Martelli/Matveev/Petronio census of triangulated prime closed 3-manifolds built from 11 or less tetrahedra. There are 13766 manifolds in the census, of which 13400 are orientable. Of the 13400 orientable manifolds, only 149 of them have hyperbolic torsion linking forms and are thus candidates for embedability in the 4-sphere. The majority of this paper is devoted to the embedding problem for these 149 manifolds. At present 41 are known to embed. Among the remaining manifolds, embeddings into homotopy 4-spheres are constructed for 4. 67 manifolds are known to not embed in the 4-sphere. This leaves 37 unresolved cases, of which only 3 are geometric manifolds i.e. having a trivial JSJ-decomposition.

math.GT↗

arXiv2018

The Pachner graph of 2-spheres

It is well-known that the Pachner graph of $n$-vertex triangulated $2$-spheres is connected, i.e., each pair of $n$-vertex triangulated $2$-spheres can be turned into each other by a sequence of edge flips for each $n\geq 4$. In this article, we study various induced subgraphs of this graph. In particular, we prove that the subgraph of $n$-vertex flag $2$-spheres distinct from the double cone is still connected. In contrast, we show that the subgraph of $n$-vertex stacked $2$-spheres has at least as many connected components as there are trees on $\lfloor\frac{n-5}{3}\rfloor$ nodes with maximum node-degree at most four.

math.CO↗

arXiv2017

The HOMFLY-PT polynomial is fixed-parameter tractable

Many polynomial invariants of knots and links, including the Jones and HOMFLY-PT polynomials, are widely used in practice but #P-hard to compute. It was shown by Makowsky in 2001 that computing the Jones polynomial is fixed-parameter tractable in the treewidth of the link diagram, but the parameterised complexity of the more powerful HOMFLY-PT polynomial remained an open problem. Here we show that computing HOMFLY-PT is fixed-parameter tractable in the treewidth, and we give the first sub-exponential time algorithm to compute it for arbitrary links.

math.GT↗

arXiv2016

Finding non-orientable surfaces in 3-manifolds

We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into $3$-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.

math.GT↗

arXiv2016

A construction principle for tight and minimal triangulations of manifolds

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying manifold. Tight triangulations are conjectured to be strongly minimal, and proven to be so for dimensions $\leq 3$. However, in spite of substantial theoretical results about such triangulations, there are precious few examples. In fact, apart from dimension two, we do not know if there are infinitely many of them in any given dimension. In this paper, we present a computer-friendly combinatorial scheme to obtain tight triangulations, and present new examples in dimensions three, four and five. Furthermore, we describe a family of tight triangulated $d$-manifolds, with $2^{d-1} \lfloor d / 2 \rfloor ! \lfloor (d-1) / 2 \rfloor !$ isomorphically distinct members for each dimension $d \geq 2$. While we still do not know if there are infinitely many tight triangulations in a fixed dimension $d > 2$, this result shows that there are abundantly many.

math.GT↗

arXiv2015

Separation index of graphs and stacked 2-spheres

In 1987, Kalai proved that stacked spheres of dimension $d\geq 3$ are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension $d=2$. In this article, we give a characterisation of stacked $2$-spheres using what we call the {\em separation index}. Namely, we show that the separation index of a triangulated $2$-sphere is maximal if and only if it is stacked. In addition, we prove that, amongst all $n$-vertex triangulated $2$-spheres, the separation index is {\em minimised} by some $n$-vertex flag sphere for $n\geq 6$. Furthermore, we apply this characterisation of stacked $2$-spheres to settle the outstanding $3$-dimensional case of the Lutz-Sulanke-Swartz conjecture that "tight-neighbourly triangulated manifolds are tight". For dimension $d\geq 4$, the conjecture has already been proved by Effenberger following a result of Novik and Swartz.

math.GT↗

arXiv2015

Algorithms and complexity for Turaev-Viro invariants

The Turaev-Viro invariants are a powerful family of topological invariants for distinguishing between different 3-manifolds. They are invaluable for mathematical software, but current algorithms to compute them require exponential time. The invariants are parameterised by an integer $r \geq 3$. We resolve the question of complexity for $r=3$ and $r=4$, giving simple proofs that computing Turaev-Viro invariants for $r=3$ is polynomial time, but for $r=4$ is \#P-hard. Moreover, we give an explicit fixed-parameter tractable algorithm for arbitrary $r$, and show through concrete implementation and experimentation that this algorithm is practical---and indeed preferable---to the prior state of the art for real computation.

math.GT↗

arXiv2014

On the Complexity of Immersed Normal Surfaces

Normal surface theory, a tool to represent surfaces in a triangulated 3-manifold combinatorially, is ubiquitous in computational 3-manifold theory. In this paper, we investigate a relaxed notion of normal surfaces where we remove the quadrilateral conditions. This yields normal surfaces that are no longer embedded. We prove that it is NP-hard to decide whether such a surface is immersed. Our proof uses a reduction from Boolean constraint satisfaction problems where every variable appears in at most two clauses, using a classification theorem of Feder. We also investigate variants, and provide a polynomial-time algorithm to test for a local version of this problem.

math.GT↗