CoCoA

Computations in commutative algebra

CoCoA is a freely available system for computing with multivariate polynomials.

More specifically, CoCoA deals with computations in multivariate polynomial rings over the rationals or modular integers, and on their ideals and modules. The implementation of the ideal/module theoretic operations relies on Gröbner basis theory.

One of CoCoA's most important features is its high-level programming language which allows the user to write his own functions and to guide the system through complicated and involved computations. This language has been designed to be natural and intuitive, so it is easy to learn and is well suited to teaching. The language is interpreted; its syntax is Pascal-like.

The main users of CoCoA are researchers in Commutative Algebra and Algebraic Geometry together with their students. However, computational algebraic techniques are spreading to other fields (for instance numerical analysis, cryptography, statistics, and dynamical systems), and consequently so is the realm of application of CoCoA.

Tags: algebra, commutative algebra, computer algebra system.

Interfaces: command line, X.

Source language: C.

Staff

Maintainer: Lorenzo Robbiano.

Developers: John Abbott, Anna M. Bigatti, Massimo Caboara.

Contributors: Alessandro Giovini, Gianfranco Niesi, Antonio Capani, Dave Perkinson, Alessandro Polverini, Volker Augustin, Arndt Wills.

Links

Homepage: http://cocoa.dima.unige.it/.

Documentation: http://cocoa.dima.unige.it/download/doc/.