Related papers: Spider's webs of doughnuts

There are several classes of transcendental entire functions for which the Julia set consists of an uncountable union of disjoint curves each of which joins a finite endpoint to infinity. Many authors have studied the topological properties…

- A hamiltonian graph $G$ verifying $e(G)>n(k-1)/2$ %with a vertex of degree greater or equal than $k$ contains any $k$-spider. - If $G$ is a graph with average degree $\bar{d} > k-1$, then every spider of size $k$ is contained in $G$ for…

A spider is an axiomatization of the representation theory of a group, quantum group, Lie algebra, or other group or group-like object. We define certain combinatorial spiders by generators and relations that are isomorphic to the…

Let $f$ and $g$ be two quasiregular maps in $\mathbb{R}^d$ that are of transcendental type and also satisfy $f\circ g =g \circ f$. We show that if the fast escaping sets of those functions are contained in their respective Julia sets then…

The topology of $SU(3)$-representation varieties of the fundamental groups of planar webs so that the meridians are sent to matrices with trace equal to $-1$ are explored, and compared to data coming from spider evaluation of the webs.…

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…

Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…

Let $f$ be an $R$-closed homeomorphism on a connected orientable closed surface $M$. In this paper, we show that If $M$ has genus more than one, then each minimal set is either a periodic orbit or an extension of a Cantor set. If $M =…

The Erd\"os-S\'os conjecture states that if $G$ is a graph with average degree more than $k-1$, then G contains every tree of $k$ edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that…

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…

Spider webs are incredible biological structures, comprising thin but strong silk filament and arranged into complex hierarchical architectures with striking mechanical properties (e.g., lightweight but high strength, achieving diverse…

In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of…

Let f be a transcendental entire map that is subhyperbolic, i.e., the intersection of the Fatou set F(f) and the postsingular set P(f) is compact and the intersection of the Julia set J(f) and P(f) is finite. Assume that no asymptotic value…

If G is a finite graph, then the largest eigenvalue L of the adjacency matrix of G is a totally real algebraic integer (L is the Perron-Frobenius eigenvalue of G). We say that G is abelian if the field generated by L^2 is abelian. Given a…

The maximum rectilinear crossing number of a graph $G$ is the maximum number of crossings in a good straight-line drawing of $G$ in the plane. In a good drawing any two edges intersect in at most one point (counting endpoints), no three…

Let $f(z) = z^2 + c$ be a quadratic polynomial, with c in the Mandelbrot set. Assume further that both fixed points of f are repelling, and that f is not renormalizable. Then we prove that the Julia set J of f is holomorphically removable…

The `spider theorem' for a general Frobenius algebra $A$, classifies all maps $A^{\otimes m}\to A^{\otimes n}$ that are built from the operations and, in a graphical representation, represented by a {\it connected} diagram. Here the algebra…

Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…

We study the different rates of escape of points under iteration by holomorphic self-maps of $\mathbb C^*=\mathbb C\setminus\{ 0\}$ for which both 0 and $\infty$ are essential singularities. Using annular covering lemmas we construct…

We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…