We construct an explicit minimal strong Grobner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Grobner basis is independent of the monomial order and that the set of leading terms of the constructed Grobner basis is unique, up to multiplication by units. We also present a fast algorithm to compute reduced normal forms, and furthermore, we give a recursive algorithm for building a Grobner basis in Z/m[x"1,x"2,...,x"n] along the prime factorization of m. The obtained results are not only of mathematical interest but have immediate applications in formal verification of data paths for microelectronic systems-on-chip.
['Gert-Martin Greuel', 'Frank Seelisch', 'Oliver Wienand']
The Gröbner basis of the ideal of vanishing polynomials