加载中…
In this work we introduce the broken line construction, which is a geometric and combinatorial algorithm that computes periodic Sturmian angles of a given period, yielding the locations of their landing parameters in the Mandelbrot set. An easy to implement method to compute the conjugated angle of a periodic Sturmian angle is also provided. Furthermore, if is a periodic Sturmian angle computed by the broken line construction, then we show the existence of a one-to-one correspondence between its binary expansion and its associated kneading sequence.

生成讲解博客的中文版本

生成AI智能校验的中文版本