English
Related papers

Related papers: Poly-time Computability of the Feigenbaum Julia se…

200 papers

The Fatou-Julia iteration theory of rational functions has been extended to quasiregular mappings in higher dimension by various authors. The purpose of this paper is an analogous extension of the iteration theory of transcendental entire…

Dynamical Systems · Mathematics 2014-11-04 Walter Bergweiler , Daniel A. Nicks

We consider the dynamics of rational semigroups (semigroups of rational maps) on the Riemann sphere. We provide proof that a random backward iteration algorithm to draw the pictures of the Julia sets, previously proven to work in the…

Dynamical Systems · Mathematics 2013-12-06 Rich Stankewitz , Hiroki Sumi

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

Optimization and Control · Mathematics 2026-01-30 Amir Ali Ahmadi , Georgina Hall

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

Dynamical Systems · Mathematics 2024-01-22 Malte Hassler , Dierk Schleicher

Given a critically periodic quadratic map with no secondary renormalizations, we introduce the notion of $Q$-recurrent quadratic polynomials. We show that the pieces of the principal nest of a $Q$-recurrent map $f_c$ converge in shape to…

Dynamical Systems · Mathematics 2007-05-23 Rodrigo A. Pérez

The polylogarithm function is one of the constellation of important mathematical functions. It has a long history, and many connections to other special functions and series, and many applications, for instance in statistical physics.…

Numerical Analysis · Mathematics 2020-10-21 Matthew Roughan

We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of unordered interval graphs, any query is…

Logic in Computer Science · Computer Science 2011-01-14 Bastian Laubner

Let $f:z\mapsto z^2+c$ be a quadratic polynomial whose Julia set $J$ is locally-connected of the set of biaccessible points in $J$ is zero except when $f(z)=z^2-2$ is the Chebyshev quadratic polynomial for which the corresponding measure is…

Dynamical Systems · Mathematics 2007-05-23 Saaed Zakeri

Let $f$ be a quadratic polynomial which has an irrationally indifferent fixed point $\alpha$. Let $z$ be a biaccessible point in the Julia set of $f$. Then: 1. In the Siegel case, the orbit of $z$ must eventually hit the critical point of…

Dynamical Systems · Mathematics 2016-09-07 Saeed Zakeri

In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.

Programming Languages · Computer Science 2007-05-23 Fred Mesnard , Alexander Serebrenik

We prove a Julia inequality for bounded non-commutative functions on polynomial polyhedra. We use this to deduce a Julia inequality for holomorphic functions on classical domains in $\mathbb{C}^d$. We look at differentiability at a boundary…

Complex Variables · Mathematics 2017-08-22 John E. McCarthy , James E. Pascoe

We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…

Computational Complexity · Computer Science 2017-01-18 Olivier Bournez , Daniel S. Graça , Amaury Pouly

Let $H^d$ be the set of all rational maps of degree $d\ge 2$ on the Riemann sphere which are expanding on Julia set. We prove that if $f\in H^d$ and all or all but one critical points (or values) are in the immediate basin of attraction to…

Dynamical Systems · Mathematics 2016-09-06 Feliks Przytycki

Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…

Dynamical Systems · Mathematics 2024-08-28 Genadi Levin

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

In this paper we explore a class of quadratic polynomials having Siegel disks with unbounded type rotation numbers. We prove that any boundary point of Siegel disks of these polynomials is a Lebesgue density point of their filled-in Julia…

Dynamical Systems · Mathematics 2023-07-21 Hongyu Qu , Jianyong Qiao , Guangyuan Zhang

Let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers, and $\phi\in K(z)$ be a rational map of degree at least $2$. We prove that the $K$-Julia set of $\phi$ is the natural restriction of $\mathbb{C}_p$-Julia set,…

Dynamical Systems · Mathematics 2024-01-15 Shilei Fan , Lingmin Liao , Hongmin Nie , Yuefei Wang

Holomorphic renormalization plays an important role in complex polynomial dynamics. We consider certain conditions guaranteeing that a polynomial which does not admit a polynomial-like connected Julia set still admits an invariant continuum…

Dynamical Systems · Mathematics 2023-08-01 Alexander Blokh , Peter Haissinsky , Lex Oversteegen , Vladlen Timorin

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;…

Dynamical Systems · Mathematics 2012-06-12 Calum Spicer , Robert S. Strichartz , Emad Totari

Let $a(\lambda)$ and $b(\lambda)$ be two polynomials with coefficients in complex numbers and let $f_{\lamb$ be a one-parameter family of polynomials indexed by all complex numbers $\lambda$. We study whether there exist infinitely many…

Dynamical Systems · Mathematics 2011-02-15 Dragos Ghioca , Liang-Chung Hsia , Thomas Tucker