Related papers: From rubber bands to rational maps: A research rep…

When is a topological branched self-cover of the sphere equivalent to a rational map on CP^1? William Thurston gave one answer in 1982, giving a negative criterion (an obstruction to a map being rational). We give a complementary, positive…

We develop a Thurston-like theory to characterize geometrically finite rational maps, then apply it to study pinching and plumbing deformations of rational maps. We show that in certain conditions the pinching path converges uniformly and…

The elastic response is studied of a single flexible chain grafted on a rigid plane and an ensemble of non-interacting tethered chains. It is demonstrated that the entropic theory of rubber elasticity leads to conclusions that disagree with…

In the early 1980's Thurston gave a topological characterization of rational maps whose critical points have finite iterated orbits (\cite{Th,DH1}): given a topological branched covering $F$ of the two sphere with finite critical orbits, if…

Recent work of Dylan Thurston gives a condition for when a post-critically finite branched self-cover of the sphere is equivalent to a rational map. We apply D. Thurston's positive criterion for rationality to give a new proof of a theorem…

We study canonical decompositions of postcritically finite branched coverings of the 2-sphere, as defined by K. Pilgrim. We show that every hyperbolic cycle in the decomposition does not have a Thurston obstruction. It is thus Thurston…

Given a sub-hyperbolic semi-rational branched covering which is not CLH-equivalent a rational map, it must have the non-empty canonical Thurston obstruction. By using this canonical Thurston obstruction, we decompose this dynamical system…

An elastic graph is a graph with an elasticity associated to each edge. It may be viewed as a network made out of ideal rubber bands. If the rubber bands are stretched on a target space there is an elastic energy. We characterize when a…

We study the group of self-equivalences of a partially postcritically finite branched cover and answer a question of Adam Epstein about contractibility of certain deformation spaces of rational maps.

We study canonical decompositions of postcritically finite branched coverings of the 2-sphere, as defined by K.~Pilgrim. We show that every hyperbolic cycle in the decomposition does not have a Thurston obstruction. It is thus Thurston…

We suggest a way to associate to a rational map of the Riemann sphere a three dimensional object called a hyperbolic orbifold 3-lamination. The relation of this object to the map is analogous to the relation of a hyperbolic 3-manifold to a…

Building on the dictionary between Kleinian groups and rational maps, we establish new connections between the theories of hyperbolic groups and certain iterated maps, regarded as dynamical systems. In order to make the exposition…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

Rational maps on the Riemann sphere occupy a distinguished niche in the general theory of smooth dynamical systems. First, rational maps are complex-analytic, so a broad spectrum of techniques can contribute to their study (quasiconformal…

We define analytic maps between super Riemann surfaces which extend the notion of branched covering maps to a supersymmetric setting. We show that these super covering maps appear naturally both in symmetric product orbifolds of…

We study relations between maps between relatively hyperbolic groups/spaces and quasisymmetric embeddings between their boundaries. More specifically, we establish a correspondence between (not necessarily coarsely surjective)…

Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a…

We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups. We compare characterizations of superreflexivity in terms of diamond graphs and binary trees. We show that there exist…

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

Whitney proved that 3-connected planar graphs admit a unique embedding on the sphere. In contrast, Enami investigated embeddings of 3-connected cubic planar graphs on non-spherical surfaces with non-negative Euler characteristic. He…