English
Related papers

Related papers: Monotone mappings and lines

200 papers

In this paper we will modify the Milnor--Thurston map, which maps a one dimensional mapping to a piece-wise linear of the same entropy, and study its properties. This will allow us to give a simple proof of monotonicity of topological…

Dynamical Systems · Mathematics 2019-01-23 Oleg Kozlovski

We study the topological construction called Mapper in the context of simply connected domains, in particular on images. The Mapper construction can be considered as a generalization for contour, split, and joint trees on simply connected…

Computer Vision and Pattern Recognition · Computer Science 2017-12-11 Alejandro Robles , Mustafa Hajij , Paul Rosen

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Computational Geometry · Computer Science 2015-07-16 David Eppstein

Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If the range is not sofic, then the same result holds when…

Dynamical Systems · Mathematics 2009-09-24 Uijin Jung

A folklore result due to M.W. Hirsch states that most competitive maps admit a carrying simplex, i.e., an invariant hypersurface which attracts all nontrivial orbits. The common approach in the study of these maps is to focus on the…

Dynamical Systems · Mathematics 2019-09-30 Janusz Mierczyński , Lei Niu , Alfonso Ruiz-Herrera

There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…

Computational Geometry · Computer Science 2025-08-22 Sanjeev Saxena

The Harmonic Mapping Problem asks when there exists a harmonic homeomorphism between two given domains. It arises in the theory of minimal surfaces and in calculus of variations, specifically in hyperelasticity theory. We investigate this…

Complex Variables · Mathematics 2011-09-28 Tadeusz Iwaniec , Leonid V. Kovalev , Jani Onninen

Let $X$ be a Banach space and $Conv_H(X)$ be the space of non-empty closed convex subsets of $X$, endowed with the Hausdorff metric $d_H$. We prove that each connected component of the space $Conv_H(X)$ is homeomorphic to one of the spaces:…

Geometric Topology · Mathematics 2014-12-04 Taras Banakh , Ivan Hetman , Katsuro Sakai

The first author proved that the harmonic convolution of a normalized right half-plane mapping with either another normalized right half-plane mapping or a normalized vertical strip mapping is convex in the direction of the real axis.…

Complex Variables · Mathematics 2009-03-10 Michael Dorff , Maria Nowak , Magdalena Woloszkiewicz

In the present paper, we derive several conditions of linear combinations and convolutions of harmonic mappings to be univalent and convex in one direction, one of them gives a partial answer to an open problem proposed by Dorff. The…

Complex Variables · Mathematics 2021-11-02 Zhi-Gang Wang , Lei Shi , Yue-Ping Jiang

The possibilities for new or unusual kinds of topological, locally linear periodic maps of non-prime order on closed, simply connected 4-manifolds with positive definite intersection pairings are explored. On the one hand, certain…

Geometric Topology · Mathematics 2014-11-11 Allan L Edmonds

In this paper we study free mappings of the plane, that is orientation preserving fixed point free homeomorphisms of $\mathbb{R}^2$. We provide a necessary and sufficient condition under which two free mappings of the plane that are…

Dynamical Systems · Mathematics 2022-11-17 Sushil Bhunia , Gangotryi Sorcar

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

Combinatorics · Mathematics 2018-10-15 Jozsef Balogh , Jozsef Solymosi

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

Spectral Theory · Mathematics 2007-05-23 Marianne Akian , Stephane Gaubert

We consider semidifferentiable (possibly nonsmooth) maps, acting on a subset of a Banach space, that are nonexpansive either in the norm of the space or in the Hilbert's or Thompson's metric inherited from a convex cone. We show that the…

Functional Analysis · Mathematics 2014-03-12 Marianne Akian , Stephane Gaubert , Roger Nussbaum

Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…

Computational Geometry · Computer Science 2024-05-10 Philip Smith , Vitaliy Kurlin

A basic problem in machine learning is to find a mapping $f$ from a low dimensional latent space $\mathcal{Y}$ to a high dimensional observation space $\mathcal{X}$. Modern tools such as deep neural networks are capable to represent general…

Machine Learning · Computer Science 2022-08-02 Ke Sun

We consider a class of simple one parameter families of interval maps, and we study how metric (resp. topological) entropy changes as the parameter varies. We show that in many cases the entropy displays a semi-regular behaviour, i.e. it is…

Dynamical Systems · Mathematics 2017-07-25 Henk Bruin , Carlo Carminati , Stefano Marmi , Alessandro Profeti

We show that every planar graph has a monotone topological 2-page book embedding where at most (4n-10)/5 (of potentially 3n-6) edges cross the spine, and every edge crosses the spine at most once; such an edge is called a biarc. We can also…

Discrete Mathematics · Computer Science 2024-08-27 Steven Chaplick , Henry Förster , Michael Hoffmann , Michael Kaufmann

Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…

Computational Geometry · Computer Science 2020-08-26 Michael Hoffmann , Chih-Hung Liu , Meghana M. Reddy , Csaba D. Tóth