Topology of zero sets of polynomials with square discriminant
David Hokken

TL;DR
This paper shows that the set of zeros of polynomials with coefficients in a certain integer set is topologically similar whether or not the discriminant is a perfect square, highlighting a surprising insensitivity in their zero set topology.
Contribution
It proves that zeros of polynomials with coefficients in a fixed set can be approximated by zeros of polynomials with square discriminant, revealing topological invariance.
Findings
Zeros can be approximated arbitrarily closely by polynomials with square discriminant.
The topology of zero sets is unaffected by the discriminant being a square.
The result contrasts with the behavior of Galois groups of the polynomials.
Abstract
Let be a fixed set of integers, closed under multiplication, closed under negation, or containing . We prove that any zero of a polynomial in whose coefficients lie in can be approximated in to arbitrary precision by a zero of a polynomial in with square discriminant whose coefficients also lie in . Hence the topology of the closure in of the set of zeros of all such polynomials is insensitive to the discriminant being a square, in contrast to the Galois groups of the polynomials.
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
TopicsFunctional Equations Stability Results · Mathematical Dynamics and Fractals · Advanced Differential Equations and Dynamical Systems
