3,750 research outputs found

    Latt\`es maps and combinatorial expansion

    Full text link
    A Latt\`es map f ⁣:C^C^f\colon \hat{\mathbb{C}}\rightarrow \hat{\mathbb{C}} is a rational map that is obtained from a finite quotient of a conformal torus endomorphism. We characterize Latt\`es maps by their combinatorial expansion behavior.Comment: 41 pages, 3 figures. arXiv admin note: text overlap with arXiv:1109.2980; and with arXiv:1009.3647 by other author

    On balanced planar graphs, following W. Thurston

    Full text link
    Let f:S2S2f:S^2\to S^2 be an orientation-preserving branched covering map of degree d2d\geq 2, and let Σ\Sigma be an oriented Jordan curve passing through the critical values of ff. Then Γ:=f1(Σ)\Gamma:=f^{-1}(\Sigma) is an oriented graph on the sphere. In a group email discussion in Fall 2010, W. Thurston introduced balanced planar graphs and showed that they combinatorially characterize all such Γ\Gamma, where ff has 2d22d-2 distinct critical values. We give a detailed account of this discussion, along with some examples and an appendix about Hurwitz numbers.Comment: 17 page

    Expanding Thurston Maps

    Get PDF
    We study the dynamics of Thurston maps under iteration. These are branched covering maps ff of 2-spheres S2S^2 with a finite set post(f)\mathop{post}(f) of postcritical points. We also assume that the maps are expanding in a suitable sense. Every expanding Thurston map fS2S2f\: S^2 \to S^2 gives rise to a type of fractal geometry on the underlying sphere S2S^2. This geometry is represented by a class of \emph{visual metrics} ϱ\varrho that are associated with the map. Many dynamical properties of the map are encoded in the geometry of the corresponding {\em visual sphere}, meaning S2S^2 equipped with a visual metric ϱ\varrho. For example, we will see that an expanding Thurston map is topologically conjugate to a rational map if and only if (S2,ϱ)(S^2, \varrho) is quasisymmetrically equivalent to the Riemann sphere C^\widehat{\mathbf{C}}. We also obtain existence and uniqueness results for ff-invariant Jordan curves CS2\mathcal{C}\subset S^2 containing the set post(f)\mathop{post}(f). Furthermore, we obtain several characterizations of Latt\`{e}s maps.Comment: 492 pages, 51 figure

    Boundary Value Problems on Planar Graphs and Flat Surfaces with integer cone singularities, II: The mixed Dirichlet-Neumann Problem

    Get PDF
    In this paper we continue the study started in part I (posted). We consider a planar, bounded, mm-connected region Ω\Omega, and let \bord\Omega be its boundary. Let T\mathcal{T} be a cellular decomposition of \Omega\cup\bord\Omega, where each 2-cell is either a triangle or a quadrilateral. From these data and a conductance function we construct a canonical pair (S,f)(S,f) where SS is a special type of a (possibly immersed) genus (m1)(m-1) singular flat surface, tiled by rectangles and ff is an energy preserving mapping from T(1){\mathcal T}^{(1)} onto SS. In part I the solution of a Dirichlet problem defined on T(0){\mathcal T}^{(0)} was utilized, in this paper we employ the solution of a mixed Dirichlet-Neumann problem.Comment: 26 pages, 16 figures (color

    Balanced partitions of 3-colored geometric sets in the plane

    Get PDF
    Let SS be a finite set of geometric objects partitioned into classes or colors . A subset S'¿SS'¿S is said to be balanced if S'S' contains the same amount of elements of SS from each of the colors. We study several problems on partitioning 33-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are 2m2m lines of each color, there is a segment intercepting mm lines of each color. (b) Given nn red points, nn blue points and nn green points on any closed Jordan curve ¿¿, we show that for every integer kk with 0=k=n0=k=n there is a pair of disjoint intervals on ¿¿ whose union contains exactly kk points of each color. (c) Given a set SS of nn red points, nn blue points and nn green points in the integer lattice satisfying certain constraints, there exist two rays with common apex, one vertical and one horizontal, whose union splits the plane into two regions, each one containing a balanced subset of SS.Peer ReviewedPostprint (published version
    corecore