Related papers: An estimation of Hempel distance by using Reeb gra…
In this paper, by putting a separating incompressible surface in a 3-manifold into Morse position relative to the height function associated to a strongly irreducible Heegaard splitting, we show that an incompressible subsurface of the…
We construct examples of closed non-Haken hyperbolic 3-manifolds with a Heegaard splitting of arbitrarily large distance.
We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit…
Let $G$ be a finite, simple connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The remoteness $\rho(G)$ of $G$ is the maximum of the average distances…
Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention…
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…
Kevin Hartshorn showed that if a three-dimensional manifold $M$ admits a Heegaard surface $\Sigma$ with Hempel distance $d$ then every incompressible surface in $M$ has genus at least $\frac{d}{2}$. Scharlemann-Tomova generalized this,…
We study the question of approximating a compact geodesic metric space by metric graphs satisfying a uniform upper bound on their first Betti number. We prove that, up to a suitable multiplicative constant, Reeb graphs of distance functions…
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…
The Reeb graph has been utilized in various applications including the analysis of scalar fields. Recently, research has been focused on using topological signatures such as the Reeb graph to compare multiple scalar fields by defining…
Let $M$ be a hyperbolic Riemann surface with the first eigenvalue $\lambda_1(M)>0$. Let $\rho$ denote the distance from a fixed point $x_0\in{M}$ and $r_x$ the injectivity radius at $x$. We show that there exists a numerical constant…
In this paper we provide a way of taking $L^p$, $p > \frac{m}{2}$ bounds on a $m-$ dimensional Riemannian metric and transforming that into H\"{o}lder bounds for the corresponding distance function. One can think of this new estimate as a…
Through the use of sub-Riemannian metrics we provide quantitative estimates for the maximal tight neighbourhood of a Reeb orbit on a three-dimensional contact manifold. Under appropriate geometric conditions we show how to construct closed…
Let K be a knot in a closed orientable irreducible 3-manifold M and let P be a Heegaard splitting of the knot complement of genus at least two. Suppose Q is a bridge surface for K. Then either \begin{itemize} \item $d(P)\leq 2-\chi(Q-K)$,…
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…
In this paper we give a method to construct Heegaard splittings of oriented graph manifolds with orientable bases. A graph manifold is a closed $3$-manifold admitting only Seifert-fibered pieces in its Jaco-Shalen decomposition; for…
For n-bridge decompositions of links in S^3, we propose a practical method to ensure that the Hempel distance is at least two.
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…
Let $G$ be a connected graph of order $n$ with diameter $d$. Remoteness $\rho$ of $G$ is the maximum average distance from a vertex to all others and $\partial_1\geq\cdots\geq \partial_n$ are the distance eigenvalues of $G$. In \cite{AH},…
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.