Discrete Mathematics & Theoretical Computer Science, Vol 1 (1997)

Font Size:  Small  Medium  Large

BERGMAN under MS-DOS and Anick's resolution

S. Cojocaru, V. Ufnarovski


Noncommutative algebras, defined by the generators and relations, are considered. The definition and main results connected with the Gröbner basis, Hilbert series and Anick’s resolution are formulated. Most attention is paid to universal enveloping algebras. Four main examples illustrate the main concepts and ideas. Algorithmic problems arising in the calculation of the Hilbert series are investigated. The existence of finite state automata, defining thebehaviour of the Hilbert series, is discussed. The extensions of the BERGMAN package for IBM PC compatible computers are described. A table is provided permitting a comparison of the effectiveness of the calculations in BERGMAN with the other systems.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page