Related papers: Monotone mappings and lines
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the upwardness of different graphs can differ. We first…
A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…
An approximation theorem of Youngs (1948) asserts that a continuous map between compact oriented topological 2-manifolds (surfaces) is monotone if and only if it is a uniform limit of homeomorphisms. Analogous approximation of Sobolev…
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…
In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
For point $x$ in the inverse limit space $X$ with a single unimodal bonding map we construct, with the use of symbolic dynamics, a planar embedding such that $x$ is accessible. It follows that there are uncountably many non-equivalent…
We show that if $E$ is a closed convex set in $\mathbb C^n$ $(n>1)$ contained in a closed halfspace $H$ such that $E\cap bH$ is nonempty and bounded, then the concave domain $\Omega = \mathbb C^n\setminus E$ contains images of proper…
In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…
The monotonicity of entropy is investigated for real quadratic rational maps on the real circle $\mathbb{R}\cup\{\infty\}$ based on the natural partition of the corresponding moduli space $\mathcal{M}_2(\mathbb{R})$ into its monotonic,…
The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…
A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
Let G be a graph drawn in the plane so that its edges are represented by x-monotone curves, any pair of which cross an even number of times. We show that G can be redrawn in such a way that the x-coordinates of the vertices remain unchanged…
We consider mappings of domains of Riemannian manifolds that admit branch points and satisfy a certain condition regarding the distortion of the modulus of families of paths. We have established logarithmic estimates of distance distortion…
A continuum $X$ is a dendrite if it is locally connected and contains no simple closed curve, a self mapping $f$ of $X$ is called monotone if the preimage of any connected subset of $X$ is connected. If $X$ is a dendrite and $f:X\to X$ is a…
Knaster continua and solenoids are well-known examples of indecomposable continua whose composants (maximal arcwise-connected subsets) are one-to-one images of lines. We show that essentially all non-trivial one-to-one composant images of…
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.
A $k$-inner planar graph is a planar graph that has a plane drawing with at most $k$ {internal vertices}, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a $0$-inner planar graph. In…