Related papers: One one type of ud-preserving mapping
We determine the structure of linear maps on the tensor product of matrices which preserve the numerical range or numerical radius.
We introduce a novel notion of pasting shapes for iterated Segal spaces which classify particular arrangements of composing cells in d-uple Segal spaces. Using this formalism, we then continue to prove a pasting theorem for these iterated…
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distances rather than their actual values. Lower and upper bounds for…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
Most well-known multidimensional continued fractions, including the M\"{o}nkemeyer map and the triangle map, are generated by repeatedly subdividing triangles. This paper constructs a family of multidimensional continued fractions by…
The aim of this paper is to characterize those linear maps from a von Neumann factor $\A$ into itself which preserve the extreme points of the unit ball of $\A$. For example, we show that if $\A$ is infinite, then every such linear…
We explore a unified $(k_1,k_2,\ldots,k_m)$-run in multi-state trials, examining its distributional properties and waiting time distribution. Our study reveals that this particular run serves as a generalization encompassing various…
Let $X$ be a uniform space and $U(X)$ the linear space of real-valued uniformly continuous functions on $X$. Our main objective is to give a number of properties characterizing the fact that $U(X)$ is stable under pointwise product in case…
We study the geometry of a random unicellular map which is uniformly distributed on the set of all unicellular maps whose genus size is proportional to the number of edges of the map. We prove that the distance between two uniformly…
In this paper we construct uniformly expanding random walks on smooth manifolds. In higher dimensions, our definition of uniform expansion measures the growth of subspaces rather than single vectors. Potrie showed that given any open set…
We revisit the problem of local persistence in directed percolation, reporting improved estimates of the persistence exponent in 1+1 dimensions, discovering strong corrections to scaling in higher dimensions, and investigating the mean…
For almost every flat surface the sequence of saddle connection lengths listed in increasing order is uniformly distributed mod one.
We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…
We show that, for many holomorphic function spaces on the unit disk, a continuous endomorphism that sends inner functions to inner functions is necessarily a weighted composition operator.
In probability theory, there is a tendency to treat one random variable with a given distribution as being just as good as any other. By and large this is fine because probability is (mostly) concerned with distributional properties of…
A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent…
In "Rips complexes and covers in the uniform category" \cite{Rips} the authors define, following James \cite{J}, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of…
Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or…
We prove that for every $d\geq 3$ the homomorphism order of the class of line graphs of finite graphs with maximal degree $d$ is universal. This means that every finite or countably infinite partially ordered set may be represented by line…