Related papers: Best Proximity Point Results for Perimetric Contra…
In this paper, our aim is to obtain new fixed-disc results on metric spaces. To do this, we present a new approach using the set of simulation functions and some known fixed-point techniques. We do not need to have some strong conditions…
We find a priori and a posteriori error estimates of the best proximity point for the Picard iteration associated to a cyclic contraction map, which is defined on a uniformly convex Banach space with modulus of convexity of power type. We…
In the present paper, we introduce two new types of contractive mappings in perturbed metric spaces, namely $\varphi$-perturbed mappings and perturbed Kannan mappings. We prove a fixed point result for such mappings and show that our…
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…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
In the year 2011, S.Basha \cite{BS} introduced the notion of proximal contraction in a metric space $X$ and study the existence and uniqueness of best proximity point for this class of mappings. Also, the author gave an algorithm to achieve…
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) = \operatorname{dist}(A,…
Twisted permutation codes, introduced recently by the second and third authors, are frequency permutation arrays. They are similar to repetition permutation codes, in that they are obtained by a repetition construction applied to a smaller…
The main purpose of this paper is to introduce and study the primal-proximity spaces. Also, we define two new operators via primal proximity spaces and investigate some of their fundamental properties. In addition, we obtain a new topology,…
We investigate the problem of using mobile robots equipped with 2D range sensors to optimally guard perimeters or regions, i.e., 1D or 2D sets. Given such a set of arbitrary shape to be guarded, and $k$ mobile sensors where the $i$-th…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…
This paper introduce a new class of operators and contraction mapping for a cyclical map T on G-metric spaces and the approximately fixed point properties. Also,we prove two general lemmas regarding approximate fixed Point of cyclical…
We introduce and study a general concept of multiple fixed point for mappings defined on partially ordered distance spaces in the presence of a contraction type condition and appropriate monotonicity properties. This notion and the obtained…
In this research article, we discuss two topics. Firstly, we introduce SCC-Map and $\phi$-contraction type $T$-coupling. By using these two definitions, we generalize $\phi$-contraction type coupling given by H. Aydi et al. [3] to…
A $1$-Lipschitz map $f$ from a convex compact set to itself has fixed points. This consequence of Brouwer's or Schauder's fixed point theorem has more elementary proofs by approximating $f$ by $\lambda$-contractions, $f_\lambda$. We study…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The…
In this paper, we introduce two new types of enriched contractions, viz., enriched $\mathcal{A}$-contraction and enriched $\mathcal{A}'$-contraction. Then we obtain fixed points of mappings satisfying such contractions using the fixed point…
We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…