Related papers: The Inverse Iteration Method for Julia Sets in the…
We give examples of infinitely renormalizable quadratic polynomials $F_c: z\maps to z^2+c$ with stationary combinatorics whose Julia sets have Hausdorff dimension arbitrar y close to 1. The combinatorics of the renormalization involved is…
We estimate the upper box and Hausdorff dimensions of the Julia set of an expanding semigroup generated by finitely many rational functions, using the thermodynamic formalism in ergodic theory. Furthermore, we show Bowen's formula, and the…
We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…
We explore the connected/disconnected dichotomy for the Julia set of polynomial automorphisms of C^2. We develop several aspects of the question, which was first studied by Bedford-Smillie. We introduce a new sufficient condition for the…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
We give an explicit Pieri formula for Macdonald polynomials attached to the root system C_n (with equal multiplicities). By inversion we obtain an explicit expansion for two-row Macdonald polynomials of type C.
In this paper we examine the existence of bicomplexified inverse Fourier transform as an extension of its complexified inverse version within the region of convergence of bicomplex Fourier transform. In this paper we use the idempotent…
We completely characterize the conformal radii of Siegel disks in the family $$P_\theta(z)=e^{2\pi i\theta}z+z^2,$$ corresponding to {\bf computable} parameters $\theta$. As a consequence, we constructively produce quadratic polynomials…
Hyperbolic Julia sets of complex polynomials are known to be computable in polynomial time due to pioneering work of Braverman in 2005 (10.1016/j.entcs.2004.06.031). In this paper, we present an alternative method for establishing poly-time…
Metasurfaces are an emerging technology that may supplant many of the conventional optics found in imaging devices, displays, and precision scientific instruments. Here, we develop a method for designing optical systems composed of multiple…
In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…
We describe a rigorous computer algorithm for attempting to construct an explicit, discretized metric for which a complex polynomial map is expansive on a given neighborhood of its Julia set. We show construction of such a metric proves the…
For maps of one complex variable, $f$, given as the sum of a degree $n$ power map and a degree $d$ polynomial, we provide necessary and sufficient conditions that the geometric limit as $n$ approaches infinity of the set of points that…
We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…
A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…
We realize a dynamical decomposition for a post-critically finite rational map which admits a combinatorial decomposition. We split the Riemann sphere into two completely invariant subsets. One is a subset of the Julia set consisting of…
In this paper, a multiplicity preserving triangular set decomposition algorithm is proposed for a system of two polynomials. The algorithm decomposes the variety defined by the polynomial system into unmixed components represented by…
We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time.
Using computer graphics and visualization algorithms, we extend in this work the results obtained analytically in [1], on the connectivity domains of alternated Julia sets, defined by switching the dynamics of two quadratic Julia sets. As…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…