English
Related papers

Related papers: Chebyshev's method for exponential maps

200 papers

We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these…

Classical Analysis and ODEs · Mathematics 2007-05-23 Y. Chen , J. C. Griffin , M. E. H. Ismail

For an infinitely renormalizable quadratic map $f_c: z\mapsto z^2+c$ with the sequence of renormalization periods ${k_m}$ and rotation numbers ${t_m=p_m/q_m}, we prove that if $\limsup k_m^{-1}\log |p_m|>0$, then the Mandelbrot set is…

Dynamical Systems · Mathematics 2015-03-13 Genadi Levin

Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…

Number Theory · Mathematics 2007-08-16 Pietro Corvaja

We prove that every transcendental meromorphic map f with a disconnected Julia set has a weakly repelling fixed point. This implies that the Julia set of Newton's method for finding zeroes of an entire map is connected. Moreover, extending…

Dynamical Systems · Mathematics 2014-12-01 Krzysztof Baranski , Nuria Fagella , Xavier Jarque , Boguslawa Karpinska

We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly independent functions on an interval $[a,b]$. A general theory of Chebyshev sets guarantees the existence of rules with a Gaussian property, in…

Numerical Analysis · Mathematics 2017-11-01 Daan Huybrechs

Relaxed Newton's method is a one-parameter family of root-finding methods that generalizes the classical Newton's method. When viewed as a rational map on the Riemann sphere, this family exhibits rich and subtle global dynamics that depend…

Dynamical Systems · Mathematics 2026-03-13 Soumen Pal

We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…

Algebraic Geometry · Mathematics 2017-05-17 Lucien Szpiro , Lloyd West

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…

Dynamical Systems · Mathematics 2012-03-24 Johannes Rückert

In this paper we study a one parameter family of rational maps obtained by applying the Chebyshev-Halley root finding algorithms. We show that the dynamics near parameters where the family presents some degeneracy might be understood from…

Dynamical Systems · Mathematics 2025-04-28 Jordi Canela , Antonio Garijo , Pascale Roesch

This work develops a computational framework for proving existence, uniqueness, isolation, and stability results for real analytic fixed points of $m$-th order Feigenbaum-Cvitanovi\'{c} renormalization operators. Our approach builds on the…

Dynamical Systems · Mathematics 2024-12-18 Maxime Breden , Jorge Gonzalez , J. D Mireles James

One of the main questions in the field of complex dynamics is the question whether the Mandelbrot set is locally connected, and related to this, for which maps the Julia set is locally connected. In this paper we shall prove the following…

Dynamical Systems · Mathematics 2016-09-06 Genadi Levin , Sebastian van Strien

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

Logic · Mathematics 2021-07-26 Dimitra Chompitaki , Manos Kamarianakis , Thanases Pheidas

It has been shown that the Sierpi\'nski gasket-like sets can appear as the Julia sets of some geometrically finite rational maps. In this paper we prove that such type of Julia sets can also appear in the rational maps containing Siegel…

Dynamical Systems · Mathematics 2025-09-16 Xiaole He , Yingqing Xiao , Fei Yang

In this paper, we first introduce and study the notion of random Chebyshev centers. Further, based on the recently developed theory of stable sets, we introduce the notion of random complete normal structure so that we can prove the two…

Functional Analysis · Mathematics 2024-08-22 Xiaohuan Mu , Qiang Tu , Tiexin Guo , Hong-Kun Xu

First we construct a free resolution for the Milnor (or Jacobian) algebra $M(f)$ of a complex projective Chebyshev plane curve $\CC_d:f=0$ of degree $d$. In particular, this resolution implies that the dimensions of the graded components…

Algebraic Geometry · Mathematics 2015-05-30 Alexandru Dimca , Gabriel Sticlaru

In this work we will show that the Teichm\"{u}ller distance for all elements of a certain class of generalized polynomial-like maps (the class of off-critically hyperbolic generalized polynomial-like maps) is actually a distance, as in the…

Dynamical Systems · Mathematics 2016-09-06 Eduardo A. Prado

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…

Complex Variables · Mathematics 2025-07-25 Mohd Vaseem

Let $P$ be a polynomial with a connected Julia set $J$. We use continuum theory to show that it admits a \emph{finest monotone map $\ph$ onto a locally connected continuum $J_{\sim_P}$}, i.e. a monotone map $\ph:J\to J_{\sim_P}$ such that…

Dynamical Systems · Mathematics 2016-01-25 A. Blokh , C. Curry , L. Oversteegen

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Number Theory · Mathematics 2023-01-31 Mohamed O Darwish , Mohammad Sadek

We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…

Numerical Analysis · Mathematics 2025-07-08 Vladimir Yu. Protasov , Rinat Kamalov