Related papers: Spider's webs of doughnuts

Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of…

Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…

In this paper we consider the long-term behavior of points in ${\mathbb R}$ under iterations of continuous functions. We show that, given any Cantor set $\Lambda^*$ embedded in ${\mathbb R}$, there exists a continuous function $F^*:{\mathbb…

Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

The Clifford torus is a torus in a three-dimensional sphere. Homogeneous tori are simple generalization of the Clifford torus which still in a three-dimensional sphere. There is a way to construct tori in a three-dimensional sphere using…

Let $P$ be a polynomial of degree $d$ with a Cremer point $p$ and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets $J_P$. The \emph{red dwarf} $J_P$ are nowhere connected im…

Web graphs form a family of planar directed graphs with boundary that can be used to model quantum $\mathfrak{sl}_n$-invariant vectors. Standard Young tableaux on an $n \times k$ rectangle naturally index a basis for $\mathfrak{sl}_n$ web…

Let f be a transcendental map, and let U be an attracting or parabolic basin, or a doubly parabolic Baker domain. Assume U is simply connected. Then, we prove that periodic points are dense in the boundary of U, under certain hypothesis on…

We construct a transcendental entire $f:\mathbb{C}\rightarrow\mathbb{C}$ such that (1) $f$ has bounded singular set, (2) $f$ has a wandering domain, and (3) each singular value of $f$ escapes to infinity under iteration by $f$.

For a set $A$ let ${{\mathbf {SC}}_A}$ be the poset of simplicial complexes whose vertices are in $A$. For a function $f : A \rightarrow B$ there are functors $ f^{! !}, f^{**}, f^{ii}: {{\mathbf {SC}}_A} \rightarrow {{\mathbf {SC}}_B},…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

"Spider" is a nickname of special Frobenius algebras, a fundamental structure from mathematics, physics, and computer science. Pregroups are a fundamental structure from linguistics. Pregroups and spiders have been used together in natural…

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…

Graph burning is one model for the spread of memes and contagion in social networks. The corresponding graph parameter is the burning number of a graph $G$, written $b(G)$, which measures the speed of the social contagion. While it is…

A tensor network is a product of tensors associated with vertices of some graph $G$ such that every edge of $G$ represents a summation (contraction) over a matching pair of indexes. It was shown recently by Valiant, Cai, and Choudhary that…

We show that $(n,d,\lambda)$-graphs with $\lambda=O(d/\log^3 n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang of the form…

Algebraic Petri nets are a formalism for modeling distributed systems and algorithms, describing control and data flow by combining Petri nets and algebraic specification. One way to specify correctness of an algebraic Petri net model $N$…

We prove that there exists a non-trivial transcendental semigroup S such that the wandering (or pre-periodic or periodic) components of Fatou set F(S) has at least a simply connected domain D.

Given an edge ideal of graph G, we show that if the first nonlinear strand in the resolution of $I_G$ is zero until homological stage $a_1$, then the next nonlinear strand in the resolution is zero until homological stage $2a_1$.…