Related papers: Finding planar surfaces in knot- and link-manifold…

We show that two properly embedded compact surfaces in an orientable 4-manifold are cobordant if and only if they are $\mathbb{Z}/2$-homologous and either the 4-manifold has boundary or the surfaces have the same normal Euler number. If the…

We consider closed acylindrical surfaces in 3-manifolds and in knot and link complements, and show that the genus of these surfaces is bounded linearly by the number of tetrahedra in the triangulation of the manifold and by the number of…

For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The…

The operation of crushing a normal surface has proven to be a powerful tool in computational $3$-manifold topology, with applications both to triangulation complexity and to algorithms. The main difficulty with crushing is that it can…

Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…

We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian…

We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance…

In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…

Thin film processing by means of sputter deposition inherently depends on the interaction of energetic particles with a target surface and the subsequent particle transport. The length and time scales of the underlying physical phenomena…

We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…

Meier and Zupan showed that every surface in the four-sphere admits a bridge trisection and can therefore be represented by three simple tangles. This raises the possibility of applying methods from link homology to knotted surfaces. We use…

Versions of the following problem appear in several topics such as Gamma Knife radiosurgery, studying objects with the X-ray transform, the 3SUM problem, and the $k$-linear degeneracy testing. Suppose there are $n$ points on a plane whose…

We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…

This} paper presents relations between least area and normal surfaces, embedded in either a Euclidean or hyperbolic $3$-manifold. A relaxed version of normal surfaces, termed quasi-normal, is introduced, and it is shown that under…

We present Twisted Edges, a unified framework for designing Linked Knot (LK) structures using labeled non-manifold surface meshes. While the concept of edge twists, originating in topological graph theory, is foundational to these designs,…

We generalize a theorem of Finkelstein and Moriah and show that if a link $L$ has a $2n$-plat projection satisfying certain conditions, then its complement contains some closed essential surfaces. In most cases these surfaces remain…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

We consider three different questions related to the Steklov and mixed Steklov problems on surfaces. These questions are connected by the techniques that we use to study them, which exploit symmetry in various ways even though the surfaces…

Motivated by the L-space conjecture, we investigate various notions of order-detection of slopes on knot manifolds. These notions are designed to characterise when rational homology 3-spheres obtained by gluing compact manifolds along torus…

Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…