Elementary analysis of isolated zeroes of a polynomial system
Mitali Bafna, Madhu Sudan, Santhoshini Velusamy, David Xiang

TL;DR
This paper extends Wooley's elementary proof of a Bezout-like theorem to bound the number of isolated roots of polynomial systems over arbitrary fields and modulo powers of a variable, generalizing previous results.
Contribution
It adapts Wooley's proof to polynomials over polynomial rings, providing bounds on isolated roots modulo t^s for any positive integer s.
Findings
Bound on isolated roots modulo t^s for polynomial systems
Extension of Wooley's theorem to arbitrary fields
Application to systems over arbitrary fields
Abstract
Wooley ({\em J. Number Theory}, 1996) gave an elementary proof of a Bezout like theorem allowing one to count the number of isolated integer roots of a system of polynomial equations modulo some prime power. In this article, we adapt the proof to a slightly different setting. Specifically, we consider polynomials with coefficients from a polynomial ring for an arbitrary field and give an upper bound on the number of isolated roots modulo for an arbitrary positive integer . In particular, using , we can bound the number of isolated roots of a system of polynomials over an arbitrary field .
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
TopicsAnalytic Number Theory Research · Advanced Differential Equations and Dynamical Systems · Algebraic Geometry and Number Theory
