Related papers: Bridge decompositions with distances at least two
We study distance relations in various simplicial complexes associated with low-dimensional manifolds. In particular, complexes satisfying certain topological conditions with vertices as simple multi-curves. We obtain bounds on the…
Suppose a knot in a $3$-manifold is in $n$-bridge position. We consider a reduction of the knot along a bridge disk $D$ and show that the result is an $(n-1)$-bridge position if and only if there is a bridge disk $E$ such that $(D, E)$ is a…
Haj\'os conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new…
A knot K in 1-bridge position with respect to a genus-g Heegaard surface in a 3-manifold can be moved by isotopy through knots in 1-bridge position until it lies in a union of n parallel genus-g surfaces tubed together by n-1 straight…
A bridge trisection of a smooth surface in $S^4$ is a decomposition analogous to a bridge splitting of a link in $S^3$. The Kirby-Thompson invariant of a bridge trisection measures its complexity in terms of distances between disc sets in…
We show that the number of stabilizations needed to interchange the handlebodies of a Heegaard splitting of a closed 3-manifold by an isotopy is bounded below by the smaller of twice its genus or half its Hempel distance. This is a…
Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. In this article we apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of…
We estimate the distance in the curve graph of a surface S of finite type using Teichmueller geodesics and assuming to be able to detect curves of distance at least three.
In this paper, we show that, for each non-trivial two bridge knot K and for each g > 2, every genus g Heegaard splitting of the exterior E(K) of K is reducible.
In this paper and its two sequels, we give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in a 2-bridge link complement to be homotopic in the link complement. This paper treats the case when the…
$\renewcommand{\Re}{\mathbb{R}}$We present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set of $n$ points in $\Re^d$. In the new construction each point participates in a few pairs, and it extends…
A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that…
The Melan equation for suspension bridges is derived by assuming small displacements of the deck and inextensible hangers. We determine the thresholds for the validity of the Melan equation when the hangers slacken, thereby violating the…
Given two shapes $A$ and $B$ in the plane with Hausdorff distance $1$, is there a shape $S$ with Hausdorff distance $1/2$ to and from $A$ and $B$? The answer is always yes, and depending on convexity of $A$ and/or $B$, $S$ may be convex,…
We prove that bridges of subelliptic diffusions on a compact manifold, with distinct ends, satisfy a large deviation principle in a space of Holder continuous functions, with a good rate function, when the travel time tends to 0. This leads…
Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least…
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…
We provide a complete set of two moves that suffice to relate any two open book decompositions of a given 3-manifold. One of the moves is the usual plumbing with a positive or negative Hopf band, while the other one is a special local…