Related papers: A Combinatorial Classification of Postsingularly F…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We give a complete combinatorial description of the bifurcation structure in the space of exponential maps $z\mapsto\exp(z)+\kappa$. This combinatorial structure is the basis for a number of important results about exponential parameter…
We define two classes of topological infinite degree covering maps modeled on two families of transcendental holomorphic maps. The first, which we call exponential maps of type $(p,q)$, are branched covers and is modeled on transcendental…
In this paper we define a topological class of branched covering maps of the plane called {\em topological exponential maps of type $(p,q)$} and denoted by $\TE_{p,q}$, where $p\geq 0$ and $q\geq 1$. We follow the framework given in…
We prove that every postsingularly finite entire map $g$ can be approximated by a sequence of postcritically finite complex polynomials $(g_n)$ such that their postsingular dynamics $g|P_g$ and $g_n|P_{g_n}$ are conjugate for every $n \in…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).
Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…
We obtain a unique, canonical one-to-one correspondence between the space of marked postcritically finite Newton maps of polynomials and the space of postcritically minimal Newton maps of entire maps that take the form $p(z)…
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…
We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and…
Alternating bilinear maps with few relations allow to define a combinatorial closure similarly as in [2]. For the $\aleph_0$-categorical case we show that this closure is part of the algebraic closure.
In this paper, we introduce cosine Thurston maps. In particular, we construct postsingularly finite topological cosine maps and focus on such maps with strictly preperiodic critical points. We use the techniques of Hubbard, Schleicher, and…
We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
We extend the work of Bielefeld, Fisher and Hubbard on Critical Portraits to the case of arbitrary postcritically finite polynomials. This determines an effective classification of postcritically finite polynomials as dynamical systems.…