Related papers: Graph-theoretic conditions for injectivity of func…
The main result given in Theorem~1.1 is a condition for a map $X$, defined on the complement of a disk $D$ in R^2 with values in R^2, to be extended to a topological embedding of R^2, not necessarily surjective. The map $X$ is supposed to…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
The real Jacobian conjecture claims that if $F=\left(f^1,\ldots,f^n\right):\mathbb{R}^n\rightarrow \mathbb{R}^n$ is a polynomial map such that $\det DF$ is nowhere zero, then $F$ is a global injective. The first part is to study the…
One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…
This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…
This article shows a very elementary and straightforward proof of the Implicit Function Theorem for differentiable maps $F(x,y)$ defined on a finite-dimensional Euclidean space. There are no hypothesis on the continuity of the partial…
We prove some rigidity and classification results for graphs with prescribed mean curvature and locally constant Dirichlet and Neumann data, for instance as they appear in capillarity problems. We consider domains in Riemannian manifolds,…
The present paper is devoted to investigating the two-dimensional real Jacobian conjecture. This conjecture claims that if $F=\left(f,g\right):\mathbb{R}^2\rightarrow \mathbb{R}^2$ is a polynomial map with $\det DF\left(x,y\right)\ne0$ for…
In this paper, the existence of coincidence points and common fixed points for multivalued mappings satisfying certain graphic {\psi}-contraction contractive conditions with set-valued domain endowed with a graph, without appealing to…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…
We elucidate the geometric background of function-theoretic properties for the Gauss maps of several classes of immersed surfaces in three-dimensional space forms, for example, minimal surfaces in Euclidean three-space, improper affine…
We discuss properties which must be satisfied by a genetic network in order for it to allow differentiation. These conditions are expressed as follows in mathematical terms. Let $F$ be a differentiable mapping from a finite dimensional real…
It is known that there exists a function interpolating a given data set such that the graph of the function is the attractor of an iterated function system which is called fractal interpolation function. We generalize the notion of fractal…
In this paper, we will first show that, the homogeneous polynomials which satisfy the Jacobian condition are injective on the lines that pass through the origin. Secondly, we will show that $F$ and $G'$ are paired, where $F$ is a Druzkowski…
The Riemann Theorem states, that for any nontrivial connected and simply connected domain on the Riemann sphere there exists some its conformal bijection to the exterior of the unit disk. In this paper we find an explicit form of this map…
We consider the problem of determining the class of continuous-time dynamical systems that can be globally linearized in the sense of admitting an embedding into a linear system on a higher-dimensional Euclidean space. We solve this problem…
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…
We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…
The Jacobian of a graph is a discrete analogue of the Jacobian of a Riemann surface. In this paper, we explore how Jacobians of graphs change when we glue two graphs along a common subgraph focusing on the case of cycle graphs. Then, we…