The next 350 million knots
BA Burton - 36th International Symposium on Computational …, 2020 - drops.dagstuhl.de
The tabulation of all prime knots up to a given number of crossings was one of the founding
problems of knot theory in the 1800s, and continues to be of interest today. Here we extend …
problems of knot theory in the 1800s, and continues to be of interest today. Here we extend …
On the treewidth of triangulated 3-manifolds
In graph theory, as well as in 3-manifold topology, there exist several width-type parameters
to describe how" simple" or" thin" a given graph or 3-manifold is. These parameters, such as …
to describe how" simple" or" thin" a given graph or 3-manifold is. These parameters, such as …
A-polynomials of fillings of the Whitehead sister
Knots obtained by Dehn filling the Whitehead sister include some of the smallest volume
twisted torus knots. Here, using results on A-polynomials of Dehn fillings, we give formulas …
twisted torus knots. Here, using results on A-polynomials of Dehn fillings, we give formulas …
On the pathwidth of hyperbolic 3-manifolds
K Huszár - arXiv preprint arXiv:2105.11371, 2021 - arxiv.org
According to Mostow's celebrated rigidity theorem, the geometry of closed hyperbolic 3-
manifolds is already determined by their topology. In particular, the volume of such …
manifolds is already determined by their topology. In particular, the volume of such …
Combinatorial width parameters for 3-dimensional manifolds
K Huszár - 2020 - research-explorer.ista.ac.at
Algorithms in computational 3-manifold topology typically take a triangulation as an input
and return topological information about the underlying 3-manifold. However, extracting the …
and return topological information about the underlying 3-manifold. However, extracting the …