Next Article in Journal
Ribbonness of a Stable-Ribbon Surface-Link, II: General Case
Previous Article in Journal
On the Pricing of Vulnerable Foreign Equity Options with Stochastic Volatility in an Intensity-Based Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generating Special Curves for Cubic Polynomials

by
Khudoyor Mamayusupov
1,†,
Figen Çilingir
2,†,
Marks Ruziboev
3,†,
Gafurjan Ibragimov
4,5,6,† and
Bruno Antonio Pansera
7,*,†
1
Department of Mathematics, New Uzbekistan University, Movarounnahr 1, Tashkent 100007, Uzbekistan
2
Department of Mathematics, Faculty of Arts and Sciences, Iğdır University, Iğdır 76100, Turkey
3
School of Engineering, Central Asian University, 264, Milliy bog St, Tashkent 111221, Uzbekistan
4
V.I.Romanovskiy Institute of Mathematics, Uzbekistan Academy of Sciences, Tashkent 100174, Uzbekistan
5
Department of Econometrics, Tashkent State University of Economics, Tashkent 100066, Uzbekistan
6
Department of International Scientific Journals and Rankings, Alfraganus University, Yukori Karakamish Street 2a, Tashkent 100190, Uzbekistan
7
Department of Law, Economics and Human Sciences & Decisions_Lab, University Mediterranea of Reggio Calabria, I-89124 Reggio Calabria, Italy
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2025, 13(3), 401; https://doi.org/10.3390/math13030401
Submission received: 21 November 2024 / Revised: 18 January 2025 / Accepted: 19 January 2025 / Published: 25 January 2025

Abstract

:
An algorithmic method is proposed to generate all cubic polynomials with a critical orbit relation. We generate curves (polynomials of parameters) that correspond to those functions with critical orbit relations. The irreducibility of the polynomials obtained is left as an open problem. Our approach also works to generate critical orbit relations in all families of rational functions with active critical points.
MSC:
30D05; 37F45; 13P10; 13P15; 12Y05

1. Introduction and Statement of the Problem

