Related papers: Wandering continua for rational maps
We show that every continuous map from one translationally finite tiling space to another can be approximated by a local map. If two local maps are homotopic, then the homotopy can be chosen so that every interpolating map is also local.
We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…
We analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…
Motivated by the intermediate Lang conjectures on hyperbolicity and rational points, we prove new finiteness results for non-constant morphisms from a fixed variety to a fixed variety defined over a number field by applying Faltings's…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
Given an infinite connected regular graph $G=(V,E)$, place at each vertex Pois($\lambda$) walkers performing independent lazy simple random walks on $G$ simultaneously. When two walkers visit the same vertex at the same time they are…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under…
We describe the ringed-space structure of moduli spaces of jets of linear connections (at a point) as orbit spaces of certain linear representations of the general linear group. Then, we use this fact to prove that the only (scalar)…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…
The classification of Fatou components for rational functions was concluded with Sullivan's proof of the No Wandering Domains Theorem in 1985. In 2016 it was shown, in joint work of the first and last author with Buff, Dujardin and Raissy,…
Let $A$ be a rational function. For any decomposition of $A$ into a composition of rational functions $A=U\circ V$ the rational function $\widetilde A=V\circ U$ is called an elementary transformation of $A$, and rational functions $A$ and…
Continuity of set-valued maps is hereby revisited: after recalling some basic concepts of variational analysis and a short description of the State-of-the-Art, we obtain as by-product two Sard type results concerning local minima of scalar…
A precise meaning is given to the notion of continuous iteration of a mapping. Usual discrete iterations are extended into a dynamical flow which is a homotopy of them all. The continuous iterate reveals that a dynamical map is formend by…
We give necessary and sufficient conditions for lobe-transitivity of locally finite and locally countable graphs whose connectivity equals 1. We show further that, given any biconnected graph $\Lambda$ and a "code" assigned to each orbit of…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
It is shown that if a planar graph admits no non-constant bounded harmonic functions then the trajectories of two independent simple random walks intersect almost surely.
It is conjectured that a rational map whose coefficients are algebraic over $\Q_p$ has no wandering components of the Fatou set. R. Benedetto has shown that any counter example to this conjecture must have a wild recurrent critical point.…
It is shown that any finite, rank-connected, dismantlable lattice is lexicographically shellable (hence Cohen-Macaulay). A ranked, interval-connected lattice is shown to be rank-connected, but a rank-connected lattice need not be…