Related papers: Spider's webs of doughnuts
Let $f$ be a transcendental entire function. By a result of Rippon and Stallard, there exist points whose orbit escapes arbitrarily slowly. By using a range of techniques to prove new covering results, we extend their theorem to prove the…
Let $f$ be a meromorphic function with bounded set of singular values and for which infinity is a logarithmic singularity. Then we show that $f$ has infinitely many repelling periodic points for any minimal period $n\geq1$, using a much…
A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if…
We present a constructive approximation framework for analyzing the expressive power of Fourier residual networks in approximating a broad class of one-dimensional functions. Our study covers both piecewise continuous functions -- including…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
A butterfly network consists of logarithmically many layers, each with a linear number of non-zero weights (pre-specified). The fast Johnson-Lindenstrauss transform (FJLT) can be represented as a butterfly network followed by a projection…
It is well-known that the Julia set of a hyperbolic rational map is quasisymmetrically equivalent to the standard Cantor set. Using the uniformization theorem of David and Semmes, this result comes down to the fact that such a Julia set is…
We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…
We discuss the dynamic and structural properties of polynomial semigroups, a natural extension of iteration theory to random (walk) dynamics, where the semigroup $G$ of complex polynomials (under the operation of composition of functions)…
We prove that every transcendental meromorphic map f with a disconnected Julia set has a weakly repelling fixed point. This implies that the Julia set of Newton's method for finding zeroes of an entire map is connected. Moreover, extending…
We give a definition of $\mathsf{Q}$-net, a generalization of Petri nets based on a Lawvere theory $\mathsf{Q}$, for which many existing variants of Petri nets are a special case. This definition is functorial with respect to change in…
In this paper we introduce $p-$Ferrer diagram, note that $1-$ Ferrer diagram are the usual Ferrer diagrams or Ferrer board, and corresponds to planar partitions. To any $p-$Ferrer diagram we associate a $p-$Ferrer ideal. We prove that…
It is known that, for many transcendental entire functions in the Eremenko-Lyubich class $\mathcal{B}$, every escaping point can eventually be connected to infinity by a curve of escaping points. When this is the case, we say that the…
Assume ZF + AD + $V=L(\mathbb{R})$. We prove some "mouse set" theorems, for definability over $J_\alpha(\mathbb{R})$ where $[\alpha,\alpha]$ is a projective-like gap (of $L(\mathbb{R})$) and $\alpha$ is either a successor ordinal or has…
For any constants $d\ge 1$, $\epsilon >0$, $t>1$, and any $n$-point set $P\subset\mathbb{R}^d$, we show that there is a geometric graph $G=(P,E)$ having $O(n\log^2 n\log\log n)$ edges with the following property: For any $F\subseteq P$,…
Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…
Given a bipartite graph $G=(V_b,V_r,E)$, the $2$-Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_b$ and in $V_r$ lie along two parallel lines $\ell_b$ and $\ell_r$,…
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a…
A spanner is reliable if it can withstand large, catastrophic failures in the network. More precisely, any failure of some nodes can only cause a small damage in the remaining graph in terms of the dilation, that is, the spanner property is…
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…