Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lavaurs algorithm for cubic symmetric polynomials (2202.06734v1)

Published 14 Feb 2022 in math.DS

Abstract: To investigate the degree $d$ connectedness locus, Thurston studied \emph{$\sigma_d$-invariant laminations}, where $\sigma_d$ is the $d$-tupling map on the unit circle, and built a topological model for the space of quadratic polynomials $f_c(z) = z2 +c$. In the same spirit, we consider the space of all \emph{cubic symmetric polynomials} $f_\lambda(z)=z3+\lambda2 z$ in three articles. In the first one we construct the lamination $C_sCL$ together with the induced factor space $\mathbb{S}/C_sCL$ of the unit circle $\mathbb{S}$. As will be verified in the third paper, $\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 $C_sCL$ analogous to the Lavaurs algorithm for constructing a combinatorial model $\mathcal{M}{comb}_2$ of the Mandelbrot set $\mathcal{M}_2$.

Summary

We haven't generated a summary for this paper yet.