English
Related papers

Related papers: Filling braided links with trisected surfaces

200 papers

Meier and Zupan introduced bridge trisections of surface links in $S^4$ as a 4-dimensional analogue to bridge decompositions of classical links, which gives a numerical invariant of surface links called the bridge number. We prove that…

Geometric Topology · Mathematics 2024-04-08 Kouki Sato , Kokoro Tanaka

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $\Gamma$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,\Gamma)$-c-weakly reducible in…

Geometric Topology · Mathematics 2014-03-17 Scott Taylor , Maggy Tomova

If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…

Geometric Topology · Mathematics 2018-07-25 Marion Campisi , Matt Rathbun

Let $S$ be a $P^2$-knot which is the connected sum of a 2-knot with normal Euler number 0 and an unknotted $P^2$-knot with normal Euler number $\pm2$ in a closed 4-manifold $X$ with trisection $T_{X}$. Then, we show that the trisection of…

Geometric Topology · Mathematics 2023-07-21 Tsukasa Isoshima

We consider 3-dimensional pseudo-manifolds M with a given set of marked point V such that M-V is the interior of a compact 3-manifold with boundary. An ideal triangulation T of (M, V ) has V as its set of vertices. A branching (T, b)…

Geometric Topology · Mathematics 2019-04-01 Riccardo Benedetti

Finite pieces of locally isostatic networks have a large number of floppy modes because of missing constraints at the surface. Here we show that by imposing suitable boundary conditions at the surface, the network can be rendered…

Disordered Systems and Neural Networks · Physics 2017-11-15 Louis Theran , Anthony Nixon , Elissa Ross , Mahdi Sadjadi , Brigitte Servatius , M. F. Thorpe

We study the booklink, a braid-like embedding with local maxima and minima, and the bridge-braid spectrum of a link, which captures the smallest number of braid-strands in a booklink with a prescribed number of critical points. This…

Geometric Topology · Mathematics 2024-11-18 Margaret Doig , Chase Gehringer

A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…

Combinatorics · Mathematics 2026-01-16 Meike Weiß , Reymond Akpanya , Alice C. Niemeyer

An {\em odd hole} in a graph is an induced subgraph which is a cycle of odd length at least five. An {\em odd parachute} is a graph obtained from an odd hole $H$ by adding a new edge $uv$ such that $x$ is adjacent to $u$ but not to $v$ for…

Combinatorics · Mathematics 2025-04-08 Kaiyang Lan , Feng Liu , Di Wu , Yidong Zhou

We show that a transverse link in a contact structure supported by an open book decomposition can be transversely braided. We also generalize Markov's theorem on when the closures of two braids represent (transversely) isotopic links.

Geometric Topology · Mathematics 2015-03-13 Elena Pavelescu

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

Combinatorics · Mathematics 2016-09-06 Neil Robertson , Paul Seymour , Robin Thomas

We give an explicit description of a fibration of the complement of the closure of a homogeneous braid, understanding how each fiber intersects every cross-section of $S^3$.

Geometric Topology · Mathematics 2023-06-23 Maggie Miller

We show that any 4-manifold admitting a $(g;k_1,k_2,0)$-trisection is an irregular 3-fold cover of the 4-sphere whose branching set is a surface in $S^4$, smoothly embedded except for one singular point which is the cone on a link. A…

Geometric Topology · Mathematics 2024-09-20 Ryan Blair , Patricia Cahn , Alexandra Kjuchukova , Jeffrey Meier

We show that if two 3-manifolds with toroidal boundary are glued via a `sufficiently complicated' map then every Heegaard splitting of the resulting 3-manifold is weakly reducible. Additionally, if Z is a manifold obtained by gluing X and…

Geometric Topology · Mathematics 2009-09-29 David Bachman , Saul Schleimer , Eric Sedgwick

In the mid eighties Goldman proved an embedded curve could be isotoped to not intersect a closed geodesic if and only if their Lie bracket (as defined in that work) vanished. Goldman asked for a topological proof and about extensions of the…

Geometric Topology · Mathematics 2016-11-16 Moira Chas , Siddhartha Gadgil

The I-patch is a multi-sided surface representation, defined as a combination of implicit ribbon and bounding surfaces, whose pairwise intersections determine the natural boundaries of the patch. Our goal is to show how a collection of…

Computational Geometry · Computer Science 2022-04-26 Ágoston Sipos , Tamás Várady , Péter Salvi

Cable subsystems characterized by long, slender, and flexible structural elements are featured in numerous engineering systems. In each of them, interaction between an individual cable and the surrounding fluid is inevitable. Such a…

Computational Engineering, Finance, and Science · Computer Science 2019-11-11 Daniel Z. Huang , Philip Avery , Charbel Farhat

We describe an algorithm that takes as input an open book decomposition of a closed oriented 4-manifold and outputs an explicit trisection diagram of that 4-manifold. Moreover, a slight variation of this algorithm also works for open books…

Geometric Topology · Mathematics 2026-02-10 Marc Kegel , Felix Schmäschke

Given a closed oriented PL four-manifold $X$ and a closed surface $B$ embedded in $X$ with isolated cone singularities, we give a formula for the signature of an irregular dihedral cover of $X$ branched along $B$. For $X$ simply-connected,…

Geometric Topology · Mathematics 2020-08-17 Alexandra Kjuchukova

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…

Computational Geometry · Computer Science 2020-08-17 Uli Wagner , Emo Welzl