Finite capture and the closure of roots of restricted polynomials
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910045119184896 |
|---|---|
| author | Espigule, Bernat Juher, David |
| author_facet | Espigule, Bernat Juher, David |
| contents | We study how a countable algebraic root set passes to a fractal connectedness locus. Let $D_n=\{-n+1,-n+2,\ldots,n-1\}$, and let $R_n$ be the set of roots of monic polynomials whose non-leading coefficients lie in $D_n$. We study $\overline{R_n}\setminus\overline{\mathbb{D}}$. Outside the closed unit disk this set equals a connectedness locus $M_n$ for a collinear affine iterated function system, or equivalently the zero set of reciprocal power series $1+\sum_{k\ge1} d_k c^{-k}$ with $d_k\in D_n$. For non-real parameters in the lens $X_n=\{\,c\in\mathbb{C}\setminus\overline{\mathbb{D}}:\ |c\pm1|<\sqrt{2n}\,\}$ we construct a canonical trap and enclosure for the associated difference attractor and use them to define finite-capture sets $Θ_k(n)$ for the marked point $2c$. Our main result is the uniform inclusion $\overline{Θ_k(n)}\cap(X_n\setminus\mathbb{R})\subsetΘ_{k+2}(n)$ for every $k\ge0$. Consequently, $(M_n\cap X_n)\setminus\mathbb{R}$ is exactly the closure of the finite-capture locus. The paper combines explicit trap geometry with certified inverse search. Moreover, $M_n\setminus\mathbb{R}\subset X_n$ for every $n\ge20$, and this is sharp for $2\le n\le19$. Thus, for $n\ge20$, the non-real part of $\overline{R_n}\setminus\overline{\mathbb{D}}$ is exactly the closure of the finite-capture locus. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_07397 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Finite capture and the closure of roots of restricted polynomials Espigule, Bernat Juher, David Dynamical Systems Complex Variables Number Theory 37F20, 28A80, 37M25, 65G20 We study how a countable algebraic root set passes to a fractal connectedness locus. Let $D_n=\{-n+1,-n+2,\ldots,n-1\}$, and let $R_n$ be the set of roots of monic polynomials whose non-leading coefficients lie in $D_n$. We study $\overline{R_n}\setminus\overline{\mathbb{D}}$. Outside the closed unit disk this set equals a connectedness locus $M_n$ for a collinear affine iterated function system, or equivalently the zero set of reciprocal power series $1+\sum_{k\ge1} d_k c^{-k}$ with $d_k\in D_n$. For non-real parameters in the lens $X_n=\{\,c\in\mathbb{C}\setminus\overline{\mathbb{D}}:\ |c\pm1|<\sqrt{2n}\,\}$ we construct a canonical trap and enclosure for the associated difference attractor and use them to define finite-capture sets $Θ_k(n)$ for the marked point $2c$. Our main result is the uniform inclusion $\overline{Θ_k(n)}\cap(X_n\setminus\mathbb{R})\subsetΘ_{k+2}(n)$ for every $k\ge0$. Consequently, $(M_n\cap X_n)\setminus\mathbb{R}$ is exactly the closure of the finite-capture locus. The paper combines explicit trap geometry with certified inverse search. Moreover, $M_n\setminus\mathbb{R}\subset X_n$ for every $n\ge20$, and this is sharp for $2\le n\le19$. Thus, for $n\ge20$, the non-real part of $\overline{R_n}\setminus\overline{\mathbb{D}}$ is exactly the closure of the finite-capture locus. |
| title | Finite capture and the closure of roots of restricted polynomials |
| topic | Dynamical Systems Complex Variables Number Theory 37F20, 28A80, 37M25, 65G20 |
| url | https://arxiv.org/abs/2603.07397 |