By substantial changes and corrections in Demushkin’s old paper the essentially final positive answer to the isomorphism problem for monoid rings of submonoids of Z’ is obtained. This means that the underlying monoid is shown to be determined (up to isomorphism) by the corresponding monoid ring. Thereafter the positive answer to the analogous question for the ‘dual’ objects descrete Hodge algeb...

Cazaran and Kelarev [2] have given necessary and sufficient conditions for an ideal to be the principal; further they described all finite factor rings Zm[X1, · · · , Xn]/I, where I is an ideal generated by an univariate polynomial, which are commutative principal ideal rings. But in [3], Cazaran and Kelarev characterize the certain finite commutative rings as a principal ideal rings. Though, t...

The concept of algebraic simpliication is of great importance for the eld of symbolic computation in computer algebra. In this paper we review some fundamental concepts concerning reduction rings in the spirit of Buchberger. The most important properties of reduction rings are presented. The techniques for presenting monoids or groups by string rewriting systems are used to deene several types ...

In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gab...