Title  Construction of Janet Bases I. Monomial Bases 
Author(s)  Yuri A. Blinkov, Vladimir P. Gerdt, Denis A. Yanovich 
Type  Article in Journal 
Abstract  Algorithms 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 involution. 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 algorithms and their implementation. 
Keywords  Janet bases, monomial ideal, Janet trees, Janet divisor, involution 
Length  15 
File 

URL 
http://invo.jinr.ru/papers.phtml 
Language  English 
Journal  Computer Algebra in Scientific Computing / CASC 2001 
Pages  233247 
Publisher  SpringerVerlag, Berlin 
Year  2001 
Editor  V.G.Ganzha, E.W.Mayr, E.V.Vorozhtsov 
Edition  0 
Translation 
No 
Refereed 
No 
Organization 
Saratov State University 
Institution 
JINR (Joint Institute for Nuclear Research) 