On Computation of Boolean Involutive Bases

Grobner bases in Boolean rings can be calculated by an involutive algorithm based on the Janet or Pommaret division. The Pommaret division allows calculations immediately in the Boolean ring, whereas the Janet division implies use of a polynomial ring over field F-2. In this paper, both divisions are considered, and distributive and recursive representations of Boolean polynomials are compared from the point of view of calculation effectiveness. Results of computer experiments with both representations for an algorithm based on the Pommaret division and for lexicographical monomial order are presented.