In their influential paper, Baker and DeMarco [1] explored the distribution of postcritically finite (PCF) polynomials through the perspective of the Zariski topology in algebraic geometry. They defined special algebraic subvarieties as subvarieties within the space of degree-d polynomials that contain a Zariski-dense set of postcritically finite polynomials. They then posed the problem of classifying all such subvarieties.
Baker and DeMarco called an algebraic variety in the space of degree d polynomials (or rational maps) “special" if it contains infinitely many postcritically finite polynomials (rational maps) and asked to classify such special varieties [1]. Recently, this problem was solved for the cubic polynomials in [2] and for all degrees in [3] by Favre and Gauthier. They showed that the special curves can be characterized by the orbits of critical points in three cases: one of the critical points is persistently preperiodic, the two critical points have a persistent critical orbit relation, or there is a symmetry via z z , in which case the curve is b = 0 , ([2] Theorem A). The special curves where the critical point is periodic were studied by Milnor [4]. The works of Milnor were generalized for rational maps with a preperiodic critical point by Buff, Epstein, and Koch and they showed that prefixed subvarieties are irreducible [5].
This research builds on significant advances in holomorphic dynamics, particularly the classification of special algebraic varieties containing postcritically finite polynomials, as established by Baker, DeMarco, Favre, and Gauthier [1,3]. By addressing critical orbit relations in cubic polynomials, our study extends the computational and theoretical techniques used to explore stability and bifurcation in parameter spaces. This work introduces an iterative framework for generating dynamical systems with specific critical orbit relations, offering new tools for understanding the structure and irreducibility of COR varieties. These contributions are pivotal for advancing computational approaches in dynamical systems and analyzing the parameter spaces of complex polynomials.
The approach is applicable for generating critical orbit relations in all families of rational functions with active critical points. We address the irreducibility of the polynomials in the space of cubic polynomials for some low-degree cases. In this regard, we would like to remark that experiments with other cases show that the irreducibility problem is very hard and for each case one needs to use different tools.
Every cubic polynomial has the Branner–Hubbard form p ( z ) = z 3 3 a 2 z + b , where a , b are complex numbers [6]. The critical points are at ± a . Cubic polynomials as a dynamical system and the parameter plane of cubic polynomials were studied intensively by many in [4,6,7,8,9]. Define the iterates of p ( z ) by letting p 0 ( z ) = z and p n + 1 ( z ) = p ( p n ( z ) ) , for z C . In this paper, we solve the following problem.
Problem 1.
For each pair of ( n , m ) , find all polynomials p ( z ) = z 3 3 a 2 z + b such that
p n ( a ) = p m ( a ) .
Here, we also require that p n 1 ( a ) p m 1 ( a ) if n 1 and m 1 . In fact, we give an answer to this problem as an algebraic curve on complex variables a , b , which is the Zariski closure of the set of points that solve the Problem 1. The irreducibility of the obtained curves is of great importance and is left as an open problem (see Proposition 2).
The orbit of a point z is { z , p ( z ) , , p n ( z ) , } . A point z 0 C is called a critical point of a polynomial p if p ( z 0 ) = 0 . A polynomial p is called postcritically finite if the orbit of all critical points of p is finite as a set. A point z 0 C is called a fixed point of a polynomial p if p ( z 0 ) = z 0 . The derivative p ( z 0 ) at the fixed point is called its multiplier. Two polynomials p and q are called affine conjugate if and only if there exists an affine map ϕ ( z ) = k 1 z + k 2 with k 1 0 , k 2 C (conjugacy) such that ϕ ( p ( z ) ) = q ( ϕ ( z ) ) for all z C . Note that here ϕ plays the role of affine change of coordinates in z-plane and in w = p ( z ) planes at the same time. In the study of dynamical systems such a dynamical change in coordinates produces the same dynamics. By scaling ( z k z ), we can make the leading coefficient of any polynomial 1. In general, a cubic polynomial has two critical points so by a change of coordinates (translation ( z z + k ) we can put them at some ± a and obtain the Branner–Hubbard form.
We also consider cubic polynomials written in the form
q ( z ) = z 3 + μ z 2 + λ z
with a fixed point at the origin with the multiplier λ . The family in this form is denoted by Per1 ( λ ) . Critical points of q solve the quadratic equation
3 z 2 + 2 μ z + λ = 0 .
Denote the critical points by c 1 and c 2 . If λ 0 then it is not possible to label (mark) the critical points without taking the square root function in the complex plane.
Problem 2.
For each pair of ( n , m ) , find all polynomials q ( z ) = z 3 + μ z 2 + λ z such that
q n ( c 1 ) = q m ( c 2 ) .
These two problems are equivalent to each other but it is easy to work with the first one as the critical points are marked at ± a . Indeed, let z 0 be any fixed point of p ( z ) = z 3 3 a 2 z + b ; by the change of coordinates z z + z 0 we can put its fixed point to the origin to obtain a cubic polynomial of the form (2). Now we start with a cubic polynomial of the from (2) and let c 0 = ( c 1 + c 2 ) / 2 be the midpoint of the critical points c 1 and c 0 of q ( z ) = z 3 + μ z 2 + λ z (the midpoint of the line segment joining the two critical points). By the change in coordinates z z + c 0 we can put its critical points to two points symmetric with respect to the origin. The resulting cubic polynomial is of the Branner–Hubbard form. Now for p ( z ) = z 3 3 a 2 z + b and q ( z ) = z 3 + μ z 2 + λ z , for convenience, denote the change in the coordinate by ϕ with ϕ ( a ) = c 1 and ϕ ( a ) = c 2 then p ( z ) = ϕ 1 ( q ( ϕ ( z ) ) ) and for all k N we obtain p k ( z ) = ϕ 1 ( q k ( ϕ ( z ) ) . Finally, we assume that p satisfies the Problem 1 for ( n , m ) , i.e., p n ( a ) = p m ( a ) . Then, ϕ 1 ( q n ( ϕ ( a ) ) ) = ϕ 1 ( q m ( ϕ ( a ) ) ) . Applying ϕ to both sides of the latter we obtain q n ( ϕ ( a ) ) = q m ( ϕ ( a ) ) or q n ( c 1 ) = q k ( c 2 ) which solves Problem 2 with the same ( n , m ) . Going backward, we can show that every solution to Problem 2 is also a solution to Problem 1.
One can also consider the following subproblem if we restrict to a slice λ = 1 and work in Per1 ( 1 ) .
Problem 3.
For each pair of ( n , m ) , find all polynomials q ( z ) = z 3 + μ z 2 + z such that
q n ( c 1 ) = q m ( c 2 ) .
The third problem has the same difficulty as the second one but both can be derived from the first.
Two distinct cubics z 3 3 a 2 z + b and z 3 3 a 2 z + b are affine conjugate if and only if a = a and b = b ; the conjugacy is z z . Indeed, for a 0 assume that there is an affine conjugacy: p 1 ( k 1 z + k 2 ) = k 1 p 2 ( z ) + k 2 . Take the derivative from both sides and obtain p 1 ( k 1 z + k 2 ) = p 2 ( z ) . It yields that the conjugacy ϕ ( z ) = k 1 z + k 2 sends the critical points of p 2 to the critical points of p 1 . If we substitute z = ± a 2 we must have ± k 1 a 2 + k 2 = ± a 1 or ± k 1 a 2 + k 2 = a 1 . In both cases, we obtain k 2 = 0 . Then, we obtain p 1 ( k 1 z ) = k 1 p 2 ( z ) and directly obtain k 1 = ± 1 . Thus, the conjugacy is the identity or it is z z . If a = 0 then the conjugacy is ( k 1 z + k 2 ) 3 + b 1 = k 1 ( z 3 + b 2 ) + k 2 . By collecting common terms we obtain k 1 = ± 1 and k 2 = 0 , which finishes the claim. The conjugacy z z interchanges the markings (labeling) of critical points ± a . Thus, the moduli space, consisting of all affine conjugacy classes of cubics with marked critical points, can be identified with coordinates ( a 2 , b 2 ) C 2 . It means that all four pairs ( ± a , ± b ) correspond to the same equivalence class.
Definition 1.
For a polynomial p with critical points c 1 and c 2 acritical orbit relationis a quadruple ( n , m , c 1 , c 2 ) (in short, a pair ( n , m ) ) with nonnegative integers n and m such that
p n ( c 1 ) = p m ( c 2 ) .
If c 1 = c 2 then we require n m . If c 1 = c 2 then the critical orbit relation is of the first type and for c 1 c 2 it is of the second type. In this paper, we only consider critical orbit relations of the second type.
We do not require such n , m to be exact but only ask if (5) is true then f n 1 ( c 1 ) f m 1 ( c 2 ) and we call it a minimal relation. Every critical orbit relation of the form ( n , 0 ) satisfies our requirement so it is minimal. As the Equation (5) is symmetric with respect to n and m, it suffices to consider only the cases of n m .
For a polynomial p ( z ) = z 3 3 a 2 z + b , a critical orbit relation is a pair ( n , m ) with non-negative integers n and m such that for the critical points a and a we have (1).
Let p t ( z ) for t χ be a holomorphic family ( χ is a complex manifold) of cubic polynomials and mark critical points c 1 ( t ) , c 2 ( t ) of p t . A point t = t 0 belongs to the stability locus [10] if the Julia sets J ( p t ) move holomorphically in a neighborhood of t 0 . Alternatively, a point t = t 0 belongs to the stability locus if the sequence
{ t p t n ( c i ( t ) ) }
forms a normal family on some neighborhood of t 0 for both i { 1 , 2 } . A point t = t 0 belongs to the bifurcation locus if stability fails at t 0 . In complex dynamics, the bifurcation locus (also known as the activity locus [10,11]) of a parameterized family of one-variable holomorphic functions refers to the set of parameter points where small changes in the parameter cause significant changes in the dynamical behavior. This locus is often seen as a counterpart to the Julia set but in the context of parameter space. The most well-known example of a bifurcation locus is the boundary of the Mandelbrot set [10].
The following lemma motivates us to study functions with interacting distinct critical points. It is analogous to Lemma 2.3 in [11].
Lemma 1.
Assume that { t p t n ( c 1 ( t ) ) } is not normal at t 0 for c 1 ( t ) (the bifurcation locus is not empty) and # { orbitof c 2 ( t ) } 3 persists throughout χ (or in every sufficiently small neighborhood of t 0 ). Then, there are infinitely many parameters t χ such that c 1 ( t ) and c 2 ( t ) are in critical orbit relations. In particular, there are infinitely many parameters t χ such that p t n ( c 1 ( t ) ) = c 2 ( t ) , where n N depends on t.
Proof. 
Consider t 0 from the bifurcation locus. In a small neighborhood of t 0 let c 2 0 ( t ) c 2 1 ( t ) be two preimages of c 2 ( t ) . An application of Montel’s theorem with the triple c 2 0 ( t ) , c 2 1 ( t ) , c 2 ( t ) , which is persistent, finishes the proof. If there are no two preimages, then they must coincide, creating a critical point, which must be c 1 ( t ) as there are only two critical points, so that the image of it is the critical point c 2 ( t ) so that the relation is of the form p t ( c 1 ( t ) ) = c 2 ( t ) . □
The Problem 1 may be reduced to computing the result of two polynomials p n ( z ) p m ( z ) and z 2 a 2 , with respect to variable z [12] (see Proposition 1). The result (denoted by R e s z ( p n ( z ) p m ( z ) , z 2 a 2 ) ) is a polynomial on the parameters a , b .
We propose a procedure for constructing a sequence of auxiliary polynomials (see Lemma 2) from which we directly arrive at the polynomial equation in the parameters a , b , a zero set of which corresponds to a critical orbit relation (1) for each pair n , m .
The zero set of the obtained polynomials can also be viewed as a family of a critical orbit relation, known as a COR variety (Critical orbit relations), in the parameter space of cubic maps, as described in [13]. These COR varieties are fundamental in the analysis of holomorphic and arithmetic dynamical systems, and they have been extensively studied [13,14,15,16]. With this paper, we proposed a new class of COR curves. The problem of the irreducibility of these new curves can be studied by the use of the techniques developed in [5,15,16,17,18].
The notion of poscritical minimality in families of rational functions was introduced in [19,20]. The condition on functions we consider in this paper is weaker than the condition for poscritical minimality. Moreover, the functions with a critical orbit relation are not necessarily postcritically finite. They can well be postcritically infinite. The above-mentioned result of Favre and Gauthier [2] shows that each variety defining the critical orbit relation contains infinite postcritically finite cubic polynomials. If we consider a slice in the cubic family consisting of polynomials with a persistent attracting or parabolic periodic point (e.g., Per1 ( 1 ) ), all such maps will be postcritically infinite. But in these slices, there always exist those with a critical orbit relation. On the other hand, if the slice consists of entirely cubics with a persistent superattracting period point then all cubics with a critical orbit relation are necessarily postcritically finite.

2. From Critical Orbit Relations to Recurrence Relations

This section is a preliminary to a quantitative answer to the main Lemma 1, which is the main theme of the paper. Below we reduce the orbit of the critical point to a simple looking form with universal polynomials that are recursively obtained. In what follows, the powers in the polynomials p represent iterations while the powers of newly introduced polynomials and the variables or in the algebraic expressions represent the algebraic power.
Lemma 2.
There exist sequences { A n ( a , b ) } n 0 and { B n ( a , b ) } n 0 of polynomials of parameters a , b such that for all n 0 the equality p n ( ± a ) = ± a A n ( a , b ) + B n ( a , b ) holds.
Proof. 
As p 0 ( z ) = z , set A 0 ( a , b ) = 1 and B 0 ( a , b ) = 0 . Recurrently define polynomials A n ( a , b ) and B n ( a , b ) such that A n + 1 ( a , b ) z + B n + 1 ( a , b ) = p ( A n ( a , b ) z + B n ( a , b ) ) for z = ± a . It follows that the recurrence relation is the following.
A n + 1 ( a , b ) = A n ( a , b ) ( a 2 A n 2 ( a , b ) + 3 B n 2 ( a , b ) 3 a 2 ) ,
B n + 1 ( a , b ) = B n 3 ( a , b ) + 3 a 2 B n ( a , b ) ( A n 2 ( a , b ) 1 ) + b .
The above formulas are obtained by substituting z 2 = a 2 , z 3 = a 2 z for z = ± a into the expansion of ( A n ( a , b ) z + B n ( a , b ) ) 3 3 a 2 ( A n ( a , b ) z + B n ( a , b ) ) + b and combining the common terms. □
Denote by deg a Q ( a , b ) the degree of a two-variable polynomial Q ( a , b ) with respect to a variable a and by deg Q the degree of a two-variable polynomial Q ( a , b ) , which is the sum of degrees of variables a and b in the highest monomial of Q. For instance, deg a ( a 2 a b 4 ) = 2 and deg ( a 2 a b 4 ) = 5 . It is easy to see from the recurrence relations that deg a A n ( a , b ) = deg A n ( a , b ) = 3 n 1 for n 1 , deg a B n ( a , b ) = 3 n 3 and deg B n ( a , b ) = 3 n 2 for n 1 (to ease the notations in some places of this paper we drop the arguments in writing functions).
The following lemma gives even more structure to the introduced polynomials { A n ( a , b ) } n 0 and { B n ( a , b ) } n 0 . It also helps to reduce by half the degrees of the later obtained algebraic curves that represent each critical orbit relation.
Lemma 3.
There exist sequences { A ˜ n ( x , y ) } n 0 and { B ˜ n ( x , y ) } n 0 of polynomials such that for every n 0 one has A n ( a , b ) = A ˜ n ( a 2 , b 2 ) and B n ( a , b ) = b B ˜ n ( a 2 , b 2 ) .
Proof. 
We proceed by induction on n. For n = 0 the statement is true as A 0 = 1 and B 0 = 0 , set A ˜ 0 = 1 and B ˜ 0 = 0 . Suppose that the statement holds for n:
A n ( a , b ) = A ˜ n ( a 2 , b 2 ) and B n ( a , b ) = b B ˜ n ( a 2 , b 2 ) .
By the inductive hypothesis,
A n + 1 ( a , b ) = A n ( a , b ) ( a 2 A n 2 ( a , b ) + 3 B n 2 ( a , b ) 3 a 2 ) = A ˜ n ( a 2 , b 2 ) ( a 2 A ˜ n 2 ( a 2 , b 2 ) + 3 b 2 B ˜ n 2 ( a 2 , b 2 ) 3 a 2 ) .
Set
A ˜ n + 1 ( x , y ) = A ˜ n ( x , y ) ( x A ˜ n 2 ( x , y ) + 3 y B ˜ n 2 ( x , y ) 3 x ) ,
so that A n + 1 ( a , b ) = A ˜ n + 1 ( a 2 , b 2 ) . Similarly,
B n + 1 ( a , b ) = B n 3 ( a , b ) + 3 a 2 B n ( a , b ) ( A ˜ n 2 ( a 2 , b 2 ) 1 ) + b = b 3 B ˜ n 3 ( a 2 , b 2 ) + 3 a 2 b B ˜ n ( a , b ) ( A ˜ n 2 ( a 2 , b ) 2 1 ) + b = b ( b 2 B ˜ n 3 ( a 2 , b 2 ) + 3 a 2 B ˜ n ( a 2 , b 2 ) ( A ˜ n 2 ( a 2 , b 2 ) 1 ) + 1 ) .
Set
B ˜ n + 1 ( x , y ) = y B ˜ n 3 ( x , y ) + 3 x B ˜ n ( x , y ) ( A ˜ n 2 ( x , y ) 1 ) + 1 ,
so that B n + 1 ( a , b ) = b B ˜ n + 1 ( a 2 , b 2 ) . This finishes the proof. □
In fact, by the above we have
p n ( ± a ) = ± a A ˜ n ( a 2 , b 2 ) + b B ˜ n ( a 2 , b 2 )
for all n 0 .
The recurrence formulas that define A n and B n allow us to easily construct a linear equation in z from a critical orbit relation. If n > m the critical relation p n ( z ) p m ( z ) = 0 becomes a linear equation in z, and for n = m the critical relation reduces to A n ( a , b ) = 0 .

3. Main Technical Results

In this section, the critical orbit relations are reduced to polynomial relations. We consider them case by case.
Case of ( n , n ) . By Lemma 2 we have
p n ( a ) p n ( a ) = A n ( a , b ) a + B n ( a , b ) ( A n ( a , b ) a + B n ( a , b ) ) = 2 A n ( a , b ) a , n 1 .
This implies that the critical orbit relation reduces to A n ( a , b ) = 0 .
If A 1 = 2 a 2 vanishes then a = 0 . In this case, both critical points collide so the critical orbit relation is ( 0 , 0 ) . This means that there is no cubic polynomial with an exact critical orbit relation ( 1 , 1 ) . There is also a topological reason why the case ( 1 , 1 ) is not realized in the cubic polynomial family.
Denote P n , n ( a , b ) = A n ( a , b ) / A 1 ( a , b ) . Then,
p n ( a ) p n ( a ) = 4 a 3 P n , n ( a , b ) ,
and (6) yields
P n , n ( a , b ) = A n ( a , b ) / A 1 ( a , b ) = A n 1 ( a , b ) / A 1 ( a , b ) ( a 2 A n 1 2 ( a , b ) + 3 B n 1 2 ( a , b ) 3 a 2 ) .
Set for n 2
P ˜ n , n ( a , b ) = a 2 A n 1 2 ( a , b ) + 3 B n 1 2 ( a , b ) 3 a 2 ,
or by Lemma 3 we can write
P ˜ n , n ( a , b ) = a 2 A ˜ n 1 2 ( a 2 , b 2 ) + 3 b 2 B ˜ n 1 2 ( a 2 , b 2 ) 3 a 2 .
This implies that, for n 2 , we can write the following
P n , n ( a , b ) = P n 1 , n 1 ( a , b ) · P ˜ n , n ( a , b ) .
For n 1 , P ˜ n , n ( x , y ) = Q n , n ( x 2 , y 2 ) , where
Q n , n ( x , y ) = x A ˜ n 1 2 ( x , y ) + 3 y B ˜ n 1 2 ( x , y ) 3 x .
If there is a minimal critical orbit relation ( n , n ) , then P ˜ n , n ( a , b ) = 0 .
Moreover, deg a P n , n ( a , b ) = deg P n , n ( a , b ) = 3 n 3 and deg a P ˜ n , n ( a , b ) = deg P ˜ n , n ( a , b ) = 2 · 3 n 1 for n 1 .
From (12) we obtain that if P n , n ( a , b ) = 0 and the relation is minimal then P n 1 , n 1 ( a , b ) 0 it yields that P ˜ n , n ( a , b ) = 0 . By definition
deg P n , n ( a , b ) = deg A n 2 = 3 n 1 2 = 3 n 3
and
deg P ˜ n , n ( a , b ) = 2 + 2 deg A n 1 = 2 + 2 ( 3 n 1 1 ) = 2 · 3 n 1 .
Moreover, deg a P n , n ( a , b ) = deg P n , n ( a , b ) and deg a P ˜ n , n ( a , b ) = deg P ˜ n , n ( a , b ) .
Case of n > m for m = 0 and m = 1 . Note that if n m we have
p n ( a ) p m ( a ) = a A n + B n ( a A m + B m ) = a ( A n + A m ) + ( B n B m )
and
p m ( a ) p n ( a ) = a A m + B m ( a A n + B n ) = a ( A n + A m ) ( B n B m ) .
We denote
P n , m ( a , b ) : = ( p n ( a ) p m ( a ) ) ( p m ( a ) p n ( a ) ) ,
then P n , m ( a , b ) = a 2 ( A n + A m ) 2 ( B n B m ) 2 . Recall that A 0 = 1 , B 0 = 0 and A 1 = 2 a 2 , B 1 = b . For n 1 we have that P n , 0 = a 2 ( A n ( a , b ) + 1 ) 2 B n 2 ( a , b ) . By Lemma 3 set
P ˜ n , 0 ( a , b ) = P n , 0 ( a , b ) = a 2 ( A ˜ n ( a 2 , b 2 ) + 1 ) 2 b 2 B ˜ n 2 ( a 2 , b 2 ) .
Note that the critical orbit relation ( n , 0 ) is minimal. An easy calculation shows that
P n , 1 = a 2 ( A n 1 + 1 ) 2 B n 1 2 2 · a 2 ( A n 1 2 ) 2 B n 1 2 .
For n 1 set
P ˜ n , 1 ( a , b ) = a 2 ( A n 1 ( a , b ) 2 ) 2 B n 1 2 ( a , b ) ,
or by Lemma 3 we can write it as
P ˜ n , 1 ( a , b ) = a 2 ( A ˜ n 1 ( a 2 , b 2 ) 2 ) 2 b 2 B ˜ n 1 2 ( a 2 , b 2 )
then the above implies that
P n , 1 ( a , b ) = P n 1 , 0 2 ( a , b ) · P ˜ n , 1 ( a , b ) .
The following trivially follows by (15)–(18) and from the degrees of A n and B n .
For n 1 set
Q n , 0 ( x , y ) = x ( A ˜ n ( x , y ) + 1 ) 2 y B ˜ n 2 ( x , y ) ,
Q n , 1 ( x , y ) = x ( A ˜ n 1 ( x , y ) 2 ) 2 y B ˜ n 1 2 ( x , y )
then P ˜ n , 0 ( x , y ) = Q n , 0 ( x 2 , y 2 ) and P ˜ n , 1 ( x , y ) = Q n , 1 ( x 2 , y 2 ) . If there is a minimal critical orbit relation ( n , 1 ) then P ˜ n , 1 ( a , b ) = 0 . Moreover, deg a P ˜ n , 0 ( a , b ) = deg P ˜ n , 0 ( a , b ) = 2 · 3 n and deg a P ˜ n , 1 = deg P ˜ n , 1 = 2 · 3 n 1 for n 1 .
Case of n > m > 1 . By following Taylor’s formula for cubic polynomials
p ( z ) = p ( w ) + p ( w ) ( z w ) + p ( w ) ( z w ) 2 / 2 + p ( w ) ( z w ) 3 / 6
and since p ( w ) = 3 w 2 3 a 2 , p ( w ) = 6 w , and p ( w ) = 6 we obtain p ( z ) p ( w ) = ( z w ) ( 3 w 2 3 a 2 + 3 w ( z w ) + ( z w ) 2 ) . After simplification it becomes
p ( z ) p ( w ) = ( z w ) ( z 2 + z w + w 2 3 a 2 ) .
By substituting p n 1 ( a ) and p m 1 ( a ) instead of z and w, respectively, we obtain
p n ( a ) p m ( a ) = ( p n 1 ( a ) p m 1 ( a ) ) ( p n 1 ( a ) 2 + p n 1 ( a ) p m 1 ( a ) + p m 1 ( a ) 2 3 a 2 )
Similarly,
p m ( a ) p n ( a ) = ( p m 1 ( a ) p n 1 ( a ) ) ( p m 1 ( a ) 2 + p m 1 ( a ) p n 1 ( a ) + p n 1 ( a ) 2 3 a 2 )
Now, if we multiply the left-hand sides (which is P n , m ( a , b ) as was defined in (14)) and the right-hand sides of the latter two identities (product of the first items is P n 1 , m 1 ( a , b ) ) and substituting the iterates in the second items of the products on the right-hand sides by Lemma 2 correspondingly and denote by P ˜ n , m ( a , b ) then
P ˜ n , m ( a , b ) = a 2 ( A n 1 2 A n 1 A m 1 + A m 1 2 ) + B n 1 2 + B n 1 B m 1 + B m 1 2 3 a 2 2 a 2 ( 2 A n 1 A m 1 ) B n 1 ( 2 A m 1 A n 1 ) B m 1 2 .
and we obtain the factorization
P n , m ( a , b ) = P n 1 , m 1 ( a , b ) · P ˜ n , m ( a , b ) .
Let n > m > 1 and set
Q n , m ( x , y ) = ( x ( A ˜ n 1 2 ( x , y ) A ˜ n 1 ( x , y ) A ˜ m 1 ( x , y ) + A ˜ m 1 2 ( x , y ) ) + y ( B ˜ n 1 2 ( x , y ) + B ˜ n 1 ( x , y ) B ˜ m 1 ( x , y ) + B ˜ m 1 2 ( x , y ) ) 3 x ) 2 x y ( ( 2 A ˜ n 1 ( x , y ) A ˜ m 1 ( x , y ) ) B ˜ n 1 ( x , y ) + ( A ˜ n 1 ( x , y ) 2 A ˜ m 1 ( x , y ) ) B ˜ m 1 ( x , y ) ) 2 ,
then P ˜ n , m ( x , y ) = Q n , m ( x 2 , y 2 ) . We have P n , m ( a , b ) = P n 1 , m 1 ( a , b ) · P ˜ n , m ( a , b ) and if there is a minimal critical orbit relation ( n , m ) then P ˜ n , m ( a , b ) = 0 .
By definition deg P n , n ( a , b ) = deg a P n , m ( a , b ) = 2 deg a A n + 2 = 2 · 3 n and deg P ˜ n , m ( a , b ) = deg a P ˜ n , m ( a , b ) = 4 deg a A n 1 + 4 = 4 · 3 n 1 .
Here is an application of the above computations. The problem of the exclusion of the variable z from the system p n ( z ) p m ( z ) = 0 and z 2 a 2 = 0 is equivalent to finding the resultant of the two polynomials, with respect to variable z [12]. We obtain the following as a direct corollary of the above computations.
Proposition 1.
For all pairs of n , m , we have if n m then
R e s z p n ( z ) p m ( z ) , z 2 a 2 = P n , m ( a , b ) ,
and
R e s z p n ( z ) p n ( z ) , z 2 a 2 = 16 a 6 P n , n 2 ( a , b ) .
Proof. 
For the case of n m by ([21] Theorem 1.3.1) and by (14) we obtain
R e s z p n ( z ) p m ( z ) , z 2 a 2 = ( p n ( a ) p m ( a ) ) ( p n ( a ) p m ( a ) ) = P n , m ( a , b ) .
For the other case, by ([21] Theorem 1.3.1) and by (10) we obtain
R e s z p n ( z ) p n ( z ) , z 2 a 2 = ( p n ( a ) p n ( a ) ) ( p n ( a ) p n ( a ) ) = 16 a 6 P n , n 2 ( a , b ) .

4. Main Result and Its Proof

Our main result is the following:
Theorem 1.
Every minimal critical orbit relation ( n , m ) ( 1 , 1 ) (1) reduces to an algebraic equation P ˜ n , m ( a , b ) = 0 on the parameters a , b defined in Section 3. In particular, there are infinitely many cubic polynomials for each minimal critical orbit relation ( n , m ) , except the relation ( 1 , 1 ) , which does not exist.
Let us remark that if the critical orbit relation ( 1 , 1 ) exists then any nearby point to the critical value must have four preimages but our polynomial is cubic so it is not realized for this family. The main result concludes that all other critical orbit relations are realized.
Proof of Theorem 1.
The first part of the theorem has been considered in the previous section for all three cases ( ( n , n ) , ( n , m ) for n > m and m = 0 and m = 1 , ( n , m ) for n > m > 1 ). For each case, the zero level of polynomials P ˜ n , m ( a , b ) corresponds to minimal ( n , m ) critical orbit relation. The degree counts show that all but ( 1 , 1 ) critical orbit relations are realized so that there are infinitely many cubic polynomials for every minimal critical orbit relation ( n , m ) ( 1 , 1 ) . It finishes the proof and answers to Problems 1 and 2 as these two are the same. □
We would like to remark that for the minimal critical orbit relation ( n , m ) the curves defined by P ˜ n , m ( a , b ) = 0 contain points ( a 0 , b 0 ) satisfying some other minimal critical orbit relation ( n , m ) ( n , m ) . So the required minimality is not equivalent to exactness. Our definition of minimality was introduced to factor those P n , m ( a , b ) as much as possible. We conjecture that there are no further factorizations than those we found in this paper. If one needs to find the exact critical orbit relation it is necessary to study the intersection of these distinct algebraic curves defined by all pairs of P ˜ n , m ( a , b ) = 0 and P ˜ n , m ( a , b ) = 0 . Then, the exact critical orbit relations for particular ( n , m ) are obtained from the curve P ˜ n , m ( a , b ) = 0 by removing infinitely many discrete points that belong also to other such curves. It is clear that an algebraic curve defined by P ˜ n , m ( a , b ) = 0 on complex variables a , b is the Zariski closure of the set of points that solve the Problem 1 for the critical orbit relation ( n , m ) .
If we consider a slice Per1 ( λ ) , for a given λ , then if | λ | < = 1 this slice does not contain postcritically finite maps. One can show that in this slice the above defined minimality is equivalent to exactness.
The moduli space can be described by the coordinates ( a 2 , b 2 ) , let x = a 2 and y = b 2 then instead of P ˜ n , m ( a 2 , b 2 ) we can work well with Q n , m ( x , y ) . We obtained the following.
Corollary 1.
In the moduli space of cubic polynomials of the form z 3 3 a 2 z + b with coordinates x = a 2 and y = b 2 the minimal critical orbit relation ( n , m ) corresponds to the set { ( x , y ) C 2 : Q n , m ( x , y ) = 0 } , where Q n , m ( x , y ) is defined by (13), (19), (20), (22), respectively. It is never empty, except for the relation ( 1 , 1 ) . The degree of the curve S n , m is half of the degree of the polynomial P ˜ ( n , m ) ( a , b ) .
Denote S n , m = { ( x , y ) C 2 : Q n , m ( x , y ) = 0 } the affine algebraic curve in C 2 . It seems that each curve S n , m , except S 1 , 1 (which is an empty set), is irreducible. These curves are analogous to those defined by Milnor [4].
Denote Crit ( n , m ) = { ( a , b ) : P ˜ n , m ( a , b ) = 0 } . In the parameter space except ( n , n ) for all cases the algebraic curves Crit ( n , m ) in C 2 have two components as P ˜ n , m ( a , b ) which are the difference of two squares. But it seems that each factor of P ˜ n , m ( a , b ) is irreducible over C in this trivial factorization, which we leave as an open problem together with the irreducibility of P ˜ n , n ( a , b ) . Moreover, the coefficients of each of P ˜ n , m ( a , b ) are integers.
We end this section with the following.
Conjecture. 
Every curve S n , m is irreducible in C [ x , y ] .
If this conjecture holds true, it implies that the structure of the parameter space remains consistent for points with critical orbit relations. If the curves were reducible, their reduced components would behave differently, causing the parameter space to split into non-uniform regions. However, visualizations and experimental results show no indication of such asymmetrical regions within the parameter space.

5. Examples of Special Curves in C 2

Here are some examples of these special curves in C 2 .
S 0 , 0 = { x = 0 } , S 1 , 0 = { x ( 2 x 1 ) 2 y = 0 } ,
S 2 , 0 = { x ( 8 x 4 6 x 2 + 6 x y 1 ) 2 y ( 12 x 3 3 x + y + 1 ) 2 = 0 } ,
S 2 , 1 = { 4 x ( x + 1 ) 2 y = 0 } , S 2 , 2 = { 4 x 3 3 x + 3 y = 0 } ,
S 3 , 1 = { x ( 8 x 4 6 x 2 + 6 x y + 2 ) 2 y ( 12 x 3 3 x + y + 1 ) 2 = 0 } ,
and
S 3 , 3 = { 64 x 9 96 x 7 + 528 x 6 y + 36 x 5 288 x 4 y + 108 x 3 y 2 + 72 x 3 y + 27 x 2 y 18 x y 2 18 x y + 3 y 3 + 6 y 2 + 3 y 3 x = 0 } .
Proposition 2.
The curves S 0 , 0 , S 1 , 0 , S 2 , 0 , S 2 , 1 , and S 2 , 2 are irreducible in C [ x , y ] .
Some examples of these curves are obtained in [22].
Proof. 
The curves S 0 , 0 , S 1 , 0 , S 2 , 1 , and S 2 , 2 are irreducible as they can be identified with the complex plain C , graphs of polynomials (Figure 1). Let us show that the curve S 2 , 0 is irreducible. We need to show that the polynomial Q 2 , 0 ( x , y ) = x ( 8 x 4 6 x 2 + 6 x y 1 ) 2 y ( 12 x 3 3 x + y + 1 ) 2 is irreducible in Q [ x , y ] . Since its linear part does not vanish, it is irreducible in C [ x , y ] as well (see ([5] Lemma 5) or ([17] Theorem 4.6)). First, we show that the polynomial Q 2 , 0 ( x , y ) does not have a factor which is a polynomial of only x. On the contrary, assume Q 2 , 0 ( x , y ) = f ( x ) g ( x , y ) . As Q 2 , 0 ( x , 0 ) = x ( 8 x 4 6 x 2 1 ) 2 and Q 2 , 0 ( 0 , y ) = y ( y + 1 ) 2 we obtain f ( 0 ) = ± 1 . Since Q 2 , 0 ( x , 0 ) = f ( x ) g ( x , 0 ) we obtain, without loss of generality, that f ( x ) = 8 x 4 6 x 2 1 . Now divide Q 2 , 0 ( x , y ) by f ( x ) and obtain a nonzero reminder, which is a contradiction.
Note that in Z 13 we have Q 2 , 0 ( 2 , y ) = 12 ( y 3 + 6 y 2 + 2 ) now apply the Eisenstein criterion for prime number 2, which proves the claim. □
In Table 1 the degrees of S n , m for n 2 have been listed in a row.

6. Two Methods to Solve Problem 3

To solve Problem 3 one can try to use the method developed for Problem 1 by obtaining analogous results of Section 2 and Section 3. The factorizations of Section 3 for P ˜ n , m are no longer needed. We can still reduce each critical orbit relation into a polynomial equation. In this section by briefly go through the main parts of the former and also develop a new method for the latter. The main Lemma 2 will become the following.
Lemma 4.
Let q ( z ) = z 3 + μ z 2 + z be a cubic polynomial with critical points c 1 and c 2 that solve the equation 3 z 2 + 2 μ z + 1 = 0 . Then, for all n 0 the equality q n ( c ) = A n ( μ ) c + B n ( μ ) holds for c = c 1 and c = c 2 where polynomials A n ( μ ) and B n ( μ ) are recurrently defined as
A n + 1 ( μ ) = A n ( μ ) ( 4 μ 2 3 9 A n 2 ( μ ) 2 μ ( 3 B n ( μ ) + μ ) 3 A n ( μ ) + 3 B n 2 ( μ ) + 2 μ B n ( μ ) + 1 ) ,
B n + 1 ( μ ) = B n 3 ( μ ) + μ B 2 ( μ ) 3 B n ( μ ) + μ 3 A n 2 ( μ ) + B n ( μ ) + 2 9 μ A n ( μ )
with A 0 ( μ ) = 1 , B 0 ( μ ) = 0 .
Proof of this lemma goes alongside of the proof of Lemma 2 where in the expansion of ( A n ( μ ) z + B n ( μ ) ) 3 + μ ( A n ( μ ) z + B n ( μ ) ) 2 + ( A n ( μ ) z + B n ( μ ) ) we substitute z 2 = 2 3 z 1 3 and z 3 = 4 μ 2 3 9 z + 2 9 μ .
Now we deal with the critical orbit relations and reduce them to polynomial relations. Since both critical points c 1 and c 2 are the roots of 3 z 2 + 2 μ z + 1 = 0 , Vieta’s formula yields that c 2 = 2 μ / 3 c 1 , which can be used to exclude the unknown c 2 from the critical orbit relations.
Case of ( n , n ) . By Lemma 4 we have
q n ( c 1 ) q n ( c 2 ) = A n ( μ ) c 1 + B n ( μ ) ( A n ( μ ) c 2 + B n ( μ ) ) = A n ( μ ) ( c 1 c 2 ) , n 1 .
If c 1 = c 2 then the discriminate of 3 z 2 + 2 μ z + 1 = 0 vanishes: 4 ( μ 2 3 ) = 0 . So that if μ = ± 3 then the critical orbit relation is ( 0 , 0 ) . For all other values of μ the critical points c 1 and c 2 are distinct and the ( n , n ) critical relation reduces to A n ( μ ) = 0 . Direct calculation yields A 1 ( μ ) = 2 ( 3 μ 2 ) 9 so that A 1 ( μ ) = 0 does not produce a ( 1 , 1 ) critical orbit relation, so this case is empty.
Denote P n , n ( μ ) = A n ( μ ) / A 1 ( μ ) . From (23) we obtain
P n , n ( μ ) = A n ( μ ) / A 1 ( μ ) = A n 1 ( μ ) / A 1 ( μ ) ( 4 μ 2 3 9 A n 1 2 ( μ ) 2 μ ( 3 B n 1 ( μ ) + μ ) 3 A n 1 ( μ ) + 3 B n 1 2 ( μ ) + 2 μ B n 1 ( μ ) + 1 ) .
Set
P ˜ n , n ( μ ) = 4 μ 2 3 9 A n 1 2 ( μ ) 2 μ ( 3 B n 1 ( μ ) + μ ) 3 A n ( μ ) + 3 B n 1 2 ( μ ) + 2 μ B n 1 ( μ ) + 1 ,
This implies that for n 2 , we have the following factorization
P n , n ( μ ) = P n 1 , n 1 ( μ ) · P ˜ n , n ( μ ) .
Case of n > m . For m = 0 we have
q n ( c 1 ) c 2 = A n ( μ ) c 1 + B n ( μ ) c 2 = 0 .
Substituting c 2 = 2 μ / 3 c 1 , into (22) yields
q n ( c 1 ) c 2 = A n ( μ ) c 1 + B n ( μ ) + 2 μ / 3 + c 1 = ( A n ( μ ) + 1 ) c 1 + B n ( μ ) + 2 μ 3 = 0
Now the problem, the ( n , 0 ) critical orbit relation, reduces to the following system of equations from which we need to exclude c = c 1 .
( A n ( μ ) + 1 ) c + B n ( μ ) + 2 μ 3 = 0 3 c 2 + 2 μ c + 1 = 0 .
This system reduces to
3 ( B n ( μ ) + 2 μ 3 ) 2 2 μ ( B n ( μ ) + 2 μ 3 ) ( A n ( μ ) + 1 ) + ( A n ( μ ) + 1 ) 2 = 0 .
For m 1 , using the identity
q ( z ) q ( w ) = ( z w ) ( z 2 + z w + w 2 + μ ( z + w ) + 1 ) ,
we obtain
q n ( c 1 ) q m ( c 2 ) = ( q n 1 ( c 1 ) q m 1 ( c 2 ) ) ( q n 1 ( c 1 ) 2 + q n 1 ( c 1 ) q m 1 ( c 2 ) + q m 1 ( c 2 ) 2 + μ ( q n 1 ( c 1 ) + q m 1 ( c 2 ) ) + 1 ) = 0 .
If m = 1 then the latter simplifies to
q n ( c 1 ) q ( c 2 ) = ( q n 1 ( c 1 ) c 2 ) ( q n 1 ( c 1 ) 2 + q n 1 ( c 1 ) c 2 + c 2 2 + μ ( q n 1 ( c 1 ) + c 2 ) + 1 ) = ( q n 1 ( c 1 ) c 2 ) 2 ( q n 1 ( c 1 ) + 2 c 2 + μ ) = ( q n 1 ( c 1 ) c 2 ) 2 ( A n 1 ( μ ) c 1 + B n 1 ( μ ) + 2 ( 2 μ / 3 c 1 ) + μ ) = ( q n 1 ( c 1 ) c 2 ) 2 ( A n 1 ( μ ) 2 ) c 1 + B n 1 ( μ ) μ / 3 = 0 .
Now the problem, the ( n , 1 ) critical orbit relation, reduces to the following system of equations from which we need to exclude c = c 1 .
( A n 1 ( μ ) 2 ) c + B n 1 ( μ ) μ / 3 = 0 3 c 2 + 2 μ c + 1 = 0 .
This system reduces to
3 B n 1 ( μ ) μ / 3 2 2 μ B n 1 ( μ ) μ / 3 ( A n 1 ( μ ) 2 ) + ( A n 1 ( μ ) 2 ) 2 = 0 .
It remains to consider the case of n > m 2 . By (27) this case reduces to solve the following system.
q n 1 ( c 1 ) 2 + q n 1 ( c 1 ) q m 1 ( c 2 ) + q m 1 ( c 2 ) 2 + μ ( q n 1 ( c 1 ) + q m 1 ( c 2 ) ) + 1 = 0 3 c 1 2 + 2 μ c 1 + 1 = 0 .
By Lemma 4 and substituting c 2 = 2 μ / 3 c 1 into the first equation of the latter system we obtain the following.
To obtain the latter we substituted identities c 1 2 = 2 μ c 1 / 3 1 / 3 , c 2 2 = 2 μ c 1 / 3 + 4 μ 2 / 9 1 / 3 , and c 1 c 2 = 1 / 3 .
Finally, this system reduces to
3 B n 1 ( μ ) μ / 3 2 2 μ B n 1 ( μ ) μ / 3 ( A n 1 ( μ ) 2 ) + ( A n 1 ( μ ) 2 ) 2 = 0 .
Instead of this, we propose an alternative method to solve Problem 3. In fact, it is not much alternative as it uses all the solutions of Problem 1 developed in Section 2 and Section 3. The idea is to work with a different parametrization of Per1 ( 1 ) other than q ( z ) = z 3 + μ z 2 + z .
We start with the Branner–Hubbard form of a cubic polynomial p ( z ) = z 3 3 a 2 z + b and require that it has a multiple fixed point, not necessarily at the origin. It means that the fixed point equation z 3 3 a 2 z + b = z has a multiple solution, which in turn, is equivalent to the vanishing of the discriminant of z 3 ( 3 a 2 + 1 ) z + b , which is 4 ( 3 a 2 + 1 ) 3 27 b 2 = 0 . Now solve the latter for b 2 and substitute it in P ˜ n , m ( a , b ) that is defined in Section 3 (by Formulas (10), (15), (16) and (21)) as these all are polynomials of a 2 and b 2 and thus obtain polynomials of a 2 only. For Problem 3 the corresponding result becomes stronger and, in particular, answers affirmatively on the infiniteness of cubic polynomials with critical orbit relations. Let us state it as a theorem without giving a proof.
Theorem 2.
The slice of C 2 defined by 4 ( 3 a 2 + 1 ) 3 27 b 2 = 0 represents Per1 ( 1 ) and cubic polynomials q ( z ) = z 3 + μ z 2 + z with exact critical orbit relations ( n , m ) corresponding to level sets P ˜ n , m ( a , b ) = 0 , where P ˜ n , m ( a , b ) are defined in Formulas (11), (15), (16), (21) with a substitution b 2 = 4 ( 3 a 2 + 1 ) 3 / 27 . Moreover, the obtained critical orbit relations ( n , m ) ( 1 , 1 ) are all realized and are exact and there are infinitely many cubic polynomials q ( z ) = z 3 + μ z 2 + z with a critical orbit relation except the relation ( 1 , 1 ) .
The idea of its proof is as follows. Let us note that every map q ( z ) = z 3 + μ z 2 + z has a parabolic fixed point at the origin and such a fixed point attracts the infinite orbit of a critical point [4]. If both critical points are in a relation then this relation is exact. By substituting A n ( a , b ) = A ˜ n ( a 2 , b 2 ) and B n ( a , b ) = b B ˜ n ( a 2 , b 2 ) from Lemma 3 with (8), (9) and b 2 = 4 ( 3 a 2 + 1 ) 3 / 27 into (11) we obtain P ˜ n , n ( a , b ) = a 2 A ˜ n 1 2 ( a 2 , b 2 ) + 3 b 2 B ˜ n 1 2 ( a 2 , b 2 ) 3 a 2 = a 2 A ˜ n 1 2 ( a 2 , b 2 ) + 4 ( 3 a 2 + 1 ) 3 9 B ˜ n 1 2 ( a 2 , b 2 ) 3 a 2 , which is a polynomial of variable a. Similarly, we can show that after substitutions the polynomials defined in Formulas (15), (16), (21) are polynomials of variable a. Now introduce notations x = a 2 and y = b 2 then
y = 4 ( 3 a 2 + 1 ) 3 / 27 = 4 ( 3 x + 1 ) 3 / 27 = 4 ( x + 1 / 3 ) 3 .
By abusing the notation, (8) and (9) become the following after the substitutions.
A ˜ n + 1 ( x ) = A ˜ n ( x ) ( x A ˜ n 2 ( x ) + 12 ( x + 1 / 3 ) 3 B ˜ n 2 ( x ) 3 x ) ,
B ˜ n + 1 ( x ) = 4 ( x + 1 / 3 ) 3 B ˜ n 3 ( x ) + 3 x B ˜ n ( x ) ( A ˜ n 2 ( x ) 1 ) + 1 ,
Denote the leading term of a polynomial f by L T ( f ) and the leading coefficient by L C ( f ) . We obtain the following recurrence relations for the leading terms and coefficients.
L T ( A ˜ n + 1 ( x ) ) = x L T ( A ˜ n ( x ) ) 3 + 12 x 3 L T ( B ˜ n ( x ) ) 2 L T ( A ˜ n ( x ) ) ,
L T ( B ˜ n + 1 ( x ) ) = 4 x 3 L T ( B ˜ n ( x ) ) 3 + 3 x L T ( B ˜ n ( x ) ) L T ( A ˜ n ( x ) ) 2 ,
with L T ( A ˜ 1 ( x ) ) = 2 x and L T ( B ˜ 1 ( x ) ) = 1 .
L C ( A ˜ n + 1 ( x ) ) = L C ( A ˜ n ( x ) ) 3 + 12 L C ( B ˜ n ( x ) ) 2 L C ( A ˜ n ( x ) ) ,
L C ( B ˜ n + 1 ( x ) ) = 4 L C ( B ˜ n ( x ) ) 3 + 3 L C ( B ˜ n ( x ) ) L C ( A ˜ n ( x ) ) 2 ,
with L C ( A ˜ 1 ( x ) ) = 2 and L C ( B ˜ 1 ( x ) ) = 1 . To solve the recurrence relation, introduce t n = L C ( A ˜ n ( x ) ) / L C ( B ˜ n ( x ) ) and divide the first equation by the second and obtain
t n + 1 = t n ( t n 2 + 12 ) 3 t n 2 + 4 ,
with t 1 = 2 . This recurrence relation produces a constant sequence t n = 2 as 2 is a fixed point of the rational function t t ( t 2 + 12 ) 3 t 2 + 4 . Now it is easy to see that L C ( A ˜ n ( x ) ) = 2 2 · 3 n 1 1 and L C ( B ˜ n ( x ) ) = 2 2 · 3 n 1 2 . Corresponding degrees are as follows:
deg ( A ˜ n + 1 ( x ) ) = 1 + 3 deg ( A ˜ n ( x ) ) ,
deg ( B ˜ n + 1 ( x ) ) = 3 + 3 deg ( B ˜ n ( x ) ) ,
with deg A ˜ 1 = 1 and deg B ˜ 1 = 0 . Solving these recurrence relations one obtains
deg A ˜ n = ( 3 n 1 ) / 2
and
deg B ˜ n = ( 3 n 3 ) / 2 .
Finally, L T ( A ˜ n ( x ) ) = 2 2 · 3 n 1 1 x ( 3 n 1 ) / 2 and L T ( B ˜ n ( x ) ) = 2 2 · 3 n 1 2 x ( 3 n 3 ) / 2 .
Note that
P ˜ n , n ( x ) = x A ˜ n 1 2 ( x ) + 12 ( x + 1 / 3 ) 3 B ˜ n 1 2 ( x ) 3 x ,
P ˜ n , 0 ( x ) = x ( A ˜ n ( x ) + 1 ) 2 4 ( x + 1 / 3 ) 3 B ˜ n 2 ( x ) ,
P ˜ n , 1 = x ( A ˜ n 1 ( x ) 2 ) 2 4 ( x + 1 / 3 ) 3 B ˜ n 1 2 ( x ) ,
and for n > m 2
P ˜ n , m ( x ) = ( x ( A ˜ n 1 2 ( x ) A ˜ n 1 ( x ) A ˜ m 1 ( x ) + A ˜ m 1 2 ( x ) ) + 4 ( x + 1 / 3 ) 3 ( B ˜ n 1 2 ( x ) + B ˜ n 1 ( x ) B ˜ m 1 ( x ) + B ˜ m 1 2 ( x ) ) 3 x ) 2 4 x ( x + 1 / 3 ) 3 ( 2 A ˜ n 1 ( x ) A ˜ m 1 ( x ) ) B ˜ n 1 ( x ) + ( A ˜ n 1 ( x ) 2 A ˜ m 1 ( x ) ) B ˜ m 1 ( x ) 2 .
We have that
L T ( P ˜ n , n ) = x L T ( A n 1 ) 2 + 12 x 3 L T ( B n 1 ) 2 = 16 3 n 2 x 3 n 1 .
For the rest of the polynomials there are resonances. The term x A ˜ n 2 ( x ) resonates with the term 4 ( x + 1 / 3 ) 3 B ˜ n 1 2 ( x ) so that for P ˜ n , 0 ( x ) and P ˜ n , 1 ( x ) half of their degrees are dropped. For the polynomial P ˜ n , m ( x ) the resonance happens for x 2 ( A ˜ n 1 2 ( x ) 2 with 16 x ( x + 1 / 3 ) 3 A ˜ n 1 ( x ) 2 resulting in a drop of the degree. But one can show that
deg P ˜ n , 0 ( x ) = ( 3 n + 1 ) / 2 ,
deg P ˜ n , 1 ( x ) = ( 3 n + 3 ) / 6 ,
and for n > m 2 we have that
deg P ˜ n , m ( x ) = 2 · 3 n 1 .
Here are some examples: P ˜ 2 , 0 ( x ) = 128 x 5 308 x 4 / 3 340 x 3 / 27 904 x 2 / 243 139 x / 729 3844 / 19683 , P ˜ 2 , 1 ( x ) = 4 x 2 + 8 x / 3 4 / 27 , P ˜ 2 , 2 ( x ) = 16 x 3 + 12 x 2 + x + 4 / 9 , P ˜ 3 , 1 ( x ) = 64 x 5 + 124 x 4 / 3 16 x 3 / 27 + 392 x 2 / 243 + 2048 x / 729 3844 / 19683 , P ˜ 3 , 3 ( x ) = 4096 x 9 + 6144 x 8 + 2816 x 7 + 5504 x 6 / 9 + 1136 x 5 / 3 + 1604 x 4 / 9 + 2344 x 3 / 81 + 472 x 2 / 81 + 139 x / 243 + 3844 / 6561 .

7. Summary and Further Discussions

This paper considered the problem of generating cubic polynomials with all possible critical orbit relations. We explicitly found that for polynomials, the level sets correspond to specific critical orbit relations. We also considered the sub-problems where we considered some slices in the parameter plane. The slices are cubic polynomials with fixed points with constant multipliers, Problem 2, and the multiplier 1, where the cubic polynomials have parabolic fixed points, and Problem 3. For the latter case, we gave two solutions to the problem. The statement of the main Lemma 2 is true for all other families of polynomials or rational functions as long as we have two interacting critical points that solve a quadratic equation of the parameters of the family. The idea is to reduce high powers in iterates of the critical point to a linear map (affine) of the critical point and then to reduce the critical relation into a linear equation and solve it explicitly. For some low degrees, the irreducibility is studied in Proposition 2. We propose a conjecture that all obtained polynomials in this paper are irreducible but this problem could be very hard to solve in full generality. To continue this line of research the other problems are as follows: One can also consider critical orbit relation for Blashke products. In this case, maps depend only on real analysis of the parameters so that the obtained equations will not be complex polynomials but polynomials involving parameters and their complex conjugates. The family considered in [23] is also a perfect example of the methods proposed in this paper.
One of the applications of the results in this paper is to study the number of stable components in the parameter plane of cubic polynomials as they contain unique centers where maps have critical orbit relations [19,20,24]. We can label them by the number of iterates for a critical orbit to reach the immediate basins of some fixed points. The difficulty one needs to overcome this problem is that the polynomials that we obtain do not determine the exact location of the critical point. The critical point could be in any Fatou component or both critical points could be at the same component and have a relation with each other. So the solution for this could be to use the Blaschke products that are mentioned above to exclude the latter case and obtain correct numbers on the number of stable components.
Another open problem is to study the interaction of more than two critical points. Now the critical points solve cubic equations or higher-order equations. In this case, we can modify the main Lemma 2 such that the iterates are now quadratic or one degree lower than the critical equation. The findings in this paper have significant implications for computational dynamics and related fields. By providing a systematic method for generating dynamical systems with specified orbit relations, our approach offers tools to study parameter spaces and the stability of holomorphic families. These insights can be utilized in modeling phenomena in physics, biology, and other sciences where dynamical systems are prevalent.
In computational dynamics, the iterative techniques described here can improve algorithms for detecting critical orbit relations, which are pivotal in visualizing fractals, such as the Mandelbrot set. Furthermore, understanding the structure and irreducibility of COR varieties aids in optimizing parameter exploration in high-dimensional spaces.
Future research could extend this framework to higher-degree polynomials or other families of rational functions. Additionally, exploring connections between critical orbit relations and arithmetic dynamics might yield new methods for solving Diophantine equations. The interdisciplinary nature of this work invites collaboration across mathematics, physics, and computer science to tackle complex systems and advance computational methods for analyzing their behavior.

Author Contributions

Conceptualization, K.M., F.Ç., M.R., G.I. and B.A.P.; methodology, K.M., F.Ç., M.R., G.I. and B.A.P.; validation, K.M., F.Ç., M.R., G.I. and B.A.P.; formal analysis, K.M., F.Ç., M.R., G.I. and B.A.P.; investigation, K.M., F.Ç., M.R., G.I. and B.A.P.; writing—original draft preparation, K.M., F.Ç., M.R., G.I. and B.A.P.; writing—review and editing, K.M., F.Ç., M.R., G.I. and B.A.P.; visualization, K.M., F.Ç., M.R., G.I. and B.A.P.; supervision, G.I. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Acknowledgments

Part of this research was carried out when the first author visited the Institute of Mathematics of Polish Academy of Sciences for Simons Semester 2023 and participated in Thematic Research Programme ‘Modern holomorphic dynamics and related fields’, Excellence Initiative—Research University program at the University of Warsaw. The first author thanks the organizers for the invitation and generous support. The authors also thank Farkhod Eshmatov, and Georgii Makeev for their valuable comments on the paper. The authors would like to thank the anonymous referees who provided useful and detailed comments on an earlier version of the manuscript.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Baker, M.; De Marco, L. Special curves and postcritically finite polynomials. Forum Math. 2013, 1, e3. [Google Scholar] [CrossRef]
  2. Favre, C.; Gauthier, F. Classification of Special Curves in the Space of Cubic Polynomials. Int. Math. Res. Not. 2016, 2018, 362–411. [Google Scholar] [CrossRef]
  3. Favre, C.; Gauthier, T. The Arithmetic of Polynomial Dynamical Pairs; Imj (AMS-214); Princeton University Press: Princeton, NJ, USA, 2022. [Google Scholar]
  4. Milnor, J. Cubic polynomial maps with periodic critical orbit, part I. In Complex Dynamics: Families and Friends; Schleicher, D., Ed.; CRC Press: Boca Raton, FL, USA, 2009; pp. 333–411. [Google Scholar]
  5. Buff, X.; Epstein, A.L.; Koch, S. Rational maps with a preperiodic critical point. arXiv 2018, arXiv:1806.11221. [Google Scholar]
  6. Branner, B.; Hubbard, J. The iteration of cubic polynomials Part I: The global topology of parameter space. Acta Math. 1988, 160, 143–206. [Google Scholar] [CrossRef]
  7. Dujardin, R. Cubic polynomials: A measurable view of parameter space. In Complex Dynamics: Families and Friends; Schleicher, D., Ed.; CRC Press: Boca Raton, FL, USA, 2009; pp. 451–489. [Google Scholar]
  8. Inou, H.; Mukherjee, S. On the support of the bifurcation measure of cubic polynomials. Math. Ann. 2019, 378, 1–12. [Google Scholar] [CrossRef]
  9. Milnor, J. Remarks on iterated cubic maps. Exp. Math. 1992, 1, 5–24. [Google Scholar]
  10. McMullen, C. The Mandelbrot Set is Universal. In The Mandelbrot Set, Theme and Variations; Lei, T., Ed.; Cambridge University Press: Cambridge, UK, 2000; pp. 1–18. [Google Scholar]
  11. Dujardin, R.; Favre, C. Distribution of Rational Maps with a Preperiodic Critical Point. Am. J. Math. 2008, 130, 979–1032. [Google Scholar] [CrossRef]
  12. Cox, D.A.; Little, J.; O’Shea, D. Ideals, Varieties, and Algorithms, An Introduction to Computational Algebraic Geometry and Commutative Algebra; Springer International Publishing: Cham, Switzerland, 2015. [Google Scholar]
  13. Ramadas, R.; Silversmith, R. Equations at Infinity for Critical-Orbit-Relation Families of Rational Maps. Exp. Math. 2022, 33, 379–399. [Google Scholar] [CrossRef]
  14. Ramadas, R. Moduli spaces of quadratic maps: Arithmetic and geometry. Int. Math. Res. Not. 2024, 15, 11364–11370. [Google Scholar] [CrossRef]
  15. Buff, X.; Epstein, A.L.; Koch, S. Prefixed curves in moduli space. Am. J. Math. 2022, 144, 1485–1509. [Google Scholar] [CrossRef]
  16. Buff, X.; Floyd, W.; Koch, S.; Parry, W. Factoring Gleason polynomials modulo 2. J. Théor. Des Nombres Bordx. 2022, 34, 787–812. [Google Scholar] [CrossRef]
  17. Patra, N. Irreducibility of preperiodic curves in the moduli space of cubic polynomials. arXiv 2023, arXiv:2305.19944. [Google Scholar]
  18. Patra, N. On irreducibility of preperiodic algebraic sets in moduli spaces of prime power degree polynomials. arXiv 2023, arXiv:2305.04778. [Google Scholar]
  19. Mamayusupov, K. Newton maps of complex exponential functions and parabolic surgery. Fundam. Math. 2018, 241, 265–290. [Google Scholar] [CrossRef]
  20. Mamayusupov, K. A characterization of postcritically minimal Newton maps of complex exponential functions. Ergod. Theory Dyn. Syst. 2019, 39, 2855–2880. [Google Scholar] [CrossRef]
  21. Prasolov, V.V. Polynomials, 1st ed.; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  22. Mamayusupov, K. Cubic polynomials with critical orbit relations. Uzb. Math. J. 2022, 66, 80–85. [Google Scholar]
  23. De Marco, L.; Xiaoguang, W.; Hexi, Y. Bifurcation measures and quadratic rational maps. Proc. Lond. Math. Soc. 2015, 111, 149–180. [Google Scholar] [CrossRef]
  24. Mamayusupov, K. On Postcritically Minimal Newton Maps. Ph.D. Thesis, IRC-Library, Information Resource Center der Jacobs University Bremen, Bremen, Germany, 2015. [Google Scholar]
Figure 1. The graphs of the curves S 2 , 0 , S 2 , 1 , S 2 , 2 , S 3 , 3 .
Figure 1. The graphs of the curves S 2 , 0 , S 2 , 1 , S 2 , 2 , S 3 , 3 .
Mathematics 13 00401 g001
Table 1. The degree row of S n , m for n 2 .
Table 1. The degree row of S n , m for n 2 .
m
012.. n 1 n
n 3 n 3 n 1 2 · 3 n 1 .. 2 · 3 n 1 3 n 1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Mamayusupov, K.; Çilingir, F.; Ruziboev, M.; Ibragimov, G.; Pansera, B.A. Generating Special Curves for Cubic Polynomials. Mathematics 2025, 13, 401. https://doi.org/10.3390/math13030401

AMA Style

Mamayusupov K, Çilingir F, Ruziboev M, Ibragimov G, Pansera BA. Generating Special Curves for Cubic Polynomials. Mathematics. 2025; 13(3):401. https://doi.org/10.3390/math13030401

Chicago/Turabian Style

Mamayusupov, Khudoyor, Figen Çilingir, Marks Ruziboev, Gafurjan Ibragimov, and Bruno Antonio Pansera. 2025. "Generating Special Curves for Cubic Polynomials" Mathematics 13, no. 3: 401. https://doi.org/10.3390/math13030401

APA Style

Mamayusupov, K., Çilingir, F., Ruziboev, M., Ibragimov, G., & Pansera, B. A. (2025). Generating Special Curves for Cubic Polynomials. Mathematics, 13(3), 401. https://doi.org/10.3390/math13030401

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop