Lavaurs algorithm for cubic symmetric polynomials
Abstract
To investigate the degree connectedness locus, Thurston studied \emph{-invariant laminations}, where is the -tupling map on the unit circle, and built a topological model for the space of quadratic polynomials . In the same spirit, we consider the space of all \emph{cubic symmetric polynomials} in three articles. In the first one we construct the lamination together with the induced factor space of the unit circle . As will be verified in the third paper, 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 analogous to the Lavaurs algorithm for constructing a combinatorial model of the Mandelbrot set .
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