Related papers: Best proximity points in ultrametric spaces
We show that any space with a positive upper curvature bound has in a small neighborhood of any point a closely related metric with a negative upper curvature bound.
In the present paper, we extend the Zamfirescu results ([9]) to A-metric spaces. Firstly, we define the notion of Zamfirescu mapping in A-metric spaces. After, we also obtain a fixed point theorem for such mappings. The established results…
Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
We study the Closest Pair Problem in Hamming metric, which asks to find the pair with the smallest Hamming distance in a collection of binary vectors. We give a new randomized algorithm for the problem on uniformly random input…
The paper is concerned with b-metric and generalized b-metric spaces. One proves the existence of the completion of a generalized b-metric space and some fixed point results. The behavior of Lipschitz functions on b-metric spaces of…
We introduce two novel algorithms for the problem of finding the closest pair in a cloud of $n$ points based on findings from mathematical optimal packing theory. Both algorithms are deterministic, show fast effective runtimes, and are very…
New fixed point results are presented for ${\cal U}_c^{\kappa}(X,X)$ maps in extension type spaces.
The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove that the equalities $C(X)=\{0\}$ or $C(X)=\{0,\operatorname{diam}X\}…
Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes the closeness of the points in the same cluster, even if the…
Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…
We study the problem of supervised learning a metric space under discriminative constraints. Given a universe $X$ and sets ${\cal S}, {\cal D}\subset {X \choose 2}$ of similar and dissimilar pairs, we seek to find a mapping $f:X\to Y$, into…
In this paper, we introduce the neutrosophic contractive and neutrosophic mapping. We establish some results on fixed points of a neutrosophic mapping.
A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…
Let $X$ be a compact metric space, $C(X)$ be the space of continuous real-valued functions on $X$, and $A_1$, $A_2$ be two closed subalgebras of $C(X)$ containing constant functions. We consider the problem of approximation of a function…
In this paper, we establish coincidence fixed point and common fixed point theorems for two mapping in complete $C^*$-algebra-valued metric spaces which satisfy new contractive conditions. Some applications of our obtained results are…
A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in…
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…
Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…