93 research outputs found

    Calculation of Minimum Spanning Tree Edges Lengths using Gromov--Hausdorff Distance

    Full text link
    In the present paper we show how one can calculate the lengths of edges of a minimum spanning tree constructed for a finite metric space, in terms of the Gromov-Hausdorff distances from this space to simplices of sufficiently large diameter. Here by simplices we mean finite metric spaces all of whose nonzero distances are the same. As an application, we reduce the problems of finding a Steiner minimal tree length or a minimal filling length to maximization of the total distance to some finite number of simplices considered as points of the Gromov-Hausdorff space.Comment: 8 page

    Hausdorff Measure: Lost in Translation

    Full text link
    In the present article we describe how one can define Hausdorff measure allowing empty elements in coverings, and using infinite countable coverings only. In addition, we discuss how the use of different nonequivalent interpretations of the notion "countable set", that is typical for classical and modern mathematics, may lead to contradictions.Comment: 6 page

    Du-Hwang Characteristic Area: Catch-22

    Full text link
    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.Comment: 4 pages, 2 figures, 10 ref

    Minimal Spanning Trees on Infinite Sets

    Full text link
    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.Comment: 13 page

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

    Full text link
    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 55 and 66 points are derived.Comment: 19 pages, 4 figure

    Optimal Networks

    Full text link
    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

    Hausdorff Realization of Linear Geodesics of Gromov-Hausdorff Space

    Full text link
    We have constructed a realization of rectilinear geodesic (in the sense of~\cite{Memoli2018}), lying in Gromov-Hausdorff space, as a shortest geodesic w.r.t. the Hausdorff distance in an ambient metric space.Comment: 5 pages, 1 figur

    Geometry of Compact Metric Space in Terms of Gromov-Hausdorff Distances to Regular Simplexes

    Full text link
    In the present paper we investigate geometric characteristics of compact metric spaces, which can be described in terms of Gromov-Hausdorff distances to simplexes, i.e., to finite metric spaces such that all their nonzero distances are equal to each other. It turns out that these Gromov-Hausdorff distances depend on some geometrical characteristics of finite partitions of the compact metric spaces; some of the characteristics can be considered as a natural analogue of the lengths of edges of minimum spanning trees. As a consequence, we constructed an unexpected example of a continuum family of pairwise non-isometric finite metric spaces with the same distances to all simplexes.Comment: 19 pages, 2 figure

    Steiner Ratio for Manifolds

    Full text link
    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 curvatureComment: 11 page

    Lectures on Hausdorff and Gromov-Hausdorff Distance Geometry

    Full text link
    The course was given at Peking University, Fall 2019. We discuss the following subjects: (1) Introduction to general topology, hyperspaces, metric and pseudometric spaces, graph theory. (2) Graphs in metric spaces, minimum spanning tree, Steiner minimal tree, Gromov minimal filling. (3) Hausdorff distance, Vietoris topology, Limits theory, inheritance of completeness, total boundedness, compactness by hyperspaces. (4) Gromov-Hausdorff distance, triangle inequality, positive definiteness for isometry classes of compact spaces, counterexample for boundedly compact spaces. (5) Gromov-Hausdorff distance for separable spaces in terms of their isometric images in \ell_\infty, correspondences, Gromov-Hausdorff distance in terms of correspondences. (6) Epsilon-isometries and Gromov-Hausdorff distance. (7) Irreducible correspondences and Gromov-Hausdorff distance. (8) Gromov-Hausdorff convergence, inheritance of metric and topological properties while Gromov-Hausdorff convergence. (9) Gromov-Hausdorff space (GH-space), optimal correspondences, existence of closed optimal correspondences for compact metric spaces, GH-space is geodesic. (10) Cover number, packing number, total boundedness, completeness, and separability of GH-space. (11) mst-spectrum in terms of GH-distances to simplexes, Steiner problem in GH-space. (12) GH-distance to simplexes with more points, GH-distance to simplexes with at most the same number of points. (13) Generalized Borsuk problem, solution of Generalized Borsuk problem in terms of GH-distances, clique covering number and chromatic number of simple graphs, their dualities, calculating these numbers in terms of GH-distances.Comment: 108 pages, 1 figure. The course was given at Peking University, Fall 201
    • …
    corecore