English
Related papers

Related papers: Thurston equivalence to a rational map is decidabl…

200 papers

Let $S$ be a rational projective surface given by means of a projective rational parametrization whose base locus satisfies a mild assumption. In this paper we present an algorithm that provides three rational maps $f,g,h:\mathbb{A}^2 --\to…

Algebraic Geometry · Mathematics 2021-01-19 Jorge Caravantes , J. Rafael Sendra , David Sevilla , Carlos Villarino

We introduce and study tame homeomorphisms of surfaces of infinite type. These are maps for which curves under iterations do not accumulate onto geodesic laminations with non-proper leaves, but rather just a union of possibly intersecting…

Geometric Topology · Mathematics 2023-10-19 Mladen Bestvina , Federica Fanoni , Jing Tao

For a post-critically finite branched covering of the sphere that is a subdivision map of a finite subdivision rule, we define non-expanding spines which determine the existence of a Levy cycle in a non-exhaustive semi-decidable algorithm.…

Dynamical Systems · Mathematics 2022-02-14 Insung Park

We develop techniques that lay out a basis for generalizations of the famous Thurston's Topological Characterization of Rational Functions for an infinite set of marked points and branched coverings of infinite degree. Analogously to the…

Dynamical Systems · Mathematics 2023-02-02 Konstantin Bogdanov

A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…

Commutative Algebra · Mathematics 2019-05-31 Juan Gerardo Alcázar , Emily Quintero

Given a simplicial pair $(X,A)$, a simplicial complex $Y$, and a map $f:A \to Y$, does $f$ have an extension to $X$? We show that for a fixed $Y$, this question is algorithmically decidable for all $X$, $A$, and $f$ if $Y$ has the rational…

Algebraic Topology · Mathematics 2024-10-22 Fedor Manin

In earlier work, we had shown that Cannon-Thurston maps exist for Kleinian surface groups. In this paper we prove that pre-images of points are precisely end-points of leaves of the ending lamination whenever the Cannon-Thurston map is not…

Geometric Topology · Mathematics 2014-03-18 Mahan Mj

The goal of this note is to generalize Thurston's Topological Characterization of Rational Functions to the setting when both the covering degree and the set of marked points are infinite. A relevant class of branched coverings are…

Dynamical Systems · Mathematics 2025-07-29 Konstantin Bogdanov

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

Symbolic Computation · Computer Science 2009-11-13 Juan Gerardo Alcazar

An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…

Dynamical Systems · Mathematics 2025-06-11 Christopher Cabezas , Julien Leroy

In this paper we will modify the Milnor--Thurston map, which maps a one dimensional mapping to a piece-wise linear of the same entropy, and study its properties. This will allow us to give a simple proof of monotonicity of topological…

Dynamical Systems · Mathematics 2019-01-23 Oleg Kozlovski

We consider Thurston maps, i.e., branched covering maps $f\colon S^2\to S^2$ that are postcritically finite. In addition, we assume that $f$ is expanding in a suitable sense. It is shown that each sufficiently high iterate $F=f^n$ of $f$ is…

Complex Variables · Mathematics 2013-04-10 Daniel Meyer

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

Symbolic Computation · Computer Science 2015-02-17 Juan Gerardo Alcazar , Gema Maria Diaz-Toca

Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…

Number Theory · Mathematics 2019-02-20 Clayton Petsche

The Epstein deformation space parameterizes marked rational maps with prescribed combinatorial and dynamical structure. For the family of quadratic rational maps with a periodic critical cycle of order 4 and an extra critical point not…

Dynamical Systems · Mathematics 2019-03-20 Eriko Hironaka

Expanding Thurston maps form a class of branched covering maps on the topological $2$-sphere $S^{2}$, which are topological models of some non-uniformly expanding rational maps without any smoothness or holomorphicity assumption initially…

Dynamical Systems · Mathematics 2025-08-28 Zhiqiang Li , Yiwei Zhang

Every Thurston map $f\colon S^2\rightarrow S^2$ on a $2$-sphere $S^2$ induces a pull-back operation on Jordan curves $\alpha\subset S^2\setminus P_f$, where $P_f$ is the postcritical set of $f$. Here the isotopy class $[f^{-1}(\alpha)]$…

Dynamical Systems · Mathematics 2024-11-20 Mario Bonk , Mikhail Hlushchanka , Annina Iseli

Let $f$ be a postcritically finite branched self-cover of a 2-dimensional topological sphere. Such a map induces an analytic self-map $\sigma_f$ of a finite-dimensional Teichm\"uller space. We prove that this map extends continuously to the…

Dynamical Systems · Mathematics 2012-04-30 Nikita Selinger

We obtain an analogue of the prime number theorem for a class of branched covering maps on the $2$-sphere called expanding Thurston maps $f$, which are topological models of some rational maps without any smoothness or holomorphicity…

Dynamical Systems · Mathematics 2018-04-24 Zhiqiang Li , Tianyi Zheng

We show that the determinization problem for min-plus (tropical) weighted automata is decidable, thus resolving this long-standing open problem. In doing so, we develop a new toolbox for analyzing and reasoning about the run-structure of…

Formal Languages and Automata Theory · Computer Science 2025-04-01 Shaull Almagor , Guy Arbel , Sarai Sheinvald
‹ Prev 1 3 4 5 6 7 10 Next ›