Classification of finite rings: Theory and algorithm

Abstract

An interesting topic in the ring theory is the classification of finite rings. Although rings of certain orders have already been classified, a full description of all rings of a given order remains unknown. The purpose of this paper is to classify all finite rings (up to isomorphism) of a given order. In doing so, we introduce a new concept of quasi basis for certain type of modules, which is a useful computational tool for dealing with finite rings. Then, using this concept, we give structure and isomorphism theorems for finite rings and state our main result to classify (up to isomorphism) the finite rings of a given order. Finally, based on these results, we describe an algorithm to calculate the structure of all such rings. We have implemented our new algorithm in Maple, and we apply it to an example.