اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComputer Generated Images for Quadratic Rational Maps with a Periodic Critical Point
138
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We describe an algorithm for distinguishing hyperbolic components in the parameter space of quadratic rational maps with a periodic critical point. We then illustrate computer images of the hyperbolic components of the parameter spaces V1 - V4, which were produced using our algorithm. We also resolve the singularities of the projective closure of V5 by blowups, giving an alternative proof that as an algebraic curve, the geometric genus of V5 is 1. This explains why we are unable to produce an image for V5.
قيم البحث
اقرأ أيضاً
We show that the topological entropy is monotonic for unimodal interval maps which are obtained from the restriction of quadratic rational maps with real coefficients. This is done by ruling out the existence of certain post-critical curves in the mo
duli space of aforementioned maps, and confirms a conjecture made in [Fil19] based on experimental evidence.
Motivated by the dynamical uniform boundedness conjecture of Morton and Silverman, specifically in the case of quadratic polynomials, we give a formal construction of a certain class of dynamical analogues of classical modular curves. The preperiodic
points for a quadratic polynomial map may be endowed with the structure of a directed graph satisfying certain strict conditions; we call such a graph admissible. Given an admissible graph $G$, we construct a curve $X_1(G)$ whose points parametrize quadratic polynomial maps -- which, up to equivalence, form a one-parameter family -- together with a collection of marked preperiodic points that form a graph isomorphic to $G$. Building on work of Bousch and Morton, we show that these curves are irreducible in characteristic zero, and we give an application of irreducibility in the setting of number fields. We end with a discussion of the Galois theory associated to the preperiodic points of quadratic polynomials, including a certain Galois representation that arises naturally in this setting.
In this paper we will give a short and elementary proof that critical relations unfold transversally in the space of rational maps.
Given a number field $K$ and a polynomial $f(z) in K[z]$ of degree at least 2, one can construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, with an edge $alpha to beta$ if and only if $f(alpha) =
beta$. Restricting to quadratic polynomials, the dynamical uniform boundedness conjecture of Morton and Silverman suggests that for a given number field $K$, there should only be finitely many isomorphism classes of directed graphs that arise in this way. Poonen has given a conjecturally complete classification of all such directed graphs over $mathbb{Q}$, while recent work of the author, Faber, and Krumm has provided a detailed study of this question for all quadratic extensions of $mathbb{Q}$. In this article, we give a conjecturally complete classification like Poonens, but over the cyclotomic quadratic fields $mathbb{Q}(sqrt{-1})$ and $mathbb{Q}(sqrt{-3})$. The main tools we use are dynamical modular curves and results concerning quadratic points on curves.
We prove that a long iteration of rational maps is expansive near boundaries of bounded type Siegel disks. This leads us to extend Petersens local connectivity result on the Julia sets of quadratic Siegel polynomials to a general case.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
