Related papers: Complexity of links in 3-manifolds

We view closed orientable 3-manifolds as covers of S^3 branched over hyperbolic links. For a p-fold cover M \to S^3, branched over a hyperbolic link L, we assign the complexity p Vol(S^3 minus L) (where Vol is the hyperbolic volume). We…

We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…

For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…

We give a new, elementary proof of what we believe is the simplest known example of a ``natural'' problem in computational 3-dimensional topology that is $\mathsf{NP}$-hard -- namely, the \emph{Trivial Sublink Problem}: given a diagram $L$…

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…

A previously proposed two-step algorithm for calculating the expectation values of Chern-Simons graphs fails to determine certain crucial signs. The step which involves calculating tetrahedra by solving certain non- linear equations is…

We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…

It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for instance, every 3-manifold has a surgery diagram. There are several proofs of this fact, including constructive proofs, but there has been little attention to the…

Let T be a triangulation of S^3 containing a link L in its 1-skeleton. We give an explicit lower bound for the number of tetrahedra of T in terms of the bridge number of L. Our proof is based on the theory of almost normal surfaces.

We introduce a notion of "quasi-right-veering" for closed braids, which plays an analogous role to "right-veering" for open books. We show that a transverse link $K$ in a contact 3-manifold $(M,\xi)$ is non-loose if and only if every braid…

We study spaces of circle-valued angle structures, introduced by Feng Luo, on ideal triangulations of 3-manifolds. We prove that the connected components of these spaces are enumerated by certain cohomology groups of the 3-manifold with…

By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing…

An R-link is an $n$-component link $L$ in $S^3$ such that Dehn surgery on $L$ yields $\#^n(S^1 \times S^2)$. Every R-link $L$ gives rise to a geometrically simply-connected homotopy 4-sphere $X_L$, which in turn can be used to produce a…

We give a simple interpretation of the adapted complex structure of Lempert-Szoke and Guillemin-Stenzel: it is given by a polar decomposition of the complexified manifold. We then give a twistorial construction of an SO(3)-invariant…

A cobordism between links in thickened surfaces consists of a surface $ S $ and a $3$-manifold $M $, with $ S $ properly embedded in $ M \times I $. We show that there exist links in thickened surfaces such that if $(S,M) $ is a cobordism…

The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…

The intersection index at a common point of two analytic varieties of complementary dimensions in $\Bbb C^n$ is positive. This observation, which has been called a ``cornerstone'' of algebraic geometry ([GH, p.~62]), is a simple consequence…

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…

There is one generalization of fibered links in 3-manifolds, called homologically fibered links. It is known that the existence of homologically fibered links whose fiber surface has a given homeomorphic type is determined by the first…

The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…