Related papers: Best proximity points in ultrametric spaces

In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…

Let $A$ and $X$ be nonempty, bounded and closed subsets of a geodesic metric space $(E,d)$. The minimization (resp. maximization) problem denoted by $\min(A,X)$ (resp. $\max(A,X)$) consists in finding $(a_0,x_0) \in A \times X$ such that…

We present theoretical properties of the space of metric pairs equipped with the Gromov--Hausdorff distance. First, we establish the classical metric separability and the geometric geodesicity of this space. Second, we prove an…

This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings…

Suppose each of $n$ men and $n$ women is located at a point in a metric space. A woman ranks the men in order of their distance to her from closest to farthest, breaking ties at random. The men rank the women similarly. An interesting…

We consider the minimal distance between orbits of measure preserving dynamical systems. In the spirit of dynamical shrinking target problems we identify distance rates for which almost sure asymptotic closeness properties can be ensured.…

In this paper we are going to prove a very general fixed point theorem for mappings acting in partial metric spaces. In that theorem we impose some conditions on behavior of considered mappings on orbits and a condition relating orbits of…

The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of closest points. Another closely related problem is the fixed…

We prove that the Lipschitz-free space over a countable proper metric space is isometric to a dual space and has the metric approximation property. We also show that the Lipschitz-free space over a proper ultrametric space is isometric to…

The closest pair of points problem or closest pair problem (CPP) is an important problem in computational geometry where we have to find a pair of points from a set of points in metric space with the smallest distance between them. This…

This work is a comparative study between the existence of fixed point for homomorphisms in a class of binary relationnal systems and the existence of fixed point for nonexpansive mappings in semimetric spaces.

We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…

Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.

Consider the problem of finding a point in an ultrametric space with the minimum average distance to all points. We give this problem a Monte Carlo $O((\log^2(1/\epsilon))/\epsilon^3)$-time $(1+\epsilon)$-approximation algorithm for all…

In this manuscript, motivated and inspired by results of Best proximity point of generalized $ F $-proximal non-self contractions, we introduce the concept of generalized $\theta-\phi-$proximal contraction and prove new best proximity…

We solve two related extremal-geometric questions in the $n-$dimensional space $\mathbb{R}^n_{\infty}$ equipped with the maximum metric. First, we prove that the maximum size of a right-equidistant sequence of points in…

The aim of this paper is to study ultralimits of pointed metric measure spaces (possibly unbounded and having infinite mass). We prove that ultralimits exist under mild assumptions and are consistent with the pointed measured…

This paper regards the problem of optimally placing unreliable sensors in a one-dimensional environment. We assume that sensors can fail with a certain probability and we minimize the expected maximum distance from any point in the…

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

Given a set of points in the Euclidean space $\mathbb{R}^\ell$ with $\ell>1$, the pairwise distances between the points are determined by their spatial location and the metric $d$ that we endow $\mathbb{R}^\ell$ with. Hence, the distance…