Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleOn the computation of parametric Gr\"obner bases for modules and syzygies.
Author(s) Katsusuke Nabeshima
TypeArticle in Journal
AbstractThis paper presents algorithms to compute parametric Gröbner bases for modules and parametric syzygies. The theory of Gröbner basis is by far the most important tool for computations in commutative algebra and algebraic geometry. The theory of parametric Gröbner basis is also important to solve problems of ideals generated by parametric polynomials and submodule generated by parametric vectors. Several algorithms are known for computing parametric Gröbner bases in polynomial rings. However, nobody has studied the extension of parametric Gröbner bases to modules yet. In this paper we extend the theory of parametric Gröbner bases to modules, and we describe an algorithm for computing syzygies of parametric polynomials (vectors). These algorithms have been implemented in the computer algebra system Risa/Asir.
KeywordsGröbner bases, Comprehensive Syzygies, Modules
ISSN0916-7005; 1868-937X/e
URL http://link.springer.com/article/10.1007%2Fs13160-010-0003-z
LanguageEnglish
JournalJapan J. Ind. Appl. Math.
Volume27
Number2
Pages217--238
PublisherSpringer Japan, Tokyo
Year2010
Edition0
Translation No
Refereed No
Webmaster