Construction of Involutive Monomial Sets for Different Involutive Divisions

Vladimir P. Gerdt (), Vladimir V. Kornyak, Matthias Berth () and Günter Czichowski
Additional contact information
Vladimir P. Gerdt: Joint Institute for Nuclear Research, Laboratory of Computing Techniques and Automation
Vladimir V. Kornyak: Joint Institute for Nuclear Research, Laboratory of Computing Techniques and Automation
Matthias Berth: University of Greifswald, Department of Mathematics and Informatics
Günter Czichowski: University of Greifswald, Department of Mathematics and Informatics

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 147-157 from Springer

Abstract: Abstract We consider computational and implementation issues for the completion of monomial sets to involution using different involutive divisions. Every of these divisions produces its own completion procedure. For the polynomial case it yields an involutive basis which is a special form of a Gröbner basis, generally redundant. We also compare our Mathematica implementation of Janet division to an implementation in C.

Keywords: Hilbert Function; Monomial Ideal; Hilbert Polynomial; Completion Procedure; Involutive Basis (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-60218-4_11

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().