Related papers: Spiders' webs in the Eremenko-Lyubich class
This paper discusses, certain algebraic, analytic, and topological results on partial iterated function systems($IFS_p$'s). Also, the article proves the Collage theorem for partial iterated function systems. Further, it provides a method to…
We prove that the class of all loops with the inverse property (IP loops) has the Finite Embedding Property (FEP). As a consequence, every group is locally embeddable into finite IP loops.
Let $f$ be a transcendental entire function. The fast escaping set, $A(f)$, plays a key role in transcendental dynamics. The quite fast escaping set, $Q(f)$, defined by an apparently weaker condition is equal to $A(f)$ under certain…
We show that for a transcendental entire function the set of points whose orbit under iteration is bounded can have arbitrarily small positive Hausdorff dimension.
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…
We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…
The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeatedly applying local rules on a network, and touch on the…
We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors…
The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…
We study the iteration of transcendental self-maps of $\mathbb{C}^*:=\mathbb{C}\setminus \{0\}$, that is, holomorphic functions $f:\mathbb{C}^*\to\mathbb{C}^*$ for which both zero and infinity are essential singularities. We use…
We address the discrete inverse conductance problem for well-connected spider networks; that is, to recover the conductance function on a well-connected spider network from the Dirichlet-to-Neumann map. It is well-known that this inverse…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. We focus on the case where the escape is degenerate in the sense that points from…
We prove a converse Lyapunov theorem for boundedness of reachability sets for a general class of control systems whose flow is Lipschitz continuous on compact intervals with respect to trajectory-dominated inputs. We show that this…
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…
In this paper, the study of the global orbit pattern (gop) formed by all the periodic orbits of discrete dynamical systems on a finite set $X$ allows us to describe precisely the behaviour of such systems. We can predict by means of closed…
A method to compute the full hierarchy of the critical subsets of a density field is presented. It is based on a watershed technique and uses a probability propagation scheme to improve the quality of the segmentation by circumventing the…
Bergweiler and Kotus gave sharp upper bounds for the Hausdorff dimension of the escaping set of a meromorphic function in the Eremenko-Lyubich class, in terms of the order of the function and the maximal multiplicity of the poles. We show…
We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial…
Recent advances in cutting-plane strategies applied to robust optimization problems show that they are competitive with respect to problem reformulations and interior-point algorithms. However, although its application with polyhedral…