Skip to main content
SpringerLink
Log in

BIBasis, a package for reduce and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

In this paper, we describe the BIBasis package designed for REDUCE and Macaulay2 computer algebra systems, which allows one to compute Boolean involutive bases and Gröbner bases. The implementations and user interfaces of the package for both systems are described in the respective sections of the paper. Also, we present results of comparisons of BIBasis with other packages and algorithms for constructing Boolean Gröbner bases available in the computer algebra systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gerdt, V.P. and Blinkov, Yu.A., Involutive Bases of Polynomial Ideals, Math. Comput. in Simulation, 1998, vol. 45, pp. 519–542; Minimal Involutive Bases, pp. 543–560.

    Article  MathSciNet  MATH  Google Scholar 

  2. Seiler, W.M., Involution: The Formal Theory of Differential Equations and its Applications in Computer Algebra. Algorithms and Computation in Mathematics, vol. 24, Springer, 2010. arXiv:math.AC/0501111

  3. Gerdt, V.P., Involutive Algorithms for Computing Gröbner Bases, in Computational Commutative and Non-Commutative Algebraic Geometry, Amsterdam: IOS, 2005, pp. 199–225.

    Google Scholar 

  4. Faugère, J.-C. and Joux, A., Algebraic Cryptanalysis of Hidden Field Equations (HFE) Using Gröbner Bases, Lecture Notes in Computer Science, vol. 2729, Springer, 2003, pp. 44–60.

    Article  Google Scholar 

  5. Brickenstein, M., Dreyer, A., Greuel, G.-M., and Wienand, O., New Developments in the Theory of Gröbner Bases and Applications to Formal Verification, J. Pure Appl. Algebra, 2009, vol. 213, pp. 1612–1635. arXiv:math.AC/0801.1177

    Article  MathSciNet  MATH  Google Scholar 

  6. Gerdt, V.P. and Zinin, M.V., A Pommaret Division Algorithm for Computing Gröbner Bases in Boolean Rings, Proc. of the ISSAC 2008, ACM, 2008, pp. 95–102.

  7. Gerdt, V.P. and Zinin, M.V., Involutive Method for Computing Gröbner Bases over F 2, Programming Comput. Software, 2008, vol. 34, no. 4, pp. 191–203.

    Article  MathSciNet  MATH  Google Scholar 

  8. Gerdt, V.P., Zinin, M.V., and Blinkov, Yu.A., On Computation of Boolean Involutive Bases, Programming Comput. Software, 2010, vol. 36, no. 2, pp. 117–128.

    Article  MathSciNet  MATH  Google Scholar 

  9. Hearn, A.., REDUCE, a Portable General-Purpose Computer Algebra System. http://www.reduce-algebra.com/. 2009.

  10. Grayson, D.R. and Stillman, M.E., Macaulay2, a Software System for Research in Algebraic Geometry. http://www.math.uiuc.edu/Macaulay2. 2011.

  11. Bardet, M., Faugère, J.-C., and Salvy, B., Complexity of Gröbner Basis Computation for Semi-Regular Overdetermined Sequences over \(\mathbb{F}_2 \) with Solutions in \(\mathbb{F}_2 \), INRIA Rep. RR-5049, 2003.

  12. Becker, T., Weispfenning, V., and Kredel, H., Gröbner Bases. A Computational Approach to Commutative Algebra, Graduate Texts in Mathematics, vol. 141, New York: Springer, 1993.

    Google Scholar 

  13. Neun, W., Portable Standard Lisp. http://www2.zib.de/Symbolik/reduce/. 1999.

  14. Codemist Standard LISP. http://www.codemist.co.uk. 2002.

  15. https://reduce-algebra.svn.sourceforge.net/svnroot/reduce-algebra/trunk

  16. Eisenbud, D., Grayson, D.R., Stillman, M.E., and Sturmfels B., Computations in Algebraic Geometry with Macaulay2, in Algorithms and Computations in Mathematics, vol. 8, Berlin: Springer, 2002. http://www.math.uiuc.edu/Macaulay2/Book/

    Google Scholar 

  17. svn://svn.macaulay2.com/Macaulay2/trunk/M2/

  18. Bini, D. and Mourrain, B., Polynomial Test Suite, 2006. http://www-sop.inria.fr/saga/POL. 2006; Verschelde, J., The Database of Polynomial Systems. http://www.math.uic.edu/~jan/demo.html. 2011.

  19. Kornyak, V.V., On Compatibility of Discrete Relations, Lecture Notes in Computer Science, vol. 3718, Springer, 2005, pp. 272–284. http://arxiv.org/abs/math-ph/0504048

    Article  MathSciNet  Google Scholar 

  20. Hoos, H.H. and Stutzle, T., SATLIB: An Online Resource for Research on SAT, in SAT 2000, Gent, I.P., Maaren, H.v., and Walsh, T., Eds., IOS Press, 2000, pp. 283–292. http://www.satlib.org

  21. Hinkelmann, F. and Arnold, E., Fast Gröbner Basis Computation for Boolean Polynomials. http://arxiv.org/abs/1010.2669v1

Download references

Author information

Authors and Affiliations

  1. Joint Institute for Nuclear Research, ul. Joliot-Curie 6, Dubna, Moscow oblast, 141980, Russia

    M. V. Zinin

Authors
  1. M. V. Zinin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. V. Zinin.

Additional information

Original Russian Text © M.V. Zinin, 2012, published in Programmirovanie, 2012, Vol. 38, No. 2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zinin, M.V. BIBasis, a package for reduce and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases. Program Comput Soft 38, 92–101 (2012). https://doi.org/10.1134/S0361768812020077

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768812020077

Keywords

Search

Navigation