PreprintCC BY 4.0arXiv
Quadratic Hubbard trees, automata, and ray connections
Abstract
We describe an algorithm that, given a postcritically finite quadratic polynomial, outputs a finite state machine whose regular language is the set of external arguments for all points on the Hubbard tree, generalizing an example of Milnor. We do this by extracting orbit portraits from angled internal addresses, and constructing a suitable Markov partition of angle intervals. A main application is computing direct ray connections between Hubbard trees in matings of quadratic polynomials. We use this to understand ray connections in quadratic matings along veins of the Mandelbrot set, and prove that first ray connections between Hubbard trees are picked up at parabolic parameters or tips of veins.
Related
- Permutation XOR cellular automata: partial-shift connections and half-primitive polynomials
- Finite-ring obstructions for quadratic binary radius-two cellular automata
- Connections Between Quadratic Transform for Fractional Programming and Schur Complement
- A quadratic ancestor inequality for spanning trees
- Gardens of Eden and amenability on cellular automata
BibTeX
@misc{sodre2026quadratic,
title = {{Quadratic Hubbard trees, automata, and ray connections}},
author = {Eduardo Ventilari Sodré},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.04190},
eprint = {2611.04190},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.04190},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Quadratic Hubbard trees, automata, and ray connections
AU - Eduardo Ventilari Sodré
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.04190
UR - https://arxiv.org/abs/2611.04190
AB - We describe an algorithm that, given a postcritically finite quadratic polynomial, outputs a finite state machine whose regular language is the set of external arguments for all points on the Hubbard tree, generalizing an example of Milnor. We do this by extracting orbit portraits from angled internal addresses, and constructing a suitable Markov partition of angle intervals. A main application is computing direct ray connections between Hubbard trees in matings of quadratic polynomials. We use this to understand ray connections in quadratic matings along veins of the Mandelbrot set, and prove that first ray connections between Hubbard trees are picked up at parabolic parameters or tips of veins.
ER -