Type of Document Dissertation Author Struble, Craig Andrew URN etd-04282000-13520019 Title Analysis and Implementation of Algorithms for Noncommutative Algebra Degree PhD Department Computer Science Advisory Committee

Advisor Name Title Green, Edward L. Committee Co-Chair Heath, Lenwood S. Committee Co-Chair Allison, Donald C. S. Committee Member Farkas, Daniel R. Committee Member Gupta, Sanjay Committee Member Keywords

- computer algebra
Date of Defense 2000-04-24 Availability unrestricted AbstractA fundamental task of algebraists is to classify algebraic structures. For example, the classification of finite groups has been widely studied and has benefited from the use of computational tools. Advances in computer power have allowed researchers to attack problems never possible before.

In this dissertation, algorithms for

noncommutativealgebra, whenabis not necessarily equal toba, are examined with practical implementations in mind. Different encodings ofassociative algebrasandmodulesare also considered. To effectively analyze these algorithms and encodings, theencoding neutralanalysis framework is introduced. This framework builds on the ideas used in the arithmetic complexity framework defined by Winograd. Results in this dissertation fall into three categories: analysis of algorithms, experimental results, and novel algorithms.Known algorithms for calculating the Jacobson radical and Wedderburn decomposition of associative algebras are reviewed and analyzed. The algorithms are compared experimentally and a recommendation for algorithms to use in computer algebra systems is given based on the results.

A new algorithm for constructing the Drinfel'd double of finite dimensional Hopf algebras is presented. The performance of the algorithm is analyzed and experiments are performed to demonstrate its practicality. The performance of the algorithm is elaborated upon for the special case of group algebras and shown to be very efficient.

The

MeatAxealgorithm for determining whether a module contains a proper submodule is reviewed. Implementation issues for theMeatAxein an encoding neutral environment are discussed. A new algorithm for constructing endomorphism rings of modules defined over path algebras is presented. This algorithm is shown to have better performance than previously used algorithms.Finally, a linear time algorithm, to determine whether a quotient of a path algebra, with a known Gröbner basis, is finite or infinite dimensional is described. This algorithm is based on the Aho-Corasick pattern matching automata. The resulting automata is used to efficiently determine the dimension of the algebra, enumerate a basis for the algebra, and reduce elements to normal forms.

Files

Filename Size Approximate Download Time (Hours:Minutes:Seconds)

28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access dissertation.pdf1.42 Mb 00:06:33 00:03:22 00:02:57 00:01:28 00:00:07

Browse All Available ETDs by
( Author |
Department )

If you have questions or technical problems, please Contact DLA.