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


TitleConstruction of Janet Bases I. Monomial Bases
Author(s) Yuri A. Blinkov, Vladimir P. Gerdt, Denis A. Yanovich
TypeArticle in Journal
AbstractAlgorithms for computation of Janet bases for monomial ideals and implementation of these algorithms are presented. As data structures for finite monomial sets the binary trees called Janet trees are selected. An algorithm for construction of a Janet basis for the ideal generated by a finite monomial set is described. This algorithm contains as subalgorithms those to search for Janet divisor in a given tree and to insert monomials into the tree in the process of completion to involu­tion. The algorithms presented have been implemented in C in the form of package for completion of monomial sets to Janet involutive ones. An example is given to illustrate practical effciency of the monomial algo­rithms and their implementation.
KeywordsJanet bases, monomial ideal, Janet trees, Janet divisor, involu­tion
URL http://invo.jinr.ru/papers.phtml
JournalComputer Algebra in Scientific Computing / CASC 2001
PublisherSpringer-Verlag, Berlin
EditorV.G.Ganzha, E.W.Mayr, E.V.Vorozhtsov
Translation No
Refereed No
Organization Saratov State University
Institution JINR (Joint Institute for Nuclear Research)