Related papers: Wandering continua for rational maps
We analyze the boundaries of multiply connected Fatou components of transcendental maps by means of universal covering maps and associated inner functions. A unified approach is presented, which includes invariant Fatou components (of any…
We introduce the concept of a 1-coaligned $k$-graph and prove that the shift maps of a $k$-graph pairwise *-commute if and only if the $k$-graph is 1-coaligned. We then prove that for 2-graphs $\Lambda$ generated from basic data *-commuting…
A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…
Multistable coupled map lattices typically support travelling fronts, separating two adjacent stable phases. We show how the existence of an invariant function describing the front profile, allows a reduction of the infinitely-dimensional…
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…
A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article, we study the properties of a…
The aim of this note is to extend the result of Angel and Holroyd concerning the transience and the recurrence of transfinite rotor-router walks, for random initial configuration of rotors on homogeneous trees. We address the same question…
We show that a finite number of commuting diffeomorphisms with simultaneously Diophantine rotation numbers are smoothly conjugated to roations.
We study the interfaces' time evolution in one-dimensional bistable extended dynamical systems with discrete time. The dynamics is governed by the competition between a local piece-wise affine bistable mapping and any couplings given by the…
We show that if there exists a topologically expansive homeomorphism on a uniform space, then the space is always a regular space. Through examples we show that in general composition of topologically expansive homeomorphisms need not be…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
A smooth map having only fold singularities is called a fold-map. We will give effective conditions for a continuous map to be homotopic to a fold-map from the viewpoint of the homotopy principle.
A problem of completing a linear map on C*-algebras to a completely positive map is analyzed. It is shown that whenever such a completion is feasible there exists a unique minimal completion. This theorem is used to show that under some…
We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…
Although detailed descriptions of the possible types of behaviour inside periodic Fatou components have been known for over 100 years, a classification of wandering domains has only recently been given. Recently, simply connected wandering…
It is shown that a fixed point of a completely positive map on a semi-finite von Neumann algebra must commute with the operators determining the map (the Lueders phenomenon) if the element is finite or has finite square.
We first define the concept of Lie algebroid in the convenient setting. In reference to the finite dimensional context, we adapt the notion of prolongation of a Lie algebroid over a fibred manifold to a convenient Lie algebroid over a…
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
A necessary and sufficient condition for a random walk in a finite directed graph subject to a road coloring to be measurable with respect to the driving random road colors is proved to be that the road coloring is synchronizing. For this,…