Related papers: Misiurewicz Points for Polynomial Maps and Transve…

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…

For each integer $m \geq 1$, we construct a finite-dimensional family of rational maps, given by Blaschke-type products, whose restriction to the unit circle consists of $2m$-multimodal maps. We show that every post-critically finite…

The orbits about Lagrangian equilibrium points are important for scientific investigations. Since, a number of space missions have been completed and some are being proposed by various space agencies. In light of this, we consider a more…

Dynamical systems, whether continuous or discrete, are used by physicists in order to study non-linear phenomena. In the case of discrete dynamical systems, one of the most used is the quadratic map depending on a parameter. However, some…

We prove that a proper holomorphic map on the unit disk in the complex plane is uniquely determined up to post-composition with a Moebius transformation by its critical points.

Invariant circles play an important role as barriers to transport in the dynamics of area-preserving maps. KAM theory guarantees the persistence of some circles for near-integrable maps, but far from the integrable case all circles can be…

We present an effective method to investigate the asymptotic critical value set of a polynomial map. For this purpose we propose a method to construct rational curves with reduced number of terms present in its parametric representation. In…

We develop a Thurston-like theory to characterize geometrically finite rational maps, then apply it to study pinching and plumbing deformations of rational maps. We show that in certain conditions the pinching path converges uniformly and…

A bifurcation is a qualitative change in a family of solutions to an equation produced by varying parameters. In contrast to the local bifurcations of dynamical systems that are often related to a change in the number or stability of…

Toward the understanding of bifurcation phenomena of dynamics on the Berkovich projective line $\mathbb{P}^{1,an}$ over non-archimedean fields, we study the stability (or passivity) of critical points of families of polynomials parametrized…

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…

We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…

The behaviour of uniform elastically isotropic compressible systems in critical and tricritical points is described in field-theoretical terms. Renormalizationgroup equations are analyzed for the case of three-dimensional systems in a…

We extend a theorem of Herman from the case of unicritical polynomials to the case of polynomials with two finite critical values. This theorem states that Siegel disks of such polynomials, under a diophantine condition (called Herman's…

We extend the definition of an orbit portrait to the context of non-autonomous iteration, both for the combinatorial version involving collections of angles and for the dynamic version involving external rays where combinatorial portraits…

We present a new approach for estimating the set of bifurcation values at infinity. This yields a significant shrinking of the number of coefficients in the recent algorithm introduced by Jelonek and Kurdyka for reaching critical values at…

Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailed analysis of the structure of the directed…

We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexity of dual-criticality testing. By the definition the problem…

We prove an abstract result establishing that one can obtain the convergence of Rare Events Point Processes counting the number of orbital visits to a sequence of shrinking target sets from the convergence of corresponding point processes…

We introduce the notion of a one-way horseshoe and show that the polynomial entropy of an interval map is given by one-way horseshoes of iterates of the map, obtaining in such a way an analogue of Misiurewicz's theorem on topological…