Comprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992. Since then the construction has been implemented in the computer algebra systems ALDES/SAC-2, MAS, REDUCE and MAPLE. A comprehensive Gröbner basis is a finite subset G of a p
An alternative approach to comprehensive Gröbner bases
✍ Scribed by Akira Suzuki; Yosuke Sato
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 202 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Recently, Zharkov and Blinkov introduced the notion of involutive bases of polynomial ideals. This involutive approach has its origin in the theory of partial differential equations and is a translation of results of Janet and Pommaret. In this paper we present a pure algebraic foundation of involut
We develop a theory of Gröbner bases over Galois rings, following the usual formulation for Gröbner bases over finite fields. Our treatment includes a division algorithm, a characterization of Gröbner bases, and an extension of Buchberger's algorithm. One application is towards the problem of decodi
Using a constructive field-ideal correspondence it is shown how to compute the transcendence degree and a (separating) transcendence basis of finitely generated field extensions k( x)/k( g), resp. how to determine the (separable) degree if k( x)/k( g) is algebraic. Moreover, this correspondence is u