Algorithm speeds up algebra calculations using parallel computing

Schreyer Resolutions over the Exterior Algebra

Symbolic Computation

Summary

Calculating certain algebraic structures called free resolutions is important but can be slow. The authors adapted a known fast method, Schreyer's algorithm, to work for a different kind of algebra called the exterior algebra. They also explore ways to speed up the calculations by running parts in parallel on multiple processors. This helps compute properties connected to shapes and spaces studied in geometry.

What this means in practice

Authors

Janko Boehm, Lakshmi Ramesh

Abstract

Schreyer's algorithm is usually the fastest way to determine a (typically non-minimal) free resolution of a finitely presented module over a polynomial ring. We adapt a refined version of Schreyer's algorithm to compute free resolutions over the exterior algebra, relying on relative Groebner bases. We illustrate the use of our algorithm for the computation of cohomology of coherent sheaves over projective space, which by the BGG correspondence can be computed via free resolutions over the exterior algebra. Schreyer's method relies on a tree traversal and thus has the potential for parallel computations. We report on ongoing work on a massively parallel implementation, observing that Gnawali's parallel approach over polynomial rings can be carried over to our setting.