Related papers: Spiders' webs in the Eremenko-Lyubich class

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

The burning number is a recently introduced graph parameter indicating the spreading speed of content in a graph through its edges. While the conjectured upper bound on the necessary numbers of time steps until all vertices are reached is…

Filaments are a natural generalization of the well-known concept of dynamic rays in complex dynamics. In this article we investigate which periodic or preperiodic filaments land together for arbitrary post-singularly finite transcendental…

For a transcendental entire function f, we study the set of points BU(f) whose iterates under f neither escape to infinity nor are bounded. We give new results on the connectedness properties of this set and show that, if U is a Fatou…

We establish finiteness of low-dimensional actions of lattices in higher-rank semisimple Lie groups and establish Zimmer's conjecture for many such groups. This builds on previous work of the authors handling the case of actions by…

We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer…

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…

We prove an analog of Boettcher's theorem for transcendental entire functions in the Eremenko-Lyubich class B. More precisely, let f and g be entire functions with bounded sets of singular values and suppose that f and g belong to the same…

The game of Cat Herding is one in which cat and herder players alternate turns, with the evasive cat moving along non-trivial paths between vertices, and the herder deleting single edges from the graph. Eventually the cat cannot move, and…

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

In recent years, the study of complex networks has received a lot of attention. Real systems have gained importance in scientific publications, despite of an important drawback: the difficulty of retrieving and manage such great quantity of…

We consider a class of skew product maps of interval diffeomorphisms over the doubling map. The interval maps fix the end points of the interval. It is assumed that the system has zero fiber Lyapunov exponent at one endpoint and zero or…

The sl_3 spider is a diagrammatic category used to study the representation theory of the quantum group U_q(sl_3). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov- Kuperberg observed that non-elliptic…

We study the escaping set of functions in the class $\mathcal B^*$, that is, holomorphic functions $f:\mathbb C^*\to\mathbb C^*$ for which both zero and infinity are essential singularities, and the set of singular values of $f$ is…

Here we present a rigidity result in a global (semi-global, homotopy) setting for a restrictive class of polytopes, those that can be inscribed in a unit sphere, with some additional conditions. The proof of the rigidity result for cabled…

Let $f$ be a transcendental entire function and $U$ be a Fatou component of $f$. We show that if $U$ is an escaping wandering domain of $f$, then most boundary points of $U$ (in the sense of harmonic measure) are also escaping. In the other…

Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they do not support function spaces, i.e. if X and Y are…

We study the set of networks, which consist of sources, sinks and neutral points, bijective to the permutations. The set of directed edges, which characterizes a network, is constructed from a polyomino or a Rothe diagram of a permutation…