2405.02204
Pseudo-monodromy and the Mandelbrot set
Yutaka Ishii, Thomas Richards
correctmedium confidence
- Category
- math.DS
- Journal tier
- Specialist/Solid
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper’s Theorem 4.1 is clearly stated and proved via a careful return-time and lamination argument (using leaves, the sets Rn and Qn, Corollary 5.6, Proposition 5.7, and Proposition 5.9), yielding Π1(H) \ Ξ(H) ⊂ ⋃_{H′▷H}(TK(H′) ∪ T_{K̂(H′)⋆}) for any hyperbolic component H ≠ H♡ . The candidate solution asserts a much stronger direct classification of connected components of Π1(H) \ Ξ(H) into subwakes Π1(H′) and their adjacent intervals, and it invokes, without proof, that the endpoints of each component are exactly the characteristic angles of a unique (conspicuous) H′ and that adjacent pieces have initial blocks equal to K(H′). These steps require nontrivial orbit-portrait/landing and kneading-change facts (e.g., Theorem 2.1, Lemma on kneading change at periodic angles), which the model neither states nor justifies . Consequently, while the model reaches the correct inclusion, the proof is incomplete and relies on unproved claims. The paper’s proof is complete for the inclusion and deliberately avoids claiming equality (cf. Remark 5.8), underscoring where additional structure is conjectural .
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions \textbf{Journal Tier:} specialist/solid \textbf{Justification:} The manuscript proves a central inclusion (Theorem 4.1) that links pseudo-monodromy discontinuities to kneading sequences of conspicuous components, and provides a clear algorithmic corollary. The proof is rigorous and leverages orbit-portrait and lamination tools judiciously. Contextualization with prior work and the degenerate Hénon monodromy is helpful. Minor presentation enhancements could further streamline access for readers new to the coding/lamination interface.