BIBasis -- Involutive Pommaret basis in a Boolean ring

Description

BIBasis is the package which implements the methods for constructing the reduced Pommaret and Gr\"obner bases in a Boolean ring for a given polynomial Ideal.

Some references:

V. P. Gerdt and M. V. Zinin, Involutive Method for Computing Gr\"obner Bases over F_2. Programming and Computer Software, Vol. 34, No. 4, 2008, 191-203.
V.P.Gerdt and M.V.Zinin. A Pommaret Division Algorithm for Computing Gr\"obner Bases in Boolean Rings. Proceedings of ISSAC 2008, ACM Press, 2008, pp.95–102.
Vladimir Gerdt, Mikhail Zinin and Yuri Blinkov. On computation of Boolean involutive bases. Programming and Computer Software, Vol. 36, No. 2, 2010, 117-123.

Author

Mikhail Zinin <[email protected]>

Version

This documentation describes version 0.6.3 of BIBasis.

Citation

If you have used this package in your research, please cite it as follows:

@misc{BIBasisSource,
  title = {{BIBasis: involutive Pommaret basis in a Boolean ring. Version~0.6.3}},
  author = {Mikhail Zinin},
  howpublished = {A \emph{Macaulay2} package available at
    \url{https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages}}
}

Exports

Functions and commands
- biBasis -- constructs a reduced Boolean Gröbner basis for the given Ideal, if the second argument is true (default), and reduced Boolean Pommaret basis otherwise.
Methods
- biBasis(Ideal) -- see biBasis -- constructs a reduced Boolean Gröbner basis for the given Ideal, if the second argument is true (default), and reduced Boolean Pommaret basis otherwise.
Symbols
- toGroebner (missing documentation)

For the programmer

The object BIBasis is a package, defined in BIBasis.m2.

The source of this document is in BIBasis.m2:57:0.