The classical Fatou–Shishikura inequality states that a complex polynomial of degree has at most non-repelling cycles. Blokh, Childers, Levin, Oversteegen and Schleicher (2016) proved an extended version: a chain of inequalities that also counts repelling cycles at which no periodic external rays land and wandering collections of eventual branch continua — continua of the Julia set whose pairwise-disjoint forward images eventually carry at least three external rays — against a budget of weakly recurrent and escaping critical points. In degree 3 the extended inequality is sharp in a strong sense: uncountably many cubic polynomials with locally connected dendrite Julia sets (a dendrite is a locally connected continuum containing no simple closed curve) carry a wandering branch point of valence 3 whose presence alone exhausts the entire budget of critical points, so that all inequalities of the paper's Theorem 1.2 hold with equality, and the authors state that they believe the inequality is sharp in general. The problem asks whether this saturation persists in every degree: for each — the open cases are — does there exist a degree- polynomial whose wandering eventual branch continua, together with the cycles of Julia components carrying them, consume the full critical budget ; or is the maximum of this wandering-continua load strictly below for some degree, so that the wandering-continua part of the extended inequality can be improved? Whether for is open.
Background
Let be a complex polynomial of degree and consider its iterates. The filled Julia set is the set of points with bounded forward orbits, and the Julia set is the boundary between bounded and escaping dynamics. Near infinity is conformally conjugate to , so external rays — the images of straight radial lines under this conjugacy — foliate the basin of infinity and accumulate on ; when several external rays land at the same point of , that point sees several directions of escape, like a branch point of a tree. A periodic point is repelling if its multiplier has modulus greater than 1 and non-repelling otherwise (attracting, parabolic, or irrationally indifferent, the last type splitting into Cremer points and Siegel-disk centers). Critical points — the zeros of — are the finite steering resource of polynomial dynamics: Fatou and Shishikura proved that a degree- polynomial has at most non-repelling cycles (the Fatou–Shishikura inequality), and Shishikura's quasiconformal surgery — a technique that grafts holomorphic pieces together along quasiconformal homeomorphisms — shows that this bound is sharp in every degree.
The source paper refines the inequality by counting more dynamical features on the left and fewer critical points on the right. A continuum (a nonempty compact connected set, possibly a point) is wandering if all its forward images are pairwise disjoint; for a wandering continuum, the number of external rays with limit sets in is finite (by results of Kiwi and Blokh–Levin) and eventually constant along the forward orbit, and this stabilized number is the eventual valence ; is an eventual branch continuum if , the dynamical analogue of a branch point. On the critical side one counts weakly recurrent critical points — critical points in the filled Julia set whose orbits never land on repelling or parabolic points and are not eventually separated from themselves by any finite family of rational ray pairs, i.e. pairs of (pre)periodic external rays landing at a common point — together with escaping critical points, sorted by whether they lie in periodic or in wandering components of . The Extended Fatou–Shishikura Inequality (Theorem 1.2 of the source paper) states, in a weak form,
where counts non-repelling cycles, counts repelling cycles at which no periodic external rays land, the form a wandering collection of non-(pre)critical eventual branch continua, and records whether it is nonempty; the full theorem is a pair of sharper inequalities bounding the same quantities by the numbers of weakly recurrent and escaping critical points, whose total is at most .
Wandering branch continua are the topological shadow of a classical combinatorial question of Thurston. When is connected and locally connected, the equivalence relation "two external angles have rays landing at the same point" is compatible with the angle map and defines a -invariant lamination: a collection of chords (leaves) with disjoint convex hulls in the closed unit disk that maps into itself under , whose complementary components are called gaps. A point of at which rays land corresponds to a gap with vertices, and the gap is wandering if all its images are pairwise disjoint. Thurston proved that degree-2 laminations have no wandering triangles — a key ingredient of his combinatorial model of the Mandelbrot set — and posed the problem of extending this to higher degrees. As a non-existence statement that extension is false: Blokh and Oversteegen constructed uncountably many cubic laminations with wandering triangles, realized by cubic polynomials whose Julia sets are locally connected dendrites (locally connected continua containing no simple closed curve) with a wandering branch point. What survives is classification: Kiwi proved that a wandering gap of a degree- invariant lamination has at most vertices; Blokh–Levin proved for a wandering collection of finite gaps , where counts cycles of infinite gaps; Childers showed that each wandering gap carries recurrent critical chords with pairwise disjoint orbits; and Bhattacharya–Blokh–Schleicher recently proved that unicritical laminations (those modeling ) have no wandering polygons in any degree. The classification of wandering gaps for general degrees remains open.
In this landscape the source paper states one explicit open problem of its own: sharpness of the extended inequality in degrees beyond 3. In degree 2 wandering eventual branch continua cannot exist — for connected, locally connected Julia sets this is Thurston's No Wandering Triangle theorem, and in general it already follows from the extended inequality itself, since a single wandering eventual branch continuum would consume at least two of the one available unit of budget — so the extended inequality collapses to the classical one, which is sharp. In degree 3 the count is sharp in the strongest sense: by the cubic constructions of Blokh and Oversteegen (wandering triangles and wandering gaps for weakly hyperbolic cubic polynomials; see also Blokh–Curry–Oversteegen and Buff–Canela–Roesch) there exist — uncountably many — cubic polynomials with locally connected nonseparating dendrite Julia sets containing a wandering non-(pre)critical branch point of valence 3, so that (one cycle of Julia components carrying the wandering continuum) together with exhausts the entire budget , both critical points being weakly recurrent, and both inequalities of Theorem 1.2 hold with equality. The authors add that they "believe it is sharp in general too". Note that literal equality in the summed bound is also attained classically in every degree by polynomials with attracting cycles; the non-trivial content of the belief — matching the degree-3 evidence they cite — is that the wandering continua themselves can saturate the critical budget, which is the problem stated here.
Problem Statement
Let be the supremum, over all complex polynomials of degree and all wandering collections of eventual branch continua of , of the total load of wandering eventual branch continua in the extended Fatou–Shishikura inequality of Blokh–Childers–Levin–Oversteegen–Schleicher:
where the supremum ranges over polynomials of degree and over wandering collections of eventual branch continua: continua (the Julia set of , i.e. the boundary of the set of points with bounded forward orbits) such that the forward images of all members of the collection are pairwise disjoint, no forward image contains a critical point of , and the eventual valence — the number of external rays (images of radial lines under the conformal conjugacy of to near infinity) with limit sets in , a finite number that is eventually constant along the forward orbit — is at least 3. Within such a collection, consists of those continua contained in (pre)periodic components of , of those that are themselves components of , counts the cycles of components of containing wandering eventual branch continua of the collection, and is 1 if the second family is nonempty and 0 otherwise. The summed inequality of Theorem 1.2 of the cited paper gives . Known values: — already Theorem 1.2 itself rules out wandering eventual branch continua in degree 2, since any single one would consume at least two of the single available unit of budget (in the locally connected case this is also Thurston's No Wandering Triangle theorem, which excludes wandering gaps in degree-2 laminations) — and , by the Blokh–Oversteegen cubic polynomials with a wandering valence-3 branch point.
The problem is to determine for every degree ; in particular: is for every , as the authors of the extended inequality believe ("we believe it is sharp in general too")? An affirmative answer must construct, for each degree (in any model class — dendrite Julia sets, i.e. Julia sets that are locally connected continua without simple closed curves, laminations realized by polynomials, or otherwise), polynomials whose wandering eventual branch continua, together with the cycles of Julia components carrying them, consume the entire critical budget , with equality throughout the chain of Theorem 1.2 in the regime of the cubic examples, where no non-repelling Fatou or Cremer data competes for the budget. A negative answer must prove that for some degree , i.e. exhibit a universal improvement of the wandering-continua part of the extended inequality that is valid for all degree- polynomials. A complete determination of for all , whatever the values, also resolves the problem.
References
- Alexander Blokh, Doug Childers, Genadi Levin, Lex Oversteegen, Dierk Schleicher, An extended Fatou–Shishikura inequality and wandering branch continua for polynomials, Advances in Mathematics 288 (2016), 1121–1174. DOI: 10.1016/j.aim.2015.10.020, https://doi.org/10.1016/j.aim.2015.10.020 (arXiv:1001.0953, https://arxiv.org/abs/1001.0953)
- Mitsuhiro Shishikura, On the quasiconformal surgery of rational functions, Annales scientifiques de l'École normale supérieure 20 (1987), 1–29. DOI: 10.24033/asens.1522, https://doi.org/10.24033/asens.1522
- William Thurston, On the Geometry and Dynamics of Iterated Rational Maps, in Complex Dynamics: Families and Friends, A K Peters/CRC (2009), 3–130. DOI: 10.1201/b10617-3, https://doi.org/10.1201/b10617-3
- Alexander Blokh, Lex Oversteegen, Wandering triangles exist, Comptes Rendus Mathématique 339 (2004), 365–370. DOI: 10.1016/j.crma.2004.06.024, https://doi.org/10.1016/j.crma.2004.06.024
- Alexander Blokh, Lex Oversteegen, Wandering Gaps for Weakly Hyperbolic Polynomials, in Complex Dynamics: Families and Friends, A K Peters/CRC (2009), 139–168. DOI: 10.1201/b10617-4, https://doi.org/10.1201/b10617-4
- Alexander Blokh, Clinton Curry, Lex Oversteegen, Cubic critical portraits and polynomials with wandering gaps, Ergodic Theory and Dynamical Systems 33 (2013), 713–738. DOI: 10.1017/etds.2012.136, https://doi.org/10.1017/etds.2012.136 (arXiv:1003.4467, https://arxiv.org/abs/1003.4467)
- Xavier Buff, Jordi Canela, Pascale Roesch, Julia sets with a wandering branching point, Indiana University Mathematics Journal 69 (2020), 2241–2265. DOI: 10.1512/iumj.2020.69.8056, https://doi.org/10.1512/iumj.2020.69.8056 (arXiv:1801.09539, https://arxiv.org/abs/1801.09539)
- Jan Kiwi, Wandering orbit portraits, Transactions of the American Mathematical Society 354 (2002), 1473–1485. DOI: 10.1090/S0002-9947-01-02896-3, https://doi.org/10.1090/S0002-9947-01-02896-3
- A. Blokh, G. Levin, An inequality for laminations, Julia sets and 'growing trees', Ergodic Theory and Dynamical Systems 22 (2002), 63–97. DOI: 10.1017/S0143385702000032, https://doi.org/10.1017/S0143385702000032
- Douglas K. Childers, Wandering polygons and recurrent critical leaves, Ergodic Theory and Dynamical Systems 27 (2007), 87–107. DOI: 10.1017/S0143385706000526, https://doi.org/10.1017/S0143385706000526 (arXiv:math/0505627, https://arxiv.org/abs/math/0505627)
- Sourav Bhattacharya, Alexander Blokh, Dierk Schleicher, Unicritical laminations, Fundamenta Mathematicae 258 (2022), 25–63. DOI: 10.4064/fm18-2-2022, https://doi.org/10.4064/fm18-2-2022 (arXiv:2101.08101, https://arxiv.org/abs/2101.08101)
- Kostiantyn Drach, Russell Lodge, Dierk Schleicher, Maik Sowinski, Puzzles and the Fatou–Shishikura injection for rational Newton maps, Transactions of the American Mathematical Society 374 (2021), 2753–2784. DOI: 10.1090/tran/8273, https://doi.org/10.1090/tran/8273 (arXiv:1805.10746, https://arxiv.org/abs/1805.10746)
- Anna Miriam Benini, Núria Fagella, A bound on the number of rationally invisible repelling orbits, Advances in Mathematics 370 (2020), 107214. DOI: 10.1016/j.aim.2020.107214, https://doi.org/10.1016/j.aim.2020.107214 (arXiv:1907.12310, https://arxiv.org/abs/1907.12310)
- Anna Miriam Benini, Núria Fagella, Singular values and non-repelling cycles for entire transcendental maps, Indiana University Mathematics Journal 69 (2020), 1543–1558. DOI: 10.1512/iumj.2020.69.8000, https://doi.org/10.1512/iumj.2020.69.8000