TL;DR
This paper explores the complex roots of Littlewood polynomials, revealing intricate fractal patterns and their resemblance to dragon sets, highlighting the mathematical beauty and complexity of these polynomials.
Contribution
It discusses the visual complexity of Littlewood polynomial roots and presents a heuristic argument relating their patterns to fractal dragon sets, encouraging further rigorous investigation.
Findings
Roots form complex fractal patterns
Patterns resemble dragon sets from iterated function systems
Heuristic explanations suggest deep mathematical connections
Abstract
A "Littlewood polynomial" is a polynomial whose coefficients are all 1 or -1. The set of all complex roots of all Littlewood polynomials exhibits many complicated, beautiful and fascinating patterns. Some fractal regions of this set closely resemble "dragon sets" formed by iterated function systems. A heuristic argument for this is known, but no precise theorem along these lines has been proved. We invite the reader to try.
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 · Cellular Automata and Applications · Meromorphic and Entire Functions