In this paper, the complexity of the conversion problem for Gröbner bases is investigated. It is shown that for adjacent Gröbner bases F and G, the maximal degree of the polynomials in G, denoted by deg(G), is bounded by a quadratic polynomial in deg(F ). For non-adjacent Gröbner bases, however, the
On the complexity of computing Gröbner bases in characteristic 2
✍ Scribed by Vincenzo Acciaro
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 200 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper reports our work on parallelizing an algorithm computing Gröbner bases on a distributed memory parallel machine. When computing Gröbner bases, the efficiency of computation is dominated by the total number of S-polynomials. To decrease the total number of S-polynomials it is necessary to
Let R be a Noetherian commutative ring with identity, K a field and π a ring homomorphism from R to K. We investigate for which ideals in R[x 1 , . . . , xn] and admissible orders the formation of leading monomial ideals commutes with the homomorphism π.
If K is a field, let the ring R consist of finite sums of homogeneous elements in Then, R contains M, the free semi-group on the countable set of variables {x 1 , x 2 , x 3 , . . .}. In this paper, we generalize the notion of admissible order from finitely generated sub-monoids of M to M itself; as
In this paper we propose to compute the maximal degree of the inverse of a cubic automorphism of the affine plane with Jacobian 1 via Gröbner Bases. This degree is equal to 9 and we give coefficients of the inverse.