Albert is an interactive program to assist the specialist in the study of nonassociative algebra. The program was first designed and implemented at Clemson University about 1990 by D. Jacobs and S.V. Muddana, with assistance from A.J. Offutt, under an NSF grant. Enhancements have been made by K. Prabhu, D. Lee, and T. Whiteley. The main problem addressed by Albert is the recognition of polynomial identities in varieties of nonassociative algebras.

New! September, 2008. I have updated the code to compile under the latest gcc compiler found on most Unix and Linux computers.

Albert User's Guide (pdf)

CLICK HERE to obtain the program.

Some other related papers:

Rings with (a,b,c) = (a,c,b) and (a,[b,c],d) = 0: A Case Study Using Albert, I. Hentzel, D. Jacobs, and E. Kleinfeld, 1993.

The Albert Nonassociative Algebra System: A Progress Report, D.P. Jacobs, 1994.

A Condition Guaranteeing Commutativity, I.R. Hentzel and D. Pokrass Jacobs, 1992.

Experimenting with the Identity (xy)z = y(zx), I.R. Hentzel, D.P. Jacobs, S.V. Muddana, 1993.

A Computer Algebra System for Nonassociative Identities, D.P. Jacobs, S.V. Muddana, A.J. Offutt, 1990