Related papers: One one type of ud-preserving mapping
The fixed point results for generalized Pre\v{s}i\'c type mappings in the setup of $b$-metric spaces are obtained. The stability of fixed point set of Pre\v{s}i\'c type mappings is also established. Several examples are also presented to…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…
For uniformly expanding maps on the interval, analogous versions of the Berry-Ess\'een theorem are known but only with an unexplicit upper bound in $O(1/\sqrt{n})$ without any constants being specified. In this paper, we use the recent…
Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A…
We study the connections between three seemingly different combinatorial structures - "uniform" brackets in statistics and probability theory, "containers" in online and distributed learning theory, and "combinatorial Macbeath regions", or…
Author developed a uniform model for different spaces where distance and angle measure kinds are parameters. This model is calculus centric, but can also be used in theoretical research. It is useful in the following domains: deduction of…
We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…
For any natural number $d$, a graph $G$ is a (disjoint) $d$-interval graph if it is the intersection graph of (disjoint) $d$-intervals, the union of $d$ (disjoint) intervals on the real line. Two important subclasses of $d$-interval graphs…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
Striped Turing patterns and solitary band and disk structures are constructed using a three-variable multiscale model with cubic nonlinearity and global control. The existence and stability conditions of regular structures are analysed…
It will be shown that according to theorems of K. Menger, every neuron grid if identified with a curve is able to preserve the adopted qualitative structure of a data space. Furthermore, if this identification is made, the neuron grid…
The infinite discrete stable Boltzmann maps are generalisations of the well-known Uniform Infinite Planar Quadrangulation in the case where large degree faces are allowed. We show that the simple random walk on these random lattices is…
The aim of this paper is to extend the concept of measure density introduced by Buck for finite unions of arithmetic progressions, to arbitrary subsets of N defined by a given system of decompositions. This leads to a variety of new…
A uniform shrinkage prior (USP) distribution on the unknown variance component of a random-effects model is known to produce good frequency properties. The USP has a parameter that determines the shape of its density function, but it has…
We develop a rigidity theory for bar-joint frameworks in Euclidean $d$-space in which specified classes of edges are allowed to change length in a coordinated fashion that requires differences of lengths to be preserved within each class.…
This paper presents a new version of boundary on coarse spaces. The space of ends functor maps coarse metric spaces to uniform topological spaces and coarse maps to uniformly continuous maps.
Let G be a simple, connected graph on n vertices. Let d_G(u,v) denote the distance between vertices u and v in G. A subgraph H of G is isometric if d_H(u,v)=d_G(u,v) for every u,v in V(H). We say that G is a distance-preserving graph if G…
We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…
We generalize some results of Borwein, Burke, Lewis, and Wang to mappings with values in metric (resp. ordered normed linear) spaces. We define two classes of monotone mappings between an ordered linear space and a metric space (resp.…
Structure-preserving algorithms and algorithms with uniform error bound have constituted two interesting classes of numerical methods. In this paper, we blend these two kinds of methods for solving nonlinear Hamiltonian systems with highly…