Related papers: The Farthest Point Map on the Regular Octahedron
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…
Following the general principles of noncommutative geometry, it is possible to define a metric on the space of pure states of the noncommutative algebra generated by the coordinates. This metric generalizes the usual Riemannian one. We…
In this paper, two main results concerning uniformly continuous retractions are proved. First, an $\alpha$-H\"older retraction from any separable Banach space onto a compact convex subset whose closed linear span is the whole space is…
A finite set of unlabelled points in Euclidean space is the simplest representation of many real objects from mineral rocks to sculptures. Since most solid objects are rigid, their natural equivalence is rigid motion or isometry maintaining…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the…
We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…
In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value…
This paper investigates self-maps T from X to X which satisfy a distance constraint in a metric space which mixed point-dependent non-expansive properties, or in particular contractive ones, and potentially expansive properties related to…
This paper establishes novel fixed point theorems for Kannan-type and Chatterjea-type mappings in probabilistic cone metric spaces. By integrating probabilistic distance functions with cone-valued structures, we generalize classical fixed…
We introduce and study a new type of mappings in metric spaces termed $n$-point Kannan-type mappings. A fixed-point theorem is proved for these mappings. In general case such mappings are discontinuous in the domain but necessarily…
In this paper the notion of modular cone metric space is introduced and some properties of such spaces are investigated. Also we define convex modular cone metric which takes values in CR(Y) where Y is a compact Hausdorff space. Then a…
We investigate indeterminate points in discrete integrable system. They appear in singularity confinement phenomenon naturally. We develop a method to analyse indeterminate points of dynamical maps and using this method we clarify behaviour…
In this note we show that a connected, closed and locally convex subset (with an extra assumption on the diameter with respect to the induced length metric if $\kappa>0$) of a $CAT(\kappa)$ space is convex.
We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…
In this paper, we define the notion of a mapping on soft classes and study several properties of images and inverse images of soft sets supported by examples and counterexamples. Finally, these notions have been applied to the problem of…
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…
Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…
Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the…