Related papers: Spiders' webs in the Eremenko-Lyubich class
In this paper, we study fast escaping set of transcendental semigroup. We discuss some the structure and properties of fast escaping set of transcendental semigroup. We also see how far the classical theory of fast escaping set of…
In a previous paper we defined a class of non-compact polygonal billiards, the infinite step billiards: to a given decreasing sequence of non-negative numbers $\{p_{n}$, there corresponds a table $\Bi := \bigcup_{n\in\N} [n,n+1] \times…
It is known that, for many transcendental entire functions in the Eremenko-Lyubich class $\mathcal{B}$, every escaping point can eventually be connected to infinity by a curve of escaping points. When this is the case, we say that the…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
For a transcendental entire function $f$ of finite order in the Eremenko-Lyubich class $\mathcal{B}$, we give conditions under which the Lebesgue measure of the escaping set $\mathcal{I}(f)$ of $f$ is zero. This is inspired by the recent…
We partition the fast escaping set of a transcendental entire function into two subsets, the maximally fast escaping set and the non-maximally fast escaping set. These sets are shown to have strong dynamical properties. We show that the…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
If the function $f$ is transcendental and meromorphic in the plane, and either $f$ has finitely many poles or its inverse function has a logarithmic singularity over infinity, then the equation $\dot z = f(z)$ has infinitely many…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
On the trace of a discrete-time simple random walk on $\mathbb{Z}^d$ for $d\geq 2$, we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For $d=2$, we show that almost surely three…
A graph property is said to be elusive ( evasive) if every algorithm testing this property by asking questions of the form "is there an edge between vertices x and y" requires, in the worst case, to ask about all pairs of vertices. The…
We use the folding theorem of Bishop to construct an entire function $f$ in class $B$ and a wandering domain $U$ of $f$ such that $f$ restricted to $f^n(U)$ is univalent, for all $n \geq 0$. The components of the wandering orbit are bounded…
The set of points that escape to infinity under iteration of a cosine map, that is, of the form $C_{a,b} \colon z \mapsto ae^z+be^{-z}$ for $a,b\in \mathbb{C}^\ast$, consists of a collection of injective curves, called dynamic rays. If a…
We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…
Let $f$ be an entire function and denote by $f^\#$ be the spherical derivative of $f$ and by $f^n$ the $n$-th iterate of $f$. For an open set $U$ intersecting the Julia set $J(f)$, we consider how fast $\sup_{z\in U} (f^n)^\#(z)$ and…
The aim of this work is to demonstrate that the continuous-time frog model can spread arbitrary fast. The set of sites visited by an active particle can become infinite in a finite time.
We prove a conjecture of Crapo and Penne which characterizes isotopy classes of skew configurations with spindle-structure. We use this result in order to define an invariant, spindle-genus, for spindle-configurations. We also slightly…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…