RECORD
Accessibility of the Boundary of the Thurston Set
Dynamical Systems · Submitted 29 Dec 2019
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Exploiting the asymptotic similarity of $\mathcal{M}$ and $\mathcal{M}_0$ with the respective associated attractors, we give sufficient conditions on $\lambda\in\partial\mathcal{M}$ or $\partial\mathcal{M}_0$ to guarantee it is path accessible from the complement $\mathbb{D}\setminus\mathcal{M}$.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Consider two objects associated to the Iterated Function System (IFS) $\{1+\lambda z,-1+\lambda z\}$: the locus $\mathcal{M}$ of parameters $\lambda\in\mathbb{D}\setminus\{0\}$ for which the corresponding attractor is connected; and the locus $\mathcal{M}_0$ of parameters for which the related attractor contains $0$. The set $\mathcal{M}$ can also be characterized as the locus of parameters for which the attractor of the IFS $\{1+\lambda z, \lambda z, -1+\lambda z\}$ contains $\lambda^{-1}$. Exploiting the asymptotic similarity of $\mathcal{M}$ and $\mathcal{M}_0$ with the respective associated attractors, we give sufficient conditions on $\lambda\in\partial\mathcal{M}$ or $\partial\mathcal{M}_0$ to guarantee it is path accessible from the complement $\mathbb{D}\setminus\mathcal{M}$.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Consider two objects associated to the Iterated Function System (IFS) $\{1+\lambda z,-1+\lambda z\}$: the locus $\mathcal{M}$ of parameters $\lambda\in\mathbb{D}\setminus\{0\}$ for which the corresponding attractor is connected; and the locus $\mathcal{M}_0$ of parameters for which the related attractor contains $0$. | background 0.93 | 0.18 | 0.03 | asserted 0.71 |
| s1 | The set $\mathcal{M}$ can also be characterized as the locus of parameters for which the attractor of the IFS $\{1+\lambda z, \lambda z, -1+\lambda z\}$ contains $\lambda^{-1}$. | result 0.54 | 0.48 | 0.06 | asserted 0.99 |
| s2 | Exploiting the asymptotic similarity of $\mathcal{M}$ and $\mathcal{M}_0$ with the respective associated attractors, we give sufficient conditions on $\lambda\in\partial\mathcal{M}$ or $\partial\mathcal{M}_0$ to guarantee it is path accessible from the complement $\mathbb{D}\setminus\mathcal{M}$. | contribution 0.56 | 0.94 | 0.78 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Consider two objects associated to the Iterated Function System (IFS) $\{1+\lambda z,-1+\lambda z\}$: the locus $\mathcal{M}$ of parameters $\lambda\in\mathbb{D}\setminus\{0\}$ for which the corresponding attractor is connected; and the locus $\mathcal{M}_0$ of parameters for which the related attractor contains $0$. The set $\mathcal{M}$ can also be characterized as the locus of parameters for which the attractor of the IFS $\{1+\lambda z, \lambda z, -1+\lambda z\}$ contains $\lambda^{-1}$. Exploiting the asymptotic similarity of $\mathcal{M}$ and $\mathcal{M}_0$ with the respective associated attractors, we give sufficient conditions on $\lambda\in\partial\mathcal{M}$ or $\partial\mathcal{M}_0$ to guarantee it is path accessible from the complement $\mathbb{D}\setminus\mathcal{M}$.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.