相关论文: Spider's webs of doughnuts

A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ such that the distance in $T$ between every pair of verices is at most $t$ times the distance in $G$ between them. There are efficient algorithms that find a tree $t\cdot…

Assume ZF + AD + V=L(R). Let $[\alpha,\beta]$ be a $\Sigma_1$ gap with $J_\alpha(R)$ admissible. We analyze $J_\beta(R)$ as a natural form of "derived model" of a premouse $P$, where $P$ is found in a generic extension of $V$. In…

We show that repelling periodic points are landing points of periodic rays for exponential maps whose singular value has bounded orbit. For polynomials with connected Julia sets, this is a celebrated theorem by Douady, for which we present…

We study webs in quantum type $C$, focusing on the rank three case. We define a linear pivotal category $\mathbf{Web}(\mathfrak{sp}_6)$ diagrammatically by generators and relations, and conjecture that it is equivalent to the category…

Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…

This paper consists of tow parts. One is to study the existence of a point $a$ in the intersection of Julia set and escaping set such that $\arg z=\theta$ is a singular direction if $\theta$ is a limit point of $\{\arg f^n(a)\}$ under some…

Given a finite, connected graph $G$, the lamplighter chain on $G$ is the lazy random walk $X^\diamond$ on the associated lamplighter graph $G^\diamond={\mathbf Z}_2 \wr G$. The mixing time of the lamplighter chain on the torus ${\mathbf…

We show that for a large class of planar $1$-dimensional random fractals $S$, the Favard length $\operatorname{Fav}(S(r))$ of the neighborhood $S(r)$ is comparable to $\log^{-1}(1/r)$, matching a universal lower bound; up to now, this was…

Let f be a hyperbolic transcendental entire function of finite order in the Eremenko-Lyubich class (or a finite composition of such maps), and suppose that f has a unique Fatou component. We show that the Julia set of $f$ is a Cantor…

As in the case of irreducible holomorphic symplectic manifolds, the period domain $Compl$ of compact complex tori of even dimension $2n$ contains twistor lines. These are special $2$-spheres parametrizing complex tori whose complex…

Let $G$ be the Cartesian product of two finite paths, called a grid, and let $T$ be the set of eight distinct vertices of $G$, called terminals. Assume that $T$ is partitioned into four terminal pairs $\{s_i,t_i\}$, $1\leq i\leq 4$, to be…

Given a permutation $\pi\in \Sn\_n$, construct a graph $G\_\pi$ on the vertex set $\{1,2, ..., n\}$ by joining $i$ to $j$ if (i) $i<j$ and $\pi(i)<\pi(j)$ and (ii) there is no $k$ such that $i < k < j$ and $\pi(i)<\pi(k)<\pi(j)$. We say…

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…

We construct different types of quasiperiodically forced circle homeomorphisms with transitive but non-minimal dynamics. Concerning the recent Poincar\'e-like classification for this class of maps of Jaeger-Stark, we demonstrate that…

We numerically investigate the six-species predator-prey game in complex networks as well as in $d$-dimensional hypercubic lattices with $d=1,2,..., 6$. The interaction topology of the six species contains two loops, each of which is…

It is well-known that every planar graph has a Tutte path, i.e., a path $P$ such that any component of $G-P$ has at most three attachment points on $P$. However, it was only recently shown that such Tutte paths can be found in polynomial…

Let f be a real entire function whose set S(f) of singular values is real and bounded. We show that, if f satisfies a certain function-theoretic condition (the "sector condition"), then $f$ has no wandering domains. Our result includes all…

A new internal description of fundamental fermions (quarks and leptons), based on a matrix-generalization (F) of the scalar fermion-number f, predicts that only three families of quarks and leptons, and their associated neutrinos (nu_e,…

Leveraging the decomposability of the fast Fourier transform, I propose a new class of tensor network that is efficiently contractible and able to represent many-body systems with local entanglement that is greater than the area law.…

In the NP-hard Optimizing PD with Dependencies (PDD) problem, the input consists of a phylogenetic tree $T$ over a set of taxa $X$, a food-web that describes the prey-predator relationships in $X$, and integers $k$ and $D$. The task is to…