Related papers: The Farthest Point Map on the Regular Octahedron
A continuum $X$ is a dendrite if it is locally connected and contains no simple closed curve, a self mapping $f$ of $X$ is called monotone if the preimage of any connected subset of $X$ is connected. If $X$ is a dendrite and $f:X\to X$ is a…
We present coincidence and common fixed point results of selfmappings satisfying a contraction type in partially ordered metric spaces. As an application, we give an existence theorem for a common solution of integral equations.
The purpose of this letter is to define a distance on the underlying phase space of a chaotic map, based on natural invariant density of the map. It is observed that for logistic map this distance is equivalent to Wootters' statistical…
Any affine map on the (n+1)-dimensional Euclidean space gives rise to a natural map on the n-dimensional sphere whose dynamical aspects are not so well-studied in the literature. We explore the dynamical aspects of these maps by…
We study the shortest geodesics on flat cone spheres, i.e. flat metrics on the sphere with conical singularities. The length of the shortest geodesic between two singular points can be treated as a function on the moduli space of flat cone…
The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…
Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…
A compact space $X$ is said to be minimal if there exists a map $f:X\to X$ such that the forward orbit of any point is dense in $X$. We consider rigid minimal spaces, motivated by recent results of Downarowicz, Snoha, and Tywoniuk [J. Dyn.…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
The paper deals with continuous and compact mappings generated by the Fourier transform between distinguished function spaces on $\mathbb{R}^n$. The degree of compactness will be measured in terms of related entropy numbers. We are more…
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…
We shall generalize the concept of $z=(1-t)x\oplus ty$ to $n$ times which contains to verifying some their properties and inequalities in CAT(0) spaces. In the sequel with introducing of $\alpha$-nonexpansive mappings, we obtain some fixed…
Given functions $f,g: [n] \rightarrow [n]$ do there exist $n$ points $A_1,A_2\ldots A_n$ in some metric space such that $A_{f(i)},A_{g(i)}$ are the points closest and farthest from point $A_i$? In this paper we characterize precisely which…
Metrics on the space of sets of trajectories are important for scientists in the field of computer vision, machine learning, robotics, and general artificial intelligence. However, existing notions of closeness between sets of trajectories…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
Certain problems in quadratic minimization can be reduced to finding the point $x$ of a polyhedron ${ P}$ that minimizes the distance $\|x-p\|$ for some $p\notin { P}$. This amounts to a search for the appropriate face $F$ of ${ P}$ for…
We show that a minimal dynamical system $(X,\mathbb{Z})$ on a compact metric $X$ with mdim$X=d$ admits for every natural $k>d$ an equivariant map to the shift $([0,1]^k)^{\mathbb{Z}}$ such that each fiber of this map contains at most…
We define upper bound and lower bounds for order-preserving homogeneous of degree one maps on a proper closed cone in $\R^n$ in terms of the cone spectral radius. We also define weak upper and lower bounds for these maps. For a proper…
We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…