Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal
DOI10.1016/0022-314X(92)90125-9zbMATH Open0765.13010MaRDI QIDQ1199983FDOQ1199983
Authors: Bruno Buchberger, J. Elias
Publication date: 17 January 1993
Published in: Journal of Number Theory (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3941661
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- The Structure of Polynomial Ideals and Gröbner Bases
- On computing uniform Gröbner bases for ideals generated by polynomials with parametric exponents
- scientific article; zbMATH DE number 3899033
- On generating sets and gröbner bases for polynomial ideals
- Using Gröbner bases for factoring polynomials over algebraic extension fields
- Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) (T)-ideals, identities, varieties of associative rings and algebras (16R10) Higher degree equations; Fermat's equation (11D41) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40)
Cites Work
- Title not available (Why is that?)
- Comments on the translation of my PhD thesis: ``An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- 1-dimensional Cohen-Macaulay rings
- On the analytic equivalence of curves
- Über die freien Auflösungen extremaler Cohen-Macaulay-Ringe
This page was built for publication: Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199983)