IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-56666-0_18.html
   My bibliography  Save this book chapter

Construction of Janet Bases I. Monomial Bases

In: Computer Algebra in Scientific Computing CASC 2001

Author

Listed:
  • Vladimir P. Gerdt

    (Joint Institute for Nuclear Research, Laboratory of Information Technologies)

  • Yuri A. Blinkov

    (Saratov University, Department of Mathematics and Mechanics)

  • Denis A. Yanovich

    (Joint Institute for Nuclear Research, Laboratory of Information Technologies)

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 efficiency of the monomial algorithms and their implementation.

Suggested Citation

  • Vladimir P. Gerdt & Yuri A. Blinkov & Denis A. Yanovich, 2001. "Construction of Janet Bases I. Monomial Bases," Springer Books, in: Victor G. Ganzha & Ernst W. Mayr & Evgenii V. Vorozhtsov (ed.), Computer Algebra in Scientific Computing CASC 2001, pages 233-247, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-56666-0_18
    DOI: 10.1007/978-3-642-56666-0_18
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-56666-0_18. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.