English

Lavaurs algorithm for cubic symmetric polynomials

Dynamical Systems 2025-07-09 v1

Abstract

To investigate the degree dd connectedness locus, Thurston studied \emph{σd\sigma_d-invariant laminations}, where σd\sigma_d is the dd-tupling map on the unit circle, and built a topological model for the space of quadratic polynomials fc(z)=z2+cf_c(z) = z^2 +c. In the same spirit, we consider the space of all \emph{cubic symmetric polynomials} fλ(z)=z3+λ2zf_\lambda(z)=z^3+\lambda^2 z in three articles. In the first one we construct the lamination CsCLC_sCL together with the induced factor space S/CsCL\mathbb{S}/C_sCL of the unit circle S\mathbb{S}. As will be verified in the third paper, S/CsCL\mathbb{S}/C_sCL is a monotone model of the \emph{cubic symmetric connectedness locus}, i.e., the space of all cubic symmetric polynomials with connected Julia sets. In the present paper, the second in the series, we develop an algorithm for constructing CsCLC_sCL analogous to the Lavaurs algorithm for constructing a combinatorial model M2comb\mathcal{M}^{comb}_2 of the Mandelbrot set M2\mathcal{M}_2.

Keywords

Cite

@article{arxiv.2202.06734,
  title  = {Lavaurs algorithm for cubic symmetric polynomials},
  author = {Alexander Blokh and Lex G. Oversteegen and Nikita Selinger and Vladlen Timorin and Sandeep Chowdary Vejandla},
  journal= {arXiv preprint arXiv:2202.06734},
  year   = {2025}
}

Comments

27 pages, 3 figures. arXiv admin note: text overlap with arXiv:2201.11434

R2 v1 2026-06-24T09:35:22.804Z