Skip to the main content

Glasnik matematički, Vol. 61 No. 1, 2026.

Original scientific paper

https://doi.org/10.3336/gm.61.1.04

Monodromy through narrow bifurcation locus of the Mandelbrot set

Hyungryul Baik ; Department of Mathematical Sciences, KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, South Korea
Juhun Baik orcid id orcid.org/0000-0002-4167-2722 ; Department of Mathematical Sciences, KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, South Korea

Full text: english pdf 6.671 Kb

page 77-115

downloads: 0

cite

Download JATS file

Abstract

We study the behavior of the itinerary sequence of each point of the Julia set of \(z\mapsto z^2 + c\) when the parameter \(c\) in the shift locus is allowed to pass through points in the bifurcation locus, which we call narrow.
We first show the combinatorial and geometric properties of narrow characteristic arcs.
We also show how the itinerary sequence changes in an algorithmic way by using the lamination models proposed by Keller [13].
The algorithm is recently generalized to all bifurcation points by Ishii and Richards [11].
Finally, we found an equivalence relation on the set of \(0\)-\(1\) sequences such that the changing rule is a shift invariant up to the equivalence relation.
This generalizes Atela's works ([1], [2]), which dealt with the special case of the generalized rabbit polynomials.

Keywords

bifurcation locus, itinerary sequence, kneading sequence, Mandelbrot set, invariant circle lamination.

Hrčak ID:

348196

URI

https://hrcak.srce.hr/348196

Publication date:

15.8.2026.

Visits: 0 *

Publication date: 30 June 2026

Volume: Vol 61

Issue: Svezak 1

Pages: 77-115

DOI: 10.3336/gm.61.1.04

Article Information (continued)

Categories:

Subject: Izvorni znanstveni članak

Keywords:

Keyword: bifurcation locus, itinerary sequence, kneading sequence, Mandelbrot set, invariant circle lamination.

Monodromy through narrow bifurcation locus of the Mandelbrot set

Hyungryul Baik[1]

Email: hrbaik@kaist.ac.kr

Juhun Baik[2]

Email: jhbaik@kaist.ac.kr

 

[1] Department of Mathematical Sciences, KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, South Korea

[2] Department of Mathematical Sciences, KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, South Korea

Abstract

We study the behavior of the itinerary sequence of each point of the Julia set of \(z\mapsto z^2 + c\) when the parameter \(c\) in the shift locus is allowed to pass through points in the bifurcation locus, which we call narrow. We first show the combinatorial and geometric properties of narrow characteristic arcs. We also show how the itinerary sequence changes in an algorithmic way by using the lamination models proposed by Keller [13]. The algorithm is recently generalized to all bifurcation points by Ishii and Richards [11]. Finally, we found an equivalence relation on the set of \(0\)-\(1\) sequences such that the changing rule is a shift invariant up to the equivalence relation. This generalizes Atela's works ([1], [2]), which dealt with the special case of the generalized rabbit polynomials.

This display is generated from NISO JATS XML with jats-html.xsl. The XSLT engine is libxslt.