SearcharxivSearch

arXiv subjects

Jonathan Spreer

Publications and source records attributed to Jonathan Spreer.

At least 19 recordsLinked to original sources

Triangulating Spun 2-Knot Complements

A $2$-knot is an embedding of a $2$-sphere into the $4$-sphere. Similar to the case of embedding circles into the $3$-sphere, this allows the $2$-sphere to be knotted. In this short paper, we present an algorithm to generate triangulations of the exteriors of $2$-knots obtained by spinning $1$-knots. We give an implementation of the algorithm in \emph{Regina} and present triangulations of exteriors obtained from all $1$-knots with up to eight crossings.

math.GT

The search for exotic knot traces

Two distinct knots are said to be friends if their complements, filled along the 0-slope, produce diffeomorphic 3-manifolds. In this article, we develop a practical algorithm, implemented using SnapPy and Regina, to search for a friend of a given knot. As an application, we construct a census of simple knots that admit friends and use these data to formulate conjectures about knot friends.

math.GT

A census of face-transitive surfaces

A face-transitive surface is a triangulated 2-dimensional manifold whose automorphism group acts transitively on its set of triangles. In this paper, we investigate this class of highly symmetric surface triangulations. We identify seven types of such face-transitive surfaces, splitting up further into a total of thirteen sub-types, distinguished by how their automorphism groups act on them. We use these theoretical results to compute a census of face-transitive surfaces with up to 1280 faces by constructing suitable cycle double covers of cubic node-transitive graphs.

math.CO

A Practical Algorithm for Knot Factorisation

We present an algorithm for computing the prime factorisation of a knot, which is practical in the following sense: using Regina, we give an implementation that works well for inputs of reasonable size, including prime knots from the $19$-crossing census. The main new ingredient in this work is an object that we call an "edge-ideal triangulation", which is what our algorithm uses to represent knots. As other applications, we give an alternative proof that prime knot recognition is in coNP, and present some new complexity results for triangulations. Beyond knots, our work showcases edge-ideal triangulations as a tool for potential applications in $3$-manifold topology.

math.GT

Small Triangulations of Simply Connected 4-Manifolds

We present small triangulations of all connected sums of $\mathbb{CP}^2$ and $S^2 \times S^2$ with the standard piecewise linear structure. Our triangulations have $2\beta_2+2$ pentachora, where $\beta_2$ is the second Betti number of the manifold. By a conjecture of the authors and, independently, Burke, these triangulations have the smallest possible number of pentachora for their respective topological types.

math.GT

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

Hard diagrams of split links

Deformations of knots and links in ambient space can be studied combinatorially on their diagrams via local modifications called Reidemeister moves. While it is well-known that, in order to move between equivalent diagrams with Reidemeister moves, one sometimes needs to insert excess crossings, there are significant gaps between the best known lower and upper bounds on the required number of these added crossings. In this article, we study the problem of turning a diagram of a split link into a split diagram, and we show that there exist split links with diagrams requiring an arbitrarily large number of such additional crossings. More precisely, we provide a family of diagrams of split links, so that any sequence of Reidemeister moves transforming a diagram with $c$ crossings into a split diagram requires going through a diagram with $\Omega(\sqrt{c})$ extra crossings. Our proof relies on the framework of bubble tangles, as introduced by the first two authors, and a technique of Chambers and Liokumovitch to turn homotopies into isotopies in the context of Riemannian geometry.

math.GT

Independence complexes of circle graphs

Independence complexes of circle graphs are purely combinatorial objects. However, when constructed from some diagram of a link $L$, they reveal topological properties of $L$, more specifically, of its Khovanov homology. We analyze the homotopy type of independence complexes of circle graphs, with a focus on those arising when the graph is bipartite. Moreover, we compute (real) extreme Khovanov homology of a $4$-strand pretzel knot using chord diagrams and independence complexes.

math.GT

Triangulations of the 3-sphere with knotted edge

We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial triangulations of the $3$-sphere that we show are smallest possible, up to a constant multiplicative factor.

math.GT

On the complexity of 2-bridge link complements

We reprove a necessary condition for the Sakuma-Weeks triangulation of a 2-bridge link complement to be minimal in terms of the mapping class describing its alternating 4-string braid construction. For the 2-bridge links satisfying this condition we construct explicit angle structures on the Sakuma-Weeks triangulations and compute both multiplicative and additive lower bounds on the complexity of the link complements via volume estimates. These lower bounds are an improvement on existing volume estimates for the 2-bridge links examined.

math.GT

On a volume invariant of 3-manifolds

