相关论文: Farthest Point Map on a Centrally Symmetric Convex…
On any compact space one can consider the map which sends a point to the set of points farthest from this point. In nice cases, there is just a single point farthest from a given point and so by restricting the domain slightly one can form…
We study the farthest point mapping on (the boundary of) the 4-cube with respect to the intrinsic metric, and its dynamics as a multivalued mapping. It is a piecewise rational map. It is more complicated than the one on the 3-cube, but it…
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…
We consider the distance function from an arbitrary point $p$ on a flat surface, and determine the set $F_{p}$ of all \emph{farthest points} (i.e., points at maximal distance) from $p$.
Let $X$ be the regular dodecahedron, equipped with its intrinsic path metric. Given $p \in X$ let $G(p)=-q$ where $q$ is the point on $X$ which maximizes the distance to $p$. (Generically, $G$ is single-valued.) We give a complete…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
We propose the concepts of vicinal mappings and firmly vicinal mappings in metric spaces. We obtain fixed point and convergence theorems for these mappings in complete geodesic spaces with curvature bounded above by one and apply our…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…
We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…
This paper seeks to advance the theory of nonexpansive mappings by introducing and exploring a novel class of nonexpansive type mappings, which we aptly designate as perimetric nonexpansive mappings. We establish that the collection of…
In this paper we give an elementary proof of the fact that every uniquely remotal set is singleton in a finite dimensional strictly convex normed linear space. We show that if A is a uniquely remotal M-compact subset with the derived set of…
In a spherically complete ultrametric space, a strictly contracting mapping has a fixed point. We indicate in this paper how this fixed point can either be reached or approximated.
In this paper we address the question whether in a given Banach space, a Chebyshev center of a nonempty bounded subset can be a farthest point of the set. Our exploration reveals that the answer depends on the convexity properties of the…
Each convex combination of extreme points of a compact convex set represents a certain point of the convex set. Barycentric coordinates provide solutions to the inverse problem of expressing an element of a compact convex set as a convex…
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…
In this paper, we introduce the concept of cyclic orbital contraction mappings which generalizes the concept of cyclic contraction mappings. We establish the existence of best proximity point of these mappings in the framework of $CAT_p(0)$…
For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…