INVBASE: A package for computing involutive bases
Date: 2020-10-07 18:10:00

Up | Next | Prev | PrevTail | Tail

### 16.33 INVBASE: A package for computing involutive bases

Involutive bases are a new tool for solving problems in connection with multivariate polynomials, such as solving systems of polynomial equations and analyzing polynomial ideals. An involutive basis of polynomial ideal is nothing but a special form of a redundant Gröbner basis. The construction of involutive bases reduces the problem of solving polynomial systems to simple linear algebra.

Authors: A.Yu. Zharkov and Yu.A. Blinkov.

#### 16.33.1 Introduction

Involutive bases are a new tool for solving problems in connection with multivariate polynomials, such as solving systems of polynomial equations and analyzing polynomial ideals, see [ZB96]. An involutive basis of polynomial ideal is nothing but a special form of a redundant Gröbner basis. The construction of involutive bases reduces the problem of solving polynomial systems to simple linear algebra.
The INVBASE package 29 calculates involutive bases of polynomial ideals using an algorithm described in [ZB96] which may be considered as an alternative to the well-known Buchberger algorithm [Buc85]. The package can be used over a variety of diﬀerent coeﬃcient domains, and for diﬀerent variable and term orderings.
The algorithm implemented in the INVBASE package is proved to be valid for any zero-dimensional ideal (ﬁnite number of solutions) as well as for positive-dimensional ideals in generic form. However, the algorithm does not terminate for “sparse” positive-dimensional systems. In order to stop the process we use the maximum degree bound for the Gröbner bases of generic ideals in the total-degree term ordering established in [Laz83]. In this case, it is reasonable to call the GROEBNER package with the answer of INVBASE as input information in order to compute the reduced Gröbner basis under the same variable and term ordering.
Though the INVBASE package supports computing involutive bases in any admissible term ordering, it is reasonable to compute them only for the total-degree term orderings. The package includes a special algorithm for conversion of total-degree involutive bases into the triangular bases in the lexicographical term ordering that is desirable for ﬁnding solutions. Normally the sum of timings for these two computations is much less than the timing for direct computation of the lexicographical involutive bases. As a rule, the result of the conversion algorithm is a reduced Gröbner basis in the lexicographical term ordering. However, because of some gaps in the current version of the algorithm, there may be rare situations when the resulting triangular set does not possess the formal property of Gröbner bases. Anyway, we recommend using the GROEBNER package with the result of the conversion algorithm as input in order either to check the Gröbner bases property or to transform the result into a lexicographical Gröbner basis.

#### 16.33.2 The Basic Operators

##### Term Ordering

The following term order modes are available:

These modes have the same meaning as for the GROEBNER package.
All orderings are based on an ordering among the variables. For each pair of variables an order relation > must be deﬁned, e.g. x > y. The term ordering mode as well as the order of variables are set by the operator
where < mode > is one of the term order modes listed above. The notion of {x1,...,xn} as a list of variables at the same time means x1 > ... > xn.

Example 1.

sets the reverse graduated term ordering based on the variable order x > y > z.
The operator INV TORDER may be omitted. The default term order mode is REV GRADLEX and the default decreasing variable order is alphabetical (or, more generally, the default REDUCE kernel order). Furthermore, the list of variables in the INV TORDER may be omitted. In this case the default variable order is used.

##### Computing Involutive Bases

To compute the involutive basis of ideal generated by the set of polynomials {p1,...,pm} one should type the command

where pi are polynomials in variables listed in the INV TORDER operator. If some kernels in pi were not listed previously in the INV TORDER operator they are considered as parameters, i.e. they are considered part of the coeﬃcients of polynomials. If INV TORDER was omitted, all the kernels in pi are considered as variables with the default REDUCE kernel order.
The coeﬃcients of polynomials pi may be integers as well as rational numbers (or, accordingly, polynomials and rational functions in the parametric case). The computations modulo prime numbers are also available. For this purpose one should type the REDUCE commands
where p is a prime number.
The value of the INV BASE function is a list of integer polynomials {g1,...,gn} representing an involutive basis of a given ideal.
Example 2.
The resulting involutive basis in the reverse graduate ordering is
To convert it into a lexicographical Gröbner basis one should type
The result is
In the case of “sparse” positive-dimensioned system when the involutive basis in the sense of [ZB96] does not exist, you get the error message
The resulting list of polynomials which is not an involutive basis is stored in the share variable INVTEMPBASIS. In this case it is reasonable to call the GROEBNER package with the value of INVTEMPBASIS as input under the same variable and term ordering.

Up | Next | Prev | PrevTail | Front