Three Remarks on Comprehensive Gröbner and SAGBI Bases

Manfred G-bel () and Patrick Maier ()
Additional contact information
Manfred G-bel: University of Essex, Department of Electronic Systems Engineering
Patrick Maier: Max-Planck-Institut für 1nformatik

A chapter in Computer Algebra in Scientific Computing, 2000, pp 191-202 from Springer

Abstract: Abstract This note presents new complexity results for the comprehensive Gröbner bases (CGB) algorithm in the special case of one main variable and two polynomials, a general remark about CGB for parameterized binomial ideals, and it introduces the concept of comprehensive SAGBI bases together with a first application in invariant theory. Keywords. Comprehensive Gröbner bases, parameterized binomial ideals, comprehensive SAGBI bases, algorithmic invariant theory, permutation groups.

Keywords: Symmetric Group; Minimal Degree; Permutation Group; Reduction Step; Symbolic Computation (search for similar items in EconPapers)
Date: 2000
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-57201-2_16

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

DOI: 10.1007/978-3-642-57201-2_16

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 ().