Related papers: Classification of Escaping Exponential Maps

The classical Euler's problem on optimal configurations of elastic rod in the plane with fixed endpoints and tangents at the endpoints is considered. The global structure of the exponential mapping that parameterises extremal trajectories…

We consider a class $\mathcal{F}$ of Markov multi-maps on the unit interval. Any multi-map gives rise to a space of trajectories, which is a closed, shift-invariant subset of $[0,1]^{\mathbb{Z}_+}$. For a multi-map in $\mathcal{F}$, we show…

We study the pants complex of surfaces of infinite type. When $S$ is a surface of infinite type, the usual definition of the pants graph $\mathcal{P}(S)$ yields a graph with infinitely many connected-components. In the first part of our…

To classify complex rational cuspidal curves $E\subseteq \mathbb{P}^2$ it remains to classify the ones with complement of log general type, i.e. the ones for which $\kappa(K_X+D)=2$, where $(X,D)$ is a log resolution of $(\mathbb{P}^2,E)$.…

We consider the iteration of quasiregular maps of transcendental type from $\mathbb{R}^d$ to $\mathbb{R}^d$. We give a bound on the rate at which the iterates of such a map can escape to infinity in a periodic component of the quasi-Fatou…

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

We consider nonelementary random walks on general hyperbolic spaces. Without any moment condition on the walk, we show that it escapes linearly to infinity, with exponential error bounds. We even get such exponential bounds up to the rate…

We prove EPPA (extension property for partial automorphisms) for all antipodal classes from Cherlin's list of metrically homogeneous graphs, thereby answering a question of Aranda et al. This paper should be seen as the first application of…

Bowen showed that a continuous expansive map with specification has a unique measure of maximal entropy. We show that the conclusion remains true under weaker non-uniform versions of these hypotheses. To this end, we introduce the notions…

The dominant rational maps of finite degree from a fixed variety to varieties of general type, up to birational isomorphisms, form a finite set. This has been known as the Iitaka-Severi conjecture, and is nowdays an established result, in…

We prove that for any holomorphic map, and any bounded orbit which does not accumulate to a singular set or to an attracting cycle, its lower Lyapunov exponent is non-negative. The same result holds for unbounded orbits, for maps with a…

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. We focus on the case where the escape is degenerate in the sense that points from…

In this paper, we consider mappings on uniform domains with exponentially integrable distortion whose Jacobian determinants are integrable. We show that such mappings can be extended to the boundary and moreover these extensions are…

We show that in Zermelo-Fraenkel Set Theory without the Axiom of Choice a surjectively modified continuum function $\theta(\kappa)$ can take almost arbitrary values for all infinite cardinals. This choiceless version of Easton's Theorem is…

In this study, we give definition of some multivalued hybrid mappings which are general than many mappings in the existing literature, then we give some existence and convergence results for these mappings in CAT({\kappa})-spaces

In this paper we use infinitary Turing machines with tapes of length $\kappa$ and which run for time $\kappa$ as presented, e.g., by Koepke \& Seyfferth, to generalise the notion of type two computability to $2^{\kappa}$, where $\kappa$ is…

A graph is trivial if it contains one vertex and no edges. The essential connectivity $\kappa^{\prime}$ of $G$ is defined to be the minimum number of vertices of $G$ whose removal produces a disconnected graph with at least two non-trivial…

For a shift-invariant weighted directed graph with vertex set $\mathbb{Z}$, we examine the minimal weight $\kappa_0$ exiting a finite, strongly connected set of vertices. Although $\kappa_0$ is defined as an infimum, it has been shown that…

We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…