Ideals modulo a prime
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.
Cite
@article{arxiv.1801.06112,
title = {Ideals modulo a prime},
author = {John Abbott and Anna Maria Bigatti and Lorenzo Robbiano},
journal= {arXiv preprint arXiv:1801.06112},
year = {2019}
}
Comments
Improvements, and extended bibliography. To be published on "Journal of Algebra and Its Applications (JAA)"