Related papers: Factoring euclidean isometries
We prove that in an arbitrary o-minimal structure, every interpretable group is definably isomorphic to a definable one. We also prove that every definable group lives in a cartesian product of one-dimensional definable group-intervals (or…
The method of Symmetries of Feynman Integrals defines for any Feynman diagram a set of partial differential equations. On some locus in parameter space the equations imply that the diagram can be reduced to a linear combination of simpler…
A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
Understanding how particles are arranged on the sphere is not only central to numerous physical, biological, and materials systems but also finds applications in mathematics and in analysis of geophysical and meteorological measurements. In…
A metric space is plastic if all its non-expansive bijections are isometries. We prove three main results: (1) every countable dense subspace of a normed space is not plastic, (2) every $k$-crowded separable metric space contains a plastic…
Chain distance between points in a metric space is defined as the infimum of epsilon such that there is an epsilon-chain connecting these points. We call a mapping of a metric compact into the real line a chain development if it preserves…
In this paper we study critial isometric and minimal isometric embeddings of classes of Riemannian metrics which we call {\it quasi-$k$-curved metrics}. Quasi-$k$-curved metrics generalize the metrics of space forms. We construct explicit…
An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…
Hyperbolic space is a natural setting for mining and visualizing data with hierarchical structure. In order to compute a hyperbolic embedding from comparison or similarity information, one has to solve a hyperbolic distance geometry…
The proper Euclidean geometry is considered to be metric space and described in terms of only metric and finite metric subspaces (sigma-immanent description). Constructing the geometry, one does not use topology and topological properties.…
A basic representation of any real molecule is a finite cloud of unordered atoms, many of which are chemically indistinguishable. A natural equivalence on point clouds in any metric space is defined by isometries that are…
A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This approach concludes finally the problem of the…
The usual Euclidean distance may be generalized to extended objects such as polymers or membranes. Here, this distance is used for the first time as a cost function to align structures. We examined the alignment of extended strands to…
Let $M_i$ and $N_i$ be path-connected locally uniquely geodesic metric spaces that are not points and $f:\prod_{i=1}^m M_i\to \prod_{i=1}^n N_i$ be an isometry where $\prod_{i=1}^n N_i$ and $\prod_{i=1}^m M_i$ are given the sup metric. Then…
Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…
An isometric embedding of a graph into a metric space is an embedding of the vertices such that the smallest number of edges connecting any two vertices equals to the distance in the metric space between the images. In this paper, we study…
Separable Bregman divergences induce Riemannian metric spaces that are isometric to the Euclidean space after monotone embeddings. We investigate fixed rate quantization and its codebook Voronoi diagrams, and report on experimental…
We characterize the surjective isometries, with respect to the Hausdorff distance, of the class of bodies given by intersections of Euclidean unit balls. We show that any such isometry is given by the composition of a rigid motion with…
We initiate the study of metric embeddings with \emph{outliers}. Given some metric space $(X,\rho)$ we wish to find a small set of outlier points $K \subset X$ and either an isometric or a low-distortion embedding of $(X\setminus K,\rho)$…