Related papers: 3-Manifold triangulations with small treewidth

Given a manifold M, it is natural to ask in how many ways it fibers (we mean fibering in a general way, where the base might be an orbifold -- this could be described as Seifert fibering)There are group-theoretic obstructions to the…

A classical question in quantitative topology is to bound the mapping degree $\operatorname{deg}(f)$ in terms of its Lipchitz constant $\operatorname{Lip}(f)$. For a closed, oriented manifold $M$, the flexible exponent $\alpha(M)$ is the…

In this paper we define, for each aspherical orientable 3-manifold $M$ endowed with a \emph{torus splitting} $\c{T}$, a 2-dimensional fundamental $l_1$-class $[M]^{\c{T}}$ whose $l_1$-norm has similar properties as the Gromov simplicial…

It is not completely unreasonable to expect that a computable function bounding the number of Pachner moves needed to change any triangulation of a given 3-manifold into any other triangulation of the same 3-manifold exists. In this paper…

Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson and Seymour (1983) proved that for every tree~$T$, the class of graphs that do not contain $T$ as a minor has bounded…

Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…

We prove that 1) There exist infinitely many non-trivial codimension one "thick" knots in $\mathbb{R}^5$; 2) For each closed four-dimensional smooth manifold $M$ and for each sufficiently small positive $\epsilon$ the set of isometry…

We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…

Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices,…

Let $S$ be a surface of negative Euler characteristic and consider a finite filling collection $\Gamma$ of closed curves on $S$ in minimal position. An observation of Foulon and Hasselblatt shows that $PT(S) \setminus \hat{\Gamma}$ is a…

Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…

We discuss a possible definition for "$k$-width" of both a closed $d$-manifold $M^d$, and on embedding $M^d \overset{e}{\hookrightarrow} \mathbb{R}^n$, $n > d \ge k$, generalizing the classical notion of width of a knot. We show that for…

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

We introduce a new technique for finding lower bounds on the Heegaard genus of a 3-manifold obtained by gluing a pair of 3-manifolds together along an incompressible torus or annulus. We deduce a number of inequalities, including one which…

Sparse structures are frequently sought when pursuing tractability in optimization problems. They are exploited from both theoretical and computational perspectives to handle complex problems that become manageable when sparsity is present.…

Let M and M' be simple 3-manifolds, each with connected boundary of genus at least two. Suppose that M and M' are glued via a homeomorphism between their boundaries. Then we show that, provided the gluing homeomorphism is `sufficiently…

Treewidth is an important graph invariant, relevant for both structural and algorithmic reasons. A necessary condition for a graph class to have bounded treewidth is the absence of large cliques. We study graph classes closed under taking…

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…

The Heegaard genus g of an irreducible closed orientable 3-manifold puts a limit on the number and complexity of the pieces that arise in the Jaco-Shalen-Johannson decomposition of the manifold by its canonical tori. For example, if p of…