Related papers: An estimation of Hempel distance by using Reeb gra…

This paper shows how to use the shooting method, a classical numerical algorithm for solving boundary value problems, to compute the Riemannian distance on the Stiefel manifold $ \mathrm{St}(n,p) $, the set of $ n \times p $ matrices with…

Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are…

We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…

We prove a refined contraction inequality for diffusion semigroups with respect to the Wasserstein distance on a compact Riemannian manifold taking account of the dimension. The result generalizes in a Riemannian context, the dimensional…

We study isometries in the contact sub-pseudo-Riemannian geometry. In particular we give an upper bound on the dimension of the isometry group of a general sub-pseudo-Riemannian manifold and prove that the maximal dimension is attained for…

Let $H$ be a strongly irreducible Heegaard surface in a closed oriented Riemannian $3$-manifold. We prove that $H$ is either isotopic to a minimal surface of index at most one or isotopic to the boundary of a tubular neighborhood about a…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

We define an analogue of the shortest-path distance for graphons. The proposed method is rooted on the extension to graphons of Varadhan's formula, a result that links the solution of the heat equation on a Riemannian manifold to its…

It has been shown beneficial for many types of data which present an underlying hierarchical structure to be embedded in hyperbolic spaces. Consequently, many tools of machine learning were extended to such spaces, but only few…

Let M be a closed 3-manifold with a given Heegaard splitting. We show that after a single stabilization, some core of the stabilized splitting has arbitrarily high distance with respect to the splitting surface. This generalizes a result of…

Given a Riemann surface with boundary S, the lengths of a maximal system of disjoint simple geodesic arcs on S that start and end at the boundary of S perpendicularly are coordinates on the Teichmueller space T(S). We compute the…

For a connected graph $G$ and $\alpha\in [0,1)$, the distance $\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\alpha}(G)$ defined as $D_{\alpha}(G)=\alpha T(G)+(1-\alpha)D(G)$, where $T(G)$ is a diagonal matrix of…

We derive a family of high-order, structure-preserving approximations of the Riemannian exponential map on several matrix manifolds, including the group of unitary matrices, the Grassmannian manifold, and the Stiefel manifold. Our…

The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the…

The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…

The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has…

Following work of Jaco and Rubinstein (2006), which (non-constructively) proved that any 3-manifold admits a one-vertex layered triangulation, we present an algorithm, with implementation using Regina, that uses a combinatorial presentation…

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 prove (Theorem~1.5) that there exists a constant $\Lambda > 0$ so that if $M$ is a $(\mu,d)$-generic complete hyperbolic 3-manifold of volume $\vol[M] < \infty$ and $\Sigma \subset M$ is a Heegaard surface of genus $g(\Sigma) > \Lambda…

For each given $p\in[1,\infty]$ we investigate certain sub-family $\mathcal{M}_p$ of the collection of all compact metric spaces $\mathcal{M}$ which are characterized by the satisfaction of a strengthened form of the triangle inequality…