Uniqueness of best proximity pairs and rigidity of semimetric spaces

DOI10.1007/S11784-022-01042-8zbMATH Open1505.05049arXiv2201.04380OpenAlexW4312162378MaRDI QIDQ2680372FDOQ2680372

Authors: Aleksey A. Dovgoshey, Ruslan V. Shanin 

Publication date: 29 December 2022

Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)

Abstract: For arbitrary semimetric space $(X,d)$ and disjoint proximinal subsets $A$, $B$ of $X$ we define the proximinal graph as a bipartite graph with parts $A$ and $B$ whose edges $a,b$ satisfy the equality $d(a,b)=operatornamedist(A,B)$. We characterize the semimetric spaces whose proximinal graphs have at most one edge and the semimetric spaces whose proximinal graphs have the vertices with degree at most $1$ only. This allows us to describe the necessary and sufficient conditions for uniqueness of the best proximity pairs and best approximations.

Full work available at URL: https://arxiv.org/abs/2201.04380

Recommendations

• Bipartite graphs and best proximity pairs
• A result on best proximity pair of two sets
• Best proximity pairs in ultrametric spaces
• Best proximity points of contractive mappings on a metric space with a graph and applications
• Approximate best proximity pairs in metric space

zbMATH Keywords

best approximationbipartite graphbest proximity pairproximinal setrigidness of semimetric spaces

Mathematics Subject Classification ID

Distance in graphs (05C12) Best approximation, Chebyshev systems (41A50) Metric spaces, metrizability (54E35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Cartesian Trees and Range Minimum Queries
• Proximinal Retracts and Best Proximity Pair Theorems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trees and ultrametric spaces: A categorical equivalence
• \(\mathbb{R}\)-trees in topology, geometry, and group theory
• Convex Sets and Nearest Points
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Metric Characterization of Zero-Dimensional Spaces
• Characterization, stability and convergence of hierarchical clustering methods
• Pictures of Ultrametric Spaces, the p-Adic Numbers, and Valued Fields
• Trees, ultrametrics, and noncommutative geometry
• Title not available (Why is that?)
• The category of ultrametric spaces is isomorphic to the category of complete, atomic, tree-like, and real graduated lattices LAT\(^*\)
• Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
• Diameter and diametrical pairs of points in ultrametric spaces
• On the Gomory-Hu inequality
• On spaces extremal for the Gomory-Hu inequality
• Weak similarities of metric and semimetric spaces
• Subdominant pseudoultrametric on graphs
• Ultrametric sets in Euclidean point spaces
• Combinatorial properties of ultrametrics and generalized ultrametrics
• Isomorphism of trees and isometry of ultrametric spaces
• On some extremal properties of finite ultrametric spaces
• Weak similarities of finite ultrametric and semimetric spaces
• Strongly Rigid Metrics and Zero Dimensionality
• Best approximation in ultrametric spaces
• Finite ultrametric balls
• Trees and ultrametric Möbius structures
• From isomorphic rooted trees to isometric ultrametric spaces
• Properties and morphisms of finite ultrametric spaces and their representing trees
• Labeled trees generating complete, compact, and discrete ultrametric spaces
• Ultrametrics and Complete Multipartite Graphs
• How rigid the finite ultrametric spaces can be?
• Combinatorial characterization of pseudometrics
• Semigroups generated by partitions
• Ultrametric preserving functions and weak similarities of ultrametric spaces
• Best proximity pairs in ultrametric spaces
• BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION IN ULTRAMETRIC SPACES
• On best proximity point theorems in locally convex spaces endowed with a graph
• Best proximity points of contractive mappings on a metric space with a graph and applications
• Minimal universal metric spaces

Cited In (4)

• When all permutations are combinatorial similarities
• Proximinal sets and connectedness in graphs
• Pseudometric spaces: from minimality to maximality in the groups of combinatorial self-similarities
• Bipartite graphs and best proximity pairs

This page was built for publication: Uniqueness of best proximity pairs and rigidity of semimetric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680372)