Searcharxiv⌕ Search

arXiv subjects

A. A. Tuzhilin

Publications and source records attributed to A. A. Tuzhilin.

At least 19 recordsLinked to original sources
arXiv2026

Minimal Fillings of Finite Metric Spaces and Convex Polyhedra

Problem of minimal parametric generalized fillings of finite metric space $M$ (a version of optimal connection problem) leads to construction of a convex multidimensional polyhedra $W_G$ for each tree $G$ connecting $M$ chosen as type of the parametric filling. The weight of the parametric minimal filling can be found as maximum on $W_G$ of the special linear function corresponding to the distance vector of $M$. It is proved that the union of vertex sets of the polyhedra $W_G$ over all possible $G$ forms an extremal subset, i.e., coincides with the vertex set of its convex hull.

math.MG↗
arXiv2026

Classical and continuous Gromov-Hausdorff distances

Starting from the definition of the Gromov-Hausdorff distance via distortion of correspondences, we add the requirement of semicontinuity of each correspondence and its inverse. It turns out that in the case of lower semicontinuity we obtain the same classical Gromov-Hausdorff distance, while for upper semicontinuity we are able to prove coincidence with the classical one only in cases where the spaces are either totally bounded or boundedly compact.

math.MG↗
arXiv2026

Mazur-Ulam Theorem With Gromov-Hausdorff Distance

It is shown that two Banach spaces are linearly isometric if and only if the Gromov--Hausdorff distance between them is finite, in particular, zero. The proof is compilative and relies on results obtained by many researchers on the approximability of almost-surjective almost-isometries by linear surjective isometries. In the finite-dimensional case, previously obtained by I.~Mikhailov, a simpler proof under weaker assumptions is given. In the finite-dimensional case, a criterion for isometry in terms of finite (compact) subsets is also given.

math.MG↗
arXiv2025

Surjective Mappings in the Hyers--Ulam Theorem and the Gromov--Hausdorff Distance

A topological space is said to be cardinality homogeneous if every nonempty open subset has the same cardinality as the space itself. Let $X$ and $Y$ be cardinality homogeneous metric spaces of the same cardinality. If there exists a $δ$-surjective $d$-isometry between such equicardinal cardinality homogeneous metric spaces $X$ and $Y$, then there exists a bijective $(d+2δ)$-isometry between $X$ and $Y$. This result allows us to reduce the Dilworth--Tabor theorem to the Gevirtz--Omladič--Šemrl theorem on approximation by isometries and, in particular, to questions concerning the isometry of Banach spaces.

math.MG↗
arXiv2024

Gromov-Hausdorff Geometry of Metric Trees

In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is obtained. This result allows to construct a new class of shortest geodesics (in the proper class of all metric spaces) connecting such subset of a metric tree with the tree itself. In particular, the technique elaborated is demonstrated on subsets of the real line.

math.MG↗
arXiv2024

Metric Space Recognition by Gromov-Hausdorff Distances to Simplexes

In the present paper a distinguishability of bounded metric spaces by the set of the Gromov--Hausdorff distances to so-called simplexes (metric spaces with unique non-zero distance) is investigated. It is easy to construct an example of non-isometric metric spaces such that the Gromov--Hausdorff distance between them vanishes. Such spaces are non-distinguishable, of course. But we give examples of non-distinguishable metric spaces, the Gromov--Hausdorff distance between which is non-zero. More over, we prove several sufficient and necessary conditions for metric spaces to be non-distinguishable.

math.MG↗
arXiv2024

When the Gromov-Hausdorff distance between finite-dimensional space and its subset is finite?

In this paper we prove that the Gromov--Hausdorff distance between $\mathbb{R}^n$ and its subset $A$ is finite if and only if $A$ is an $\varepsilon$-net in $\mathbb{R}^n$ for some $\varepsilon>0$. For infinite-dimensional Euclidean spaces this is not true. The proof is essentially based on upper estimate of the Euclidean Gromov--Hausdorff distance by means of the Gromov-Hausdorff distance.

math.MG↗
arXiv2022

Clouds in Gromov-Hausdorff Class: their completeness and centers

We consider the proper class of all metric spaces endowed with the Gromov--Hausdorff distance. Its maximal subclasses, consisting of the spaces on finite distance from each other, we call clouds. Multiplying all distances in a metric space by the same positive real number, we obtain a similarity transformation of the Gromov--Hausdorff class. In our previous work, we observed that with such a transformation, some clouds can jump to others. To characterize the phenomenon, we studied the stabilizers of the similarity action. In this paper, we prove that every cloud with a nontrivial stabilizer has a center, i.e., a metric space for which all similarities from the stabilizer generate a new space at zero distance. Moreover, the center is unique modulo zero distance. The proof is based on the cloud completeness theorem.

