activity
20032023
most citedMulti-objective integer programming: An improved recursive algorithm

81 citations · 403 across the 47 of their papers we have counts for

collaborators
Showing math.GTShow all

42 papers · 1 filter

math.GT2023★ 1 cited

Finding large counterexamples by selectively exploring the Pachner graph

Benjamin A. Burton, Alexander He

We often rely on censuses of triangulations to guide our intuition in -manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexample…

math.GT2022★ 2 cited

Arc diagrams on 3-manifold spines

Jack Brand, Benjamin A. Burton, Zsuzsanna Dancso +3

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 projecti…

math.GT2021

Hard Diagrams of the Unknot

Benjamin A. Burton, Hsien-Chih Chang, Maarten Löffler +5

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…

math.GT2018

Computing closed essential surfaces in 3-manifolds

Benjamin A. Burton, Stephan Tillmann

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 th…

math.GT2017

The HOMFLY-PT polynomial is fixed-parameter tractable

Benjamin A. Burton

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 t…

math.GT2016

Finding non-orientable surfaces in 3-manifolds

Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner

We investigate the complexity of finding an embedded non-orientable surface of Euler genus in a triangulated -manifold. This problem occurs both as a natural question in low…