Hilbert Functions and the Buchberger Algorithm
| Autor: | Carlo Traverso |
|---|---|
| Rok vydání: | 1996 |
| Předmět: |
Discrete mathematics
Algebra and Number Theory Ideal (set theory) Mathematics::Commutative Algebra Series (mathematics) Computation Tangent cone Complete intersection Algebra Computational Mathematics Gröbner basis ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Buchberger's algorithm Parametric equation Mathematics |
| Zdroj: | Journal of Symbolic Computation. 22:355-376 |
| ISSN: | 0747-7171 |
| Popis: | In this paper we show how to use the knowledge of the Hilbert–Poincare series of an idealIto speed up the Buchberger algorithm for the computation of a Grobner basis. The algorithm is useful in the change of ordering and in the validation of modular computations, also with tangent cone orderings; speeds the direct computation of a Grobner basis if the ideal is a complete intersection, e.g. in the computation of cartesian from parametric equations, can validate or disprove a conjecture that an ideal is a complete intersection, and is marginally useful also when the conjecture is false. A large set of experiments is reported. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect