Characterization of finite Frobenius rings

By T. Honold. 2001

130 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/c3acf69cdb2fe1d94a9e735d7b04add92a425861

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. A. Nechaev
2. Jay A. Wood
3. Robert Wisbauer

In Artificial Intelligence

1. A. Nechaev
2. Jay A. Wood
3. Robert Wisbauer

Citations in the corpus

• FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES (2004, background): “It has been shown in [11] that if the left socle of a finite ring is a left principal ideal then it is also a right principal ideal and coincides with the right-socle, moreover we have from [11]:”
• Code equivalence characterizes finite Frobenius rings (2007, background): “Honold [7] showed that, for finite rings, being Frobenius is equivalent to R/Rad(R) ∼= Soc(R) either as left R-modules or as right R-modules.”