The Gröbner basis of the ideal of vanishing polynomials

From MaRDI portal
Publication:633084

DOI10.1016/J.JSC.2010.10.006zbMATH Open1210.13028arXiv0709.2978OpenAlexW2167183102MaRDI QIDQ633084FDOQ633084


Authors: Gert-Martin Greuel, Frank Seelisch, Oliver Wienand Edit this on Wikidata


Publication date: 31 March 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: We construct an explicit minimal strong Groebner 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 Groebner basis is independent of the monomial order and that the set of leading terms of the constructed Groebner 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 Groebner 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.


Full work available at URL: https://arxiv.org/abs/0709.2978




Recommendations




Cites Work


Cited In (25)

Uses Software





This page was built for publication: The Gröbner basis of the ideal of vanishing polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633084)