Related papers: On approximability by embeddings of cycles in the …
In this paper we obtain a Carleman approximation theorem for maps from Stein manifolds to Oka manifolds. More precisely, we show that under suitable complex analytic conditions on a totally real set $ M $ of a Stein manifold $X$, every…
In this note, at first we prove that the existence of best proximity points for cyclic relatively nonexpansive mappings is equivalent to the existence of best proximity pairs for noncyclic relatively nonexpansive mappings in the setting of…
We give an affine proof of Feuerbach's theorem, by constructing an explicit affine map which takes the nine-point circle of any given Euclidean triangle to the incircle and fixes the Feuerbach point. The proof is shown to be valid in any…
We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…
Minimal obstructions for embedding 4-regular Eulerian digraphs on the plane are considered in relation to the partial order defined by the cycle removal operation. Their basic properties are provided and all obstructions with parallel arcs…
A parquet approximation (generalized ladder diagrams) in matrix models is considered. By means of numerical calculations we demonstrate that in the large $N$ limit the parquet approximation gives an excellent agreement with exact results.
We discuss various questions of the following kind: for a continuous map $X \to Y$ from a compact metric space to a simplicial complex, can one guarantee the existence of a fiber large in the sense of Urysohn width? The $d$-width measures…
The Sinc approximation has shown high efficiency for numerical methods in many fields. Conformal maps play an important role in the success, i.e., appropriate conformal map must be employed to elicit high performance of the Sinc…
A real algebraic variety W of dimension m is said to be uniformly rational if each of its points has a Zariski open neighborhood which is biregularly isomorphic to a Zariski open subset of R^m. Let l be any nonnegative integer. We prove…
Let $M\subset C^N$ be a minimal real-analytic CR-submanifold and $M'\subset C^{N'}$ a real-algebraic subset through points $p\in M$ and $p'\in M'$. We show that that any formal (holomorphic) mapping $f\colon (C^N,p)\to (C^{N'},p')$, sending…
We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem: given a plane drawing of a planar graph $G$ and a set $F$ of edges, insert the edges in $F$ into the drawing such that the resulting drawing is $k$-plane. In this…
We characterize conformally removable sets in the plane with the aid of the recent developments in the theory of metric surfaces. We prove that a compact set in the plane is $S$-removable if and only if there exists a quasiconformal map…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
We demonstrate that any self-adjoint coupling in a quantum graph vertex can be approximated by a family of magnetic Schroedinger operators on a tubular network built over the graph. If such a manifold has a boundary, Neumann conditions are…
We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…
In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…
A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…
The well-known Reifenberg theorem states that if a subset of $\mathbb{R}^n$ can be well approximated by $k$-planes at every point and every scale, then it is biH\"older homeomorphic to a $k$-disk. This article concerns a subset $S$ of…
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…