Related papers: Chain development of metric compacts
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in…
Metric dimensions and metric basis are graph invariants studied for their use in locating and indexing nodes in a graph. It was recently established that for bicyclic graph of type-III ($\Theta $-graphs), the metric dimension is $3$ only,…
We consider metrics which are preserved under a $p$-Wasserstein transport map, up to a possible contraction. In the case $p=1$ this corresponds to a metric which is uniformly curved in the sense of coarse Ricci curvature. We investigate the…
We study spherical completeness of ball spaces and its stability under expansions. We introduce the notion of an ultra-diameter, mimicking diameters in ultrametric spaces. We prove some positive results on preservation of spherical…
Given a set of sequences, the distance between pairs of them helps us to find their similarity and derive structural relationship amongst them. For genomic sequences such measures make it possible to construct the evolution tree of…
The definition of $n$-width of a bounded subset $A$ in a normed linear space $X$ is based on the existence of $n$-dimensional subspaces. Although the concept of an $n$-dimensional subspace is not available for metric trees, in this paper,…
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…
We associate to every entanglement measure a family of measures which depend on a precision parameter, and which we call epsilon-measures of entanglement. Their definition aims at addressing a realistic scenario in which we need to estimate…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality, and restriction of the distance to finite chains may or may not coincide with the…
The dynamical evolution of small systems undergoing a chiral symmetry breaking transition in the course of rapid expansion is discussed. The time evolution of the dynamical correlation length for trajectories passing through a second-order…
This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…
A methodology is developed for data analysis based on empirically constructed geodesic metric spaces. For a probability distribution, the length along a path between two points can be defined as the amount of probability mass accumulated…
The circuit diameter of a polyhedron is the maximum length (number of steps) of a shortest circuit walk between any two vertices of the polyhedron. Introduced by Borgwardt, Finhold and Hemmecke (SIDMA 2015), it is a relaxation of the…
A kinematic chain in three-dimensional Euclidean space consists of $n$ links that are connected by spherical joints. Such a chain is said to be within a closed configuration when its link lengths form a closed polygonal chain in three…
The purpose of the present article is to examine the essence of what has commonlybeen described as a "projective line", but which is here named a "meridian". This shall be done in several papers: this first paper devoted to the meridian…
A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…
In pattern recognition, learning, and data mining one obtains information from information-carrying objects. This involves an objective definition of the information in a single object, the information to go from one object to another…
Certain notions of convergence of sequences functions such as pointwise convergence and (uniform) convergence on compact or bounded sets come from suitable topological function spaces; see [1]. Under certain conditions these topologies…
In models with large additional dimensions, the GUT scale can be lowered to values accessible by future colliders. Due to modification of the loop corrections from particles propagating into the extra dimensions, the logarithmic running of…