Related papers: Unicritical and Maximally Critical Laminations
Laminations are a combinatorial and topological way to study Julia sets. Laminations give information about the structure of parameter space of degree $d$ polynomials with connected Julia sets. We first study fixed point portraits in…
By studying laminations of the unit disk, we can gain insight into the structure of Julia sets of polynomials and their dynamics in the complex plane. The polynomials of a given degree, $d$, have a parameter space. The hyperbolic components…
Given any rational map $f$, there is a lamination by Riemann surfaces associated to $f$. Such laminations were constructed in general by Lyubich and Minsky. In this paper, we classify laminations associated to quadratic polynomials with…
Thurston introduced \emph{invariant (quadratic) laminations} in his 1984 preprint as a vehicle for understanding the connected Julia sets and the parameter space of quadratic polynomials. Important ingredients of his analysis of the angle…
The aim of this work is to describe the equivalence relations in $\Q/\Z$ that arise as the rational lamination of polynomials with all cycles repelling. We also describe where in parameter space one can find a polynomial with all cycles…
This paper studies the space of degree $d>1$ invariant q-laminations, i.e., geodesic laminations invariant under the $d$-tupling map of the circle and associated with equivalence relations. Our main construction associates a q-lamination…
In this paper, we introduce a Collet-Eckmann type condition for the unicritical laminations on the unit circle. We prove that this condition implies the lamination admits a H\"older continuous conformal welding which produces a Julia set…
We continue the study of constructing invariant Laplacians on Julia sets, and studying properties of their spectra. In this paper we focus on two types of examples: 1) Julia sets of cubic polynomials $z^3 + c$ with a single critical point;…
Degree-$d$-invariant laminations of the disk model the dynamical action of a degree-$d$ polynomial; such a lamination defines an equivalence relation on $S^1$ that corresponds to dynamical rays of an associated polynomial landing at the…
Thurston parameterized quadratic invariant laminations with a non-invariant lamination, the quotient of which yields a combinatorial model for the Mandelbrot set. As a step toward generalizing this construction to cubic polynomials, we…
The so-called "pinched disk" model of the Mandelbrot set is due to A.~Douady, J.~H.~Hubbard and W.~P.~Thurston. It can be described in the language of geodesic laminations. The combinatorial model is the quotient space of the unit disk…
By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, a…
In this work, we relate the geometry of chaotic attractors of typical analytic unimodal maps to the behavior of the critical orbit. Our main result is an explicit formula relating the combinatorics of the critical orbit with the exponents…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
We prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…
We answer the question which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning…
We study determinantal Cremona maps, i.e. birational maps whose base ideal is the maximal minors ideal of a given matrix $\Phi$, via the resolution of the polynomials systems defined by $\Phi$. Using convex geometry, this approach leads in…
In this article, we introduce the adapted inverse iteration method to generate bicomplex Julia sets associated to the polynomial map $w^2+c$. The result is based on a full characterization of bicomplex Julia sets as the boundary of a…