Related papers: Spider's webs of doughnuts

Reliable spanners can withstand huge failures, even when a linear number of vertices are deleted from the network. In case of failures, a reliable spanner may have some additional vertices for which the spanner property no longer holds, but…

We compare two natural bases for the invariant space of a tensor product of irreducible representations of A_2, or sl(3). One basis is the web basis, defined from a skein theory called the combinatorial A_2 spider. The other basis is the…

Let $\mathcal C$ be the Cantor set. For each $n\geqslant 3$ we construct an embedding $A: \mathcal C \times \mathcal C \to \mathbb R^n$ such that $A(\mathcal C \times \{s\})$, for $s\in\mathcal C$, are pairwise ambiently incomparable…

We continue our work on lattice models of webs, which generalise the well-known loop models to allow for various kinds of bifurcations [arXiv:2101.00282, arXiv:2107.10106]. Here we define new web models corresponding to each of the rank-two…

Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$, called `terminal pairs'. Escaping a subset $X\subset T\cap Q$ from $Q$ means finding edge disjoint paths from the…

A line g is a transversal to a family F of convex polytopes in 3-dimensional space if it intersects every member of F. If, in addition, g is an isolated point of the space of line transversals to F, we say that F is a pinning of g. We show…

In this paper we prove that if $1<a\leq b<a^2$ and $X$ is a locally doubling $\delta$-hyperbolic complete connected length metric measure space with $(a,b)$-pinched exponential growth at infinity, then the centred Hardy--Littlewood maximal…

Let $f$ and $g$ be permutable transcendental entire functions. We use a recent analysis of the dynamical behaviour in multiply connected wandering domains to make progress on the long standing conjecture that the Julia sets of $f$ and $g$…

Food webs -- networks of predators and prey -- have long been known to exhibit "intervality": species can generally be ordered along a single axis in such a way that the prey of any given predator tend to lie on unbroken compact intervals.…

A transcendental entire function f is called geometrically finite if the intersection of the set of singular values with the Fatou set is compact and the intersection of the postsingular set with the Julia set is finite. (In particular,…

We consider the family of transcendental entire maps given by $f_a(z)=a(z-(1-a))\exp(z+a)$ where $a$ is a complex parameter. Every map has a superattracting fixed point at $z=-a$ and an asymptotic value at $z=0$. For $a>1$ the Julia set of…

It is shown that for quasiregular maps of positive lower order the Julia set coincides with the boundary of the fast escaping set.

We study topological properties of the escaping endpoints and fast escaping endpoints of the Julia set of complex exponential $\exp(z)+a$ when $a\in (-\infty,-1)$. We show neither space is homeomorphic to the whole set of endpoints. This…

We prove several results concerning the relative position of points in the postsingular set $P(f)$ of a meromorphic map $f$ and the boundary of a Baker domain or the successive iterates of a wandering component. For Baker domains we answer…

We prove a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs, and we obtain a general connectivity principle beyond planarity. Let $G$ be an infinite connected graph properly embedded in $\RR^2$ with…

Petri nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a satisfactory causally reversible semantics. We develop…

Let $G$ be a graph of a network system with vertices, $V(G)$, representing physical locations and edges, $E(G)$, representing informational connectivity. A \emph{locating-dominating (LD)} set $S \subseteq V(G)$ is a subset of vertices…

This paper describes a predictive control method to search for unstable periodic orbits of the generalized tent map. The invariant set containing periodic orbits is a repelling set with a complicated Cantor-like structure. Therefore, a…

We introduce a natural way to construct a random subset of a homogeneous Cantor set $C$ in $[0,1]$ via random labelings of an infinite $M$-ary tree, where $M\geq 2$. The Cantor set $C$ is the attractor of an equicontractive iterated…

The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this "deterministic random walk" covers all…