Finite capture and the closure of roots of restricted polynomials
Bernat Espigule, David Juher

TL;DR
This paper investigates the roots of restricted polynomials and their connection to fractal connectedness loci, providing geometric constructions and finite-capture sets to characterize the roots outside the unit disk.
Contribution
It introduces a novel geometric framework for understanding roots of polynomials with restricted coefficients and establishes a precise relationship between these roots and finite-capture loci.
Findings
The non-real roots outside the unit disk form a fractal connectedness locus.
Finite-capture sets precisely describe the roots for large enough n.
Explicit trap geometry enables certified inverse search for roots.
Abstract
We study how a countable algebraic root set passes to a fractal connectedness locus. Let , and let be the set of roots of monic polynomials whose non-leading coefficients lie in . We study . Outside the closed unit disk this set equals a connectedness locus for a collinear affine iterated function system, or equivalently the zero set of reciprocal power series with . For non-real parameters in the lens we construct a canonical trap and enclosure for the associated difference attractor and use them to define finite-capture sets for the marked point . Our main result is the uniform inclusion…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Holomorphic and Operator Theory · Polynomial and algebraic computation
