Related papers: On the Structure of Isometrically Embeddable Metri…
Hanika, Schneider, and Stumme introduced geometric data set as a generalization of metric measure space for the computation of the observable diameter, and extended the observable distance between metric measure spaces to that between…
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 prove rigidity results describing contextually-constrained maps defined on Grassmannians and manifolds of ordered independent line tuples in finite-dimensional vector or Hilbert spaces. One statement in the spirit of the Fundamental…
Let $G$ be a connected graph and let $d_G$ be the geodesic distance on $V(G)$. The metric spaces $(V(G), d_{G})$ are characterized up to isometry for all finite connected $G$ by David C. Kay and Gary Chartrand in 1964. The main result of…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
We study totally umbilic isometric immersions between Riemannian manifolds. First, we provide a novel characterization of the totally umbilic isometric immersions with parallel normalized mean curvature vector, i.e., those having nonzero…
Metric spaces $(X, d)$ are ubiquitous objects in mathematics and computer science that allow for capturing (pairwise) distance relationships $d(x, y)$ between points $x, y \in X$. Because of this, it is natural to ask what useful…
Graph encoder embedding, a recent technique for graph data, offers speed and scalability in producing vertex-level representations from binary graphs. In this paper, we extend the applicability of this method to a general graph model, which…
The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G. A resolving set X of a graph G is a subset of vertices such…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
Royden proved that any isometry of Teichmuller space in the Teichmuller metric must be an element of the extended mapping class group M(S). He also proved that the Teichmuller metric is not symmetric at any point. In this paper we give…
The concept of graph flattenability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph $G=(V,E)$…
In 1929, Paul Funk and Ludwig Berwald gave a characterization of Hilbert geometries from the Finslerian viewpoint. They showed that a smooth Finsler metric in a convex bounded domain of $\mathbb{R}^n$ is the Hilbert geometry in that domain…
We propose a notion of integral Menger curvature for compact, $m$-dimensional sets in $n$-dimensional Euclidean space and prove that finiteness of this quantity implies that the set is $C^{1,\alpha}$ embedded manifold with the H{\"o}lder…
Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…
We develop the method of anholonomic frames with associated nonlinear connection (in brief, N--connection) structure and show explicitly how geometries with local anisotropy (various type of Finsler--Lagrange--Cartan--Hamilton geometry) can…
These notes on Riemannian geometry use the bases bundle and frame bundle, as in Geometry of Manifolds, to express the geometric structures. It has more problems and omits the background material. It starts with the definition of Riemannian…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
In the standard approach to Finsler geometry the metric is defined as a vertical Hessian and the Chern or Cartan connections appear as just two among many possible natural linear connections on the pullback tangent bundle. Here it is shown…