math.MG↗
arXiv2020

Extendability of Metric Segments in Gromov--Hausdorff Distance

In this paper geometry of Gromov-Hausdorff distance on the class of all metric spaces considered up to an isometry is investigated. For this class continuous curves and their lengths are defined, and it is shown that the Gromov-Hausdorff distance is intrinsic. Besides, metric segments are considered, i.e., the classes of points lying between two given ones, and an extension problem of such segments beyond their end-points is considered.

math.MG↗
arXiv2019

The Gromov--Hausdorff Distance between Simplexes and Two-Distance Spaces

In the present paper we calculate the Gromov-Hausdorff distance between an arbitrary simplex (a metric space all whose non-zero distances are the same) and a finite metric space whose non-zero distances take two distinct values (so-called $2$-distance spaces). As a corollary, a complete solution to generalized Borsuk problem for the $2$-distance spaces is obtained. In addition, we derive formulas for the clique covering number and for the chromatic number of an arbitrary graph $G$ in terms of the Gromov-Hausdorff distance between a simplex and an appropriate $2$-distance space constructed by the graph $G$.

math.MG↗
arXiv2019

Gromov--Hausdorff Distance to Simplexes

Geometric characteristics of metric spaces that appear in formulas of the Gromov--Hausdorff distances from these spaces to so-called simplexes, i.e., to the metric spaces, all whose non-zero distances are the same are studied. The corresponding calculations essentially use geometry of partitions of these spaces. In the finite case, it gives the lengths of minimal spanning trees. A similar theory for compact metric spaces was worked out previously. In the present paper we generalize those results to any bounded metric space, and also, we simplify some proofs.

math.MG↗
arXiv2019

Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces

The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the formula of weight of minimal fillings is improved, an alternative proof of this formula is obtained, and also explicit formulas for finite spaces consisting of $5$ and $6$ points are derived.

math.MG↗
arXiv2014

Minimal Spanning Trees on Infinite Sets

Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic description of the set of all infinite metric spaces which a minimal spanning tree exists for. A sufficient condition for a minimal spanning tree existence is obtained in terms of distances achievability between partitions elements of the metric space under consideration. Besides, a concept of locally minimal spanning tree is introduced, several properties of such trees are described, and relations of those trees with (globally) minimal spanning trees are investigated.

math.MG↗
arXiv2014

Du-Hwang Characteristic Area: Catch-22

The paper is devoted to description of two interconnected mistakes generated by the gap in the Du and Hwang approach to Gilbert-Pollack Steiner ratio conjecture.

math.MG↗
arXiv2012

Optimal Networks

This mini-course was given in the First Yaroslavl Summer School on Discrete and Computational Geometry in August 2012, organized by International Delaunay Laboratory "Discrete and Computational Geometry" of Demidov Yaroslavl State University. The aim of this mini-course is to give an introduction in Optimal Networks theory. Optimal networks appear as solutions of the following natural problem: How to connect a finite set of points in a metric space in an optimal way? We cover three most natural types of optimal connection: spanning trees connection without additional road forks, shortest trees and locally shortest trees, and minimal fillings.

math.MG↗
arXiv2011

Steiner Ratio for Manifolds

The Steiner ratio characterizes the greatest possible deviation of the length of a minimal spanning tree from the length of the minimal Steiner tree. In this paper, estimates of the Steiner ratio on Riemannian manifolds are obtained. As a corollary, the Steiner ratio for flat tori, flat Klein bottles, and projective plane of constant positive curvature are computed. Steiner ratio - Steiner problem - Gilbert--Pollack conjecture - surfaces of constant curvature

math.MG↗
arXiv2011

Determination of Different Biological Factors on the Base of Dried Blood Spot Technology

It is well-known that distinct biological indices (analytes) have distinct variability. We try to use some mathematical algorithms to pick out a set of blood parameters which give an opportunity to retrieve the initial volume of the blood spotted, and use it to calculate exact concentrations of analyts interesting to a physician. For our analysis we used the database of biochemical blood parameters obtained in Russian Scientific Center of Roentgen-Radiology during 1995-2000, which includes more than 30000 of patients.

math.ST↗