Primes of bad reduction for systems of polynomial equations
Jesse Elliott, \'Eric Schost

TL;DR
This paper investigates the reduction modulo primes of Chow forms associated with algebraic varieties defined by polynomial systems, identifying conditions under which these forms preserve their structure in characteristic p.
Contribution
It introduces criteria for when Chow forms of polynomial system solutions can be reduced modulo p without losing information, based on a specific integer that depends on the system's parameters.
Findings
Chow forms characterize equidimensional components of polynomial solution sets.
Reduction modulo p preserves Chow forms if p does not divide a certain integer .
The integer 's size depends polynomially on degrees, heights, and number of variables.
Abstract
Consider polynomials in over a field , their zero-set in and its decomposition into equidimensional components (with either empty or of dimension for all ). To each , we can associate its Chow forms, which are polynomials in new variables , uniquely defined up to a scalar factor. These Chow forms completely characterize : we can recover equations for from them, and their degree is times the degree of . We discuss the situation when the 's have integer coefficients, and study the question of when the Chow forms of the 's defined as above can be reduced modulo to give Chow forms of the equidimensional components of . We show that this is the case as…
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
TopicsAlgebraic Geometry and Number Theory · Advanced Differential Equations and Dynamical Systems · Polynomial and algebraic computation
