Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2408.01353 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Sommario:
- We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce sibling portraits, of which we provide a comprehensive counting theorem. We provide a characterization of which periodic polygons appear in invariant laminations. We introduce the pullback tree. The base of the pullback tree is a set of laminations, and we show that those laminations are proper and invariant, and all laminations in the base of the pullback tree correspond to a polynomial. We define the generational FDL graph, and it provides combinatorial information about polynomial parameter space.