Ideals modulo a prime
John Abbott, Anna Maria Bigatti, Lorenzo Robbiano

TL;DR
This paper introduces a new framework for understanding how polynomial ideals over rationals relate to their reductions modulo primes, including a novel notion of good primes and an invariant called the universal denominator.
Contribution
It defines a new concept of -good primes , independent of generators, and introduces the universal denominator invariant to identify primes suitable for modular methods.
Findings
Most primes are good for a given ideal.
The universal denominator helps detect bad primes.
The approach simplifies modular computations in polynomial ideal theory.
Abstract
The main focus of this paper is on the problem of relating an ideal in the polynomial ring to a corresponding ideal in where is a prime number; in other words, the \textit{reduction modulo } of . We first define a new notion of -good prime for which does depends on the term ordering , but not on the given generators of . We relate our notion of -good primes to some other similar notions already in the literature. Then we introduce and describe a new invariant called the universal denominator which frees our definition of reduction modulo~ from the term ordering, thus letting us show that all but finitely many primes are good for . One characteristic of our approach is that it enables us to easily detect some bad primes, a distinct advantage when using modular methods.
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.