This paper investigates a real-valued topological invariant of 3-manifolds called topological volume. For a given 3-manifold M it is defined as the smallest volume of the complement of a (possibly empty) hyperbolic link in M. Various refinements of this invariant are given, asymptotically tight upper and lower bounds are determined, and all non-hyperbolic closed 3-manifolds with topological volume of at most 3.07 are classified. Moreover, it is shown that for all but finitely many lens spaces, the volume minimiser is obtained by Dehn filling one of the cusps of the complement of the Whitehead link or its sister manifold.

math.GT

Vertex Bounds in Triangulated $d$-Manifolds and an Application to 4-Manifold Complexity

We investigate face numbers of generalised triangulations of manifolds in arbitrary dimensions. This is motivated by the study of connections between the combinatorics of triangulations and topological properties of their underlying manifolds. For an $n$-facet triangulation of an odd-dimensional $d$-manifold with $n \geq d$, we prove that the number of vertices satisfies $v \leq n + \frac{d - 1}{2}$. Moreover, we show that this bound is tight for all odd $d$ and all $n \geq d$. For even dimensions, we conjecture the bound $v \leq \frac{n}{2} + d$. We prove that, if true, the bound is tight. Although we cannot prove the conjecture for arbitrary generalised triangulations, we prove it in the case of balanced triangulations, and provide a sufficient condition on the dual graph of the triangulation for it to hold. Furthermore, we construct families of $d$-dimensional triangulations with singularities that exceed the bound $v > \frac{n}{2} + d$, thereby demonstrating that the manifold condition is necessary for the validity of the conjecture. Our study is further motivated by an application to triangulations of simply connected $4$-manifolds: For $d=4$, our conjecture implies that a triangulation $\mathcal{T}$ of a simply connected 4-manifold $\mathcal{M}$ with $n$ pentachora satisfies $2\beta_2(\mathcal{M}) \leq n$ as a lower bound on its Matveev complexity - a bound that is known to be best possible up to a very small additive constant.

math.GT

Simplicial cell decompositions of $\mathbb{CP}^{\hspace{.3mm}n}$

According to a well-known result in geometric topology, we have \linebreak $\left (\mathbb{S}^2 \right)^{n}\!\!/\operatorname{Sym}(n) = \mathbb{CP}^{n}$, where $\operatorname{Sym}(n)$ acts on $\left (\mathbb{S}^2 \right)^{n}$ by coordinate permutation. We use this fact to explicitly construct a regular simplicial cell decomposition of $\mathbb{CP}^{n}$ for each $n \geq 2$. In more detail, we start with the standard two triangle crystallisation $S^2_3$ of the $2$-sphere $\mathbb{S}^2$, in its $n$-fold Cartesian product. We then construct a simplicial subdivision of this product and prove that the $\operatorname{Sym}(n)$ quotient of this subdivision yields a simplicial cell decomposition of $\mathbb{CP}^n$. The first derived subdivision of this cell complex is a simplicial triangulation of $\mathbb{CP}^n$. To the best of our knowledge, this is the first explicit description of triangulations of $\mathbb{CP}^n$ for $n \geq 4$.

math.CO

Sampling triangulations of manifolds using Monte Carlo methods

We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed by combining (bi-stellar) moves with suitable chosen accept/reject probabilities (Metropolis-Hastings). Asymptotically, the method guarantees that samples of triangulations are drawn at random from a chosen probability. This enables us not only to sample (rare) triangulations of particular interest but also to estimate the (extremely small) probability of obtaining them when isomorphism types of triangulations are sampled uniformly at random. We implement our general method for surface triangulations and 1-vertex triangulations of 3-manifolds. To showcase its usefulness, we present a number of experiments: (a) we recover asymptotic growth rates for the number of isomorphism types of simplicial triangulations of the 2-dimensional sphere; (b) we experimentally observe that the growth rate for the number of isomorphism types of 1-vertex triangulations of the 3-dimensional sphere appears to be singly exponential in the number of their tetrahedra; and (c) we present experimental evidence that a randomly chosen isomorphism type of 1-vertex n-tetrahedra 3-sphere triangulation, for n tending to infinity, almost surely shows a fixed edge-degree distribution which decays exponentially for large degrees, but shows non-monotonic behaviour for small degrees.

math.CO

Hopf triangulations of spheres and equilibrium triangulations of projective spaces

Following work by the first author and Banchoff, we investigate triangulations of real and complex projective spaces of real and complex dimension $k$ that are adapted to the decomposition into "zones of influence" around the points $[1,0,\ldots,0],$ $\ldots,$ $[0,\ldots,0,1]$ in homogeneous coordinates. The boundary of such a "zone of influence" must admit a simplicial version of the Hopf decomposition of a sphere into "solid tori" of various dimensions. We present such {\em Hopf triangulations} of $S^{2k-1}$ for $k \leq 4$, and give candidate triangulations for arbitrary $k$. In the complex case, a crucial role of this construction is the central $k$-torus as the intersection of all "zones of influence". Candidate triangulations of the $k$-torus with $2^{k+1}-1$, $k\geq 1$, vertices -- possibly the minimum numbers -- are well known. They admit an involution acting like complex conjugation and an automorphism of order $k+1$ realising the cyclic shift of coordinate directions in $\mathbb{C}P^k$. For $k=2$, this can be extended to what we call a {\em perfect equilibrium triangulation} of $\mathbb{C}P^2$, previously described in the literature. We prove that this is no longer possible for $k=3$, and no perfect equilibrium triangulation of $\mathbb{C}P^3$ exists. In the real case, the central torus is replaced by its fixed-point set under complex conjugation: the vertices of a $k$-dimensional cube. We revisit known equilibrium triangulations of $\mathbb{R}P^k$ for $k\leq 2$, and describe new equilibrium triangulations of $\mathbb{R}P^3$ and $\mathbb{R}P^4$. Finally, we discuss the most symmetric and vertex-minimal triangulation of $\mathbb{R}P^4$ and present a tight polyhedral embedding of $\mathbb{R}P^3$ into 6-space. No such embedding was known before.

math.CO

On the width of complicated JSJ decompositions

Motivated by the algorithmic study of 3-dimensional manifolds, we explore the structural relationship between the JSJ decomposition of a given 3-manifold and its triangulations. Building on work of Bachman, Derby-Talbot and Sedgwick, we show that a "sufficiently complicated" JSJ decomposition of a 3-manifold enforces a "complicated structure" for all of its triangulations. More concretely, we show that, under certain conditions, the treewidth (resp. pathwidth) of the graph that captures the incidences between the pieces of the JSJ decomposition of an irreducible, closed, orientable 3-manifold M yields a linear lower bound on its treewidth tw(M) (resp. pathwidth pw(M)), defined as the smallest treewidth (resp. pathwidth) of the dual graph of any triangulation of M. We present several applications of this result. We give the first example of an infinite family of bounded-treewidth 3-manifolds with unbounded pathwidth. We construct Haken 3-manifolds with arbitrarily large treewidth; previously the existence of such 3-manifolds was only known in the non-Haken case. We also show that the problem of providing a constant-factor approximation for the treewidth (resp. pathwidth) of bounded-degree graphs efficiently reduces to computing a constant-factor approximation for the treewidth (resp. pathwidth) of 3-manifolds.

math.GT

A Uniform Sampling Procedure for Abstract Triangulations of Surfaces

We present a procedure to sample uniformly from the set of combinatorial isomorphism types of balanced triangulations of surfaces - also known as graph-encoded surfaces. For a given number $n$, the sample is a weighted set of graph-encoded surfaces with $2n$ triangles. The sampling procedure relies on connections between graph-encoded surfaces and permutations, and basic properties of the symmetric group. We implement our method and present a number of experimental findings based on the analysis of $138$ million runs of our sampling procedure, producing graph-encoded surfaces with up to $280$ triangles. Namely, we determine that, for $n$ fixed, the empirical mean genus $\bar{g}(n)$ of our sample is very close to $\bar{g}(n) = \frac{n-1}{2} - (16.98n -110.61)^{1/4}$. Moreover, we present experimental evidence that the associated genus distribution more and more concentrates on a vanishing portion of all possible genera as $n$ tends to infinity. Finally, we observe from our data that the mean number of non-trivial symmetries of a uniformly chosen graph encoding of a surface decays to zero at a rate super-exponential in $n$.

math.CO

Complexity of 3-manifolds obtained by Dehn filling

Let $M$ be a compact 3--manifold with boundary a single torus. We present upper and lower complexity bounds for closed 3--manifolds obtained as even Dehn fillings of $M.$ As an application, we characterise some infinite families of even Dehn fillings of $M$ for which our method determines the complexity of its members up to an additive constant. The constant only depends on the size of a chosen triangulation of $M$, and the isotopy class of its boundary. We then show that, given a triangulation $\mathcal T$ of $M$ with $2$--triangle torus boundary, there exist infinite families of even Dehn fillings of $M$ for which we can determine the complexity of the filled manifolds with a gap between upper and lower bound of at most $13 |\mathcal T| + 7.$ This result is bootstrapped to obtain the gap as a function of the size of an ideal triangulation of the interior of $M$, or the number of crossings of a knot diagram. We also show how to compute the gap for explicit families of fillings of knot complements in the three-sphere. The practicability of our approach is demonstrated by determining the complexity up to a gap of at most 10 for several infinite families of even fillings of the figure eight knot, the pretzel knot $P(-2,3,7)$, and the trefoil.

math.GT