Related papers: Spiders' webs in the Eremenko-Lyubich class
We show that for any quasimeromorphic mapping with an essential singularity at infinity, there exist points whose iterates tend to infinity arbitrarily slowly. This extends a result by Nicks for quasiregular mappings, and Rippon and…
Building on the work of Cassels we prove the existence of infinite families of compact orbits of the diagonal group in the space of lattices which accumulate only on the divergent orbit of the standard lattice. As a consequence, we prove…
We study the iteration of functions in the exponential family. We construct a number of sets, consisting of points which escape to infinity `slowly', and which have Hausdorff dimension equal to 1. We prove these results by using the idea of…
In 1988, Mayer proved the remarkable fact that infinity is an explosion point for the set of endpoints of the Julia set of an exponential map that has an attracting fixed point. That is, the set is totally separated (in particular, it does…
The escaping set I(f) of a transcendental meromorphic function f consists of all points which tend to infinity under iteration. The Eremenko-Lyubich class B consists of all transcendental meromorphic functions for which the set of finite…
The escaping set of an entire function is the set of points that tend to infinity under iteration. We consider subsets of the escaping set defined in terms of escape rates and obtain upper and lower bounds for the Hausdorff measure of these…
We construct an entire function in the Eremenko-Lyubich class $\B$ whose Julia set has only bounded path-components. This answers a question of Eremenko from 1989 in the negative. On the other hand, we show that for many functions in $\B$,…
The goal of this note is to generalize Thurston's Topological Characterization of Rational Functions to the setting when both the covering degree and the set of marked points are infinite. A relevant class of branched coverings are…
We develop a general technique for realising full closed subsets of the complex plane as wandering sets of entire functions. Using this construction, we solve a number of open problems. (1) We construct a counterexample to Eremenko's…
We construct exponential maps for which the singular value tends to infinity under iterates while the maps are ergodic. This is in contrast with a result of Lyubich from 1987 which tells that $e^z$ is not ergodic.
We develop techniques that lay out a basis for generalizations of the famous Thurston's Topological Characterization of Rational Functions for an infinite set of marked points and branched coverings of infinite degree. Analogously to the…
Let $f$ be an entire function with the form $f(z)=P(e^z)/e^z$, where $P$ is a polynomial with degree at least $2$ and $P(0)\neq 0$. We prove that the area of the complement of the fast escaping set (hence the Fatou set) of $f$ in a…
A Mazurkiewicz set is a plane subset that intersect every straight line at exactly two points, and a Sierpi\'{n}ski-Zygmund function is a function from $\mathbb{R}$ into $\mathbb{R}$ that has as little of the standard continuity as…
Persistence is a strong, global, behavioural property of a Petri net, meaning that no activity can disable a different activity. Persistent permutability is a weaker property, pertaining to individual interleavings of a Petri net and…
Let $f\colon\mathbb{C}\to\mathbb{C}$ be a transcendental entire function. In 1989, Eremenko asked the following question concerning the set $I(f)$ of points that tend to infinity under iteration: can every point of $I(f)$ be joined to…
We determine the exact Borel class of the points whose iterates under $\exp(z)+a$ tend to infinity. We also prove that the sets of non-escaping Julia points for many of these functions are topologically equivalent.
A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…
Recently Bishop constructed the first example of a bounded-type transcendental entire function with a wandering domain using a new technique called quasiconfomal folding. It is easy to check that his method produces an entire function of…
The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled…
We give a complete classification of the set of parameters $\kappa$ for which the singular value of $E_{\kappa}:z\mapsto \exp(z)+\kappa$ escapes to infinity under iteration. In particular, we show that every path-connected component of this…