Search

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., Comment: 30 pages, 8 figures

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., Comment: 26 pages, 5 figures

In this paper we discuss face numbers of generalised triangulations of manifolds in arbitrary dimensions. This is motivated by the study of triangulations of simply connected $4$-manifolds: We observe that, for a triangulation $\mathcal{T}$ of a simply connected $4$-manifold $\mathcal{M}$ with $n$ pentachora, an upper bound on the number of vertices $v$ of $\mathcal{T}$ as a function of $n$ yields a lower bound for $n$ depending only on the second Betti number $\beta_2(\mathcal{M})$ of $\mathcal{M}$. Within this framework we conjecture that $v \leq \frac{n}{2}+4$, implying $n \geq 2\beta_2(\mathcal{M})$. In forthcoming work by the authors, this conjectured bound is shown to be almost tight for all values of $\beta_2(\mathcal{M})$, with a gap of at most two. We extend our conjecture to arbitrary dimensions and show that an $n$-facet triangulation of an odd-dimensional $d$-manifold, $n \geq d$, can have at most $n + \frac{d-1}{2}$ vertices, and conjecture that, for $d$ even, the bound is $\frac{n}{2}+d$. We show that these (conjectured) bounds are (would be) tight for all odd (even) dimensions and all values of $n \geq d$. Finally, we give necessary conditions for the dual graph of $\mathcal{T}$ to satisfy our conjecture. We furthermore present families of $4$-dimensional pseudomanifolds with singularities in their edge links that have more than $\frac{n}{2}+4$ vertices, thereby proving that the manifold condition is necessary for our conjecture to hold., Comment: 29 pages, 6 figures, 3 tables, 2 pages of appendix

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., Comment: 29 pages, 6 figures

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., Comment: 31 pages, 8 figures, 5 pages of appendix

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., Comment: 22 pages, 19 figures. The appendix has been extended

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$., Comment: 12 pages, 17 figures

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., Comment: 23 pages, 10 figures, 3 tables

Previous work of the authors with Bus Jaco determined a lower bound on the complexity of cusped hyperbolic 3-manifolds and showed that it is attained by the monodromy ideal triangulations of once-punctured torus bundles. This paper exhibits an infinite family of minimal ideal triangulations of Dehn fillings on the link $8^3_9$ that also attain this lower bound on complexity., Comment: 18 pages, 10 figures, 3 tables

We give three algorithms to determine the crosscap number of a knot in the 3-sphere using $0$-efficient triangulations and normal surface theory. Our algorithms are shown to be correct for a larger class of complements of knots in closed 3-manifolds. The crosscap number is closely related to the minimum over all spanning slopes of a more general invariant, the slope norm. For any irreducible 3-manifold $M$ with incompressible boundary a torus, we give an algorithm that, for every slope on the boundary that represents the trivial class in $H_1(M; \mathbb{Z}_2)$, determines the maximal Euler characteristic of any properly embedded surface having a boundary curve of this slope. We complement our theoretical work with an implementation of our algorithms, and compute the crosscap number of knots for which previous methods would have been inconclusive. In particular, we determine 196 previously unknown crosscap numbers in the census of all knots with up to 12 crossings., Comment: 36 pages, 14 figures, 2 tables. Improved algorithms to work in quadrilateral coordinates and included computational results

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$., Comment: 11 pages + appendix, 7 figures

Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of this concept, called simple-homotopy equivalence: two simplicial complexes are of the same simple-homotopy type if they can be transformed into each other by a sequence of two basic homotopy equivalences, an elementary collapse and its inverse, an elementary expansion. In this article we consider the following related problem: given a 2-dimensional simplicial complex, is there a simple-homotopy equivalence to a 1-dimensional simplicial complex using at most p expansions? We show that the problem, which we call the erasability expansion height, is W[P]-complete in the natural parameter p., Comment: 15 pages, 2 figures

For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested in polynomial time, and for every $f$-vector of $3$-polytopes, there exists an inscribable polytope with that $f$-vector. For higher-dimensional polytopes, much less is known. Of course, for any inscribable polytope, all of its lower-dimensional faces need to be inscribable, but this condition does not appear to be very strong. We observe non-trivial new obstructions to the inscribability of polytopes that arise when imposing that a certain inscribable face be inscribed. Using this obstruction, we show that the duals of the $4$-dimensional cyclic polytopes with at least $8$ vertices---all of whose faces are inscribable---are not inscribable. This result is optimal in the following sense: We prove that the duals of the cyclic $4$-polytopes with up to $7$ vertices are, in fact, inscribable. Moreover, we interpret this obstruction combinatorially as a forbidden subposet of the face lattice of a polytope, show that $d$-dimensional cyclic polytopes with at least $d+4$ vertices are not circumscribable, and that no dual of a neighborly $4$-polytope with $8$ vertices, that is, no polytope with $f$-vector $(20,40,28,8)$, is inscribable., Comment: 27 pages, 10 Figures, 4 Tables, 2 Appendices

Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth of a compact, connected 3-manifold $M$ defined by \[ \operatorname{tw}(M) = \min\{\operatorname{tw}(\Gamma(\mathcal{T})):\mathcal{T}~\text{is a triangulation of }M\}, \] where $\Gamma(\mathcal{T})$ denotes the dual graph of $\mathcal{T}$. In this setting the relationship between the topology of a 3-manifold and its treewidth is of particular interest. First, as a corollary of work of Jaco and Rubinstein, we prove that for any closed, orientable 3-manifold $M$ the treewidth $\operatorname{tw}(M)$ is at most $4\mathfrak{g}(M)-2$ where $\mathfrak{g}(M)$ denotes the Heegaard genus of $M$. In combination with our earlier work with Wagner, this yields that for non-Haken manifolds the Heegaard genus and the treewidth are within a constant factor. Second, we characterize all 3-manifolds of treewidth one: These are precisely the lens spaces and a single other Seifert fibered space. Furthermore, we show that all remaining orientable Seifert fibered spaces over the 2-sphere or a non-orientable surface have treewidth two. In particular, for every spherical 3-manifold we exhibit a triangulation of treewidth at most two. Our results further validate the parameter of treewidth (and other related parameters such as cutwidth, or congestion) to be useful for topological computing, and also shed more light on the scope of existing FPT algorithms in the field., Comment: 34 pages, 30 figures, 1 table

We study a variation of Bagchi and Datta's $\sigma$-vector of a simplicial complex $C$, whose entries are defined as weighted averages of Betti numbers of induced subcomplexes of $C$. We show that these invariants satisfy an Alexander-Dehn-Sommerville type identity, and behave nicely under natural operations on triangulated manifolds and spheres such as connected sums and bistellar flips. In the language of commutative algebra, the invariants are weighted sums of graded Betti numbers of the Stanley-Reisner ring of $C$. This interpretation implies, by a result of Adiprasito, that the Billera-Lee sphere maximizes these invariants among triangulated spheres with a given $f$-vector. For the first entry of $\sigma$, we extend this bound to the class of strongly connected pure complexes. As an application, we show how upper bounds on $\sigma$ can be used to obtain lower bounds on the $f$-vector of triangulated $4$-manifolds with transitive symmetry on vertices and prescribed vector of Betti numbers., Comment: 40 pages, 5 figures. Changes from v1: new title; some proofs shortened, and some omitted. This version has been accepted for publication in The Electronic Journal of Combinatorics