Related papers: One one type of ud-preserving mapping
A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…
We study large uniform random maps with one face whose genus grows linearly with the number of edges, which are a model of discrete hyperbolic geometry. In previous works, several hyperbolic geometric features have been investigated. In the…
We show that for almost every map in a transversal one-parameter family of piecewise expanding unimodal maps the Birkhoff sum of suitable observables along the forward orbit of the turning point satisfies the law of iterated logarithm. This…
Let $I(X,K)$ be the incidence algebra of a finite connected poset $X$ over a field $K$ and $D(X,K)$ its subalgebra consisting of diagonal elements. We describe the bijective linear maps $\varphi:I(X,K)\to I(X,K)$ that strongly preserve the…
In this work, we explore links between natural homology and persistent homology for the classification of directed spaces. The former is an algebraic invariant of directed spaces, a semantic model of concurrent programs. The latter was…
A topological space is called a submetrizable if it can be mapped onto a metrizable topological space by a continuous one-to-one map. In this paper we answer two questions concerning sequence-covering maps on submetrizable spaces.
Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $\phi:M_{mn}\rightarrow M_{mn}$…
We complete characterization of bijections preserving commutators (PC-maps) in the group of unitriangular matrices $UT(n,F)$ over a field $F$, where $n$ is a natural number or infinity. PC-maps were recently described up to almost identity…
We introduce an elementary argument to the theory of distribution of sequences modulo one.
A graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths. We reinvestigate a recent constructive characterization of uniformly $3$-connected…
A digraph D is the pattern of a matrix M when D has an arc ij if and only if the ij-th entry of M is nonzero. Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology and quantum…
Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…
In this paper, we consider the class of uniformly locally univalent harmonic mappings in the unit disk and build a relationship between its pre-Schwarzian norm and uniformly hyperbolic radius. Also, we establish eight ways of characterizing…
A model for diffusion on a cubic lattice with a random distribution of traps is developed. The traps are redistributed at certain time intervals. Such models are useful for describing systems showing dynamic disorder, such as ion-conducting…
In the recent research of data mining, frequent structures in a sequence of graphs have been studied intensively, and one of the main concern is changing structures along a sequence of graphs that can capture dynamic properties of data. On…
This note proves a result on the existence of barycenters in a class of uniformly convex geodesic spaces.
We define a hierarchy of special classes of constrained Willmore surfaces by means of the existence of a polynomial conserved quantity of some type, filtered by an integer. Type 1 with parallel top term characterises parallel mean curvature…
We investigate the separability of several well known classes of subgroups of the mapping class group of a surface.
An ultrametric preserving function $f$ is said to be strongly ultrametric preserving if ultrametrics $d$ and $f \circ d$ define the same topology on $X$ for each ultrametric space $(X,d)$. The set of all strongly ultrametric preserving…
Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.