How many zeroes? Counting the number of solutions of systems of polynomials via geometry at infinity (Draft III)
Pinaki Mondal

TL;DR
This paper presents a comprehensive approach using toric geometry to estimate the number of solutions of polynomial systems over algebraically closed fields, extending classical results from the torus to affine space.
Contribution
It provides a complete proof of Bernstein's theorem and its recent extension to affine space, along with applications to Milnor numbers of hypersurface singularities.
Findings
Extended Bernstein's theorem to affine space
Derived explicit formulas for solution counts
Connected solution counting to Newton polytopes and mixed volumes
Abstract
In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed field k." The outcome of this approach is the number of solutions for "generic" systems in terms of their "Newton polytopes," and an explicit characterization of what makes a system "generic." The pioneering work in this field was done in the 1970s by Kushnirenko, Bernstein and Khovanskii, who completely solved the problem of counting solutions of generic systems on the "torus" (k\0)^n. In the context of our problem, however, the natural domain of solutions is not the torus, but the affine space k^n. There were a number of works on extension of Bernstein's theorem to the case of affine space, and recently it has been completely resolved, the final…
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.
