Primes of bad reduction for systems of polynomial equations
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 soon as does not divide a certain nonzero integer of height , with and bounds on respectively the degrees and heights of the 's.
Keywords
Cite
@article{arxiv.2603.02279,
title = {Primes of bad reduction for systems of polynomial equations},
author = {Jesse Elliott and Éric Schost},
journal= {arXiv preprint arXiv:2603.02279},
year = {2026}
}
Comments
Submitted to Journal of Symbolic Computation