The Gröbner basis of the ideal of vanishing polynomials
From MaRDI portal
(Redirected from Publication:633084)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3737737 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- A generalization of the Smarandache function to several variables
- An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
- Functions and polynomials ($mod p^n$)
- On polynomial functions (mod m)
- Powers and polynomials in \(\mathbb{Z}_m\)
Cited in
(25)- Gröbner basis of the ideal of focus quantities of the Kukles cubic system
- scientific article; zbMATH DE number 12003 (Why is no real title available?)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Dimension-dependent bounds for Gröbner bases of polynomial ideals
- Vector space bases associated to vanishing ideals of points
- Degree bounds for Gröbner bases of low-dimensional polynomial ideals
- The vanishing ideal of a finite set of points with multiplicity structures
- An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
- Polynomial ideals for sandpiles and their Gröbner bases
- Verification of Gröbner basis candidates
- On generating sets and gröbner bases for polynomial ideals
- Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases
- Basicity of a portion of a root system of a polynomial bundle
- Basicity of a portion of a root system of a polynomial bundle
- Über Basen nulldimensionaler Polynomideale. (On bases of zero dimensional polynomial ideals)
- New developments in the theory of Gröbner bases and applications to formal verification
- Polynomials that Vanish on Distinct n th Roots of Unity
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
- Vanishing ideals over odd cycles
- Groebner bases of the ideal of a space curve
- An algorithm for primary decomposition in polynomial rings over the integers
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
- The Structure of Polynomial Ideals and Gröbner Bases
- An extension of Gröbner basis theory to indexed polynomials without eliminations
- Some meeting points of Gröbner bases and combinatorics
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)
