Description:
Drensky and Lakatos (Lecture Notes in Computer Science, 357 (Springer, Berlin, 1989), pp. 181-188) have established a convenient property of certain ideals in polynomial quotient rings, which can now be used to determine error-correcting capabilities of combined multiple classifiers following a standard approach explained in the well-known monograph by Witten and Frank (Data Mining: Practical Machine Learning Tools and Techniques (Elsevier, Amsterdam, 2005)). We strengthen and generalise the result of Drensky and Lakatos by demonstrating that the corresponding nice property remains valid in a much larger variety of constructions and applies to more general types of ideals. Examples show that our theorems do not extend to larger classes of ring constructions and cannot be simplified or generalised.
Description:
Drensky and Lakatos (Lecture Notes in Computer Science, 357 (Springer, Berlin, 1989), pp. 181-188) have established a convenient property of certain ideals in polynomial quotient rings, which can now be used to determine error-correcting capabilities of combined multiple classifiers following a standard approach explained in the well-known monograph by Witten and Frank (Data Mining: Practical Machine Learning Tools and Techniques (Elsevier, Amsterdam, 2005)). We strengthen and generalise the result of Drensky and Lakatos by demonstrating that the corresponding nice property remains valid in a much larger variety of constructions and applies to more general types of ideals. Examples show that our theorems do not extend to larger classes of ring constructions and cannot be simplified or generalised.
Description:
Group automata occur in the Krohn-Rhodes Decomposition Theorem and have been extensively investigated in the literature. The incidence rings of group automata were introduced by the first author in analogy with group rings and incidence rings of graphs. The main theorem of the present paper gives a complete description of the structure of incidence rings of group automata in terms of matrix rings over group rings and their natural modules. As a consequence, when the ground ring is a field, we can use known group algebra results to determine when the incidence algebra is prime, semiprime, Artinian or semisimple. We also offer sufficient conditions for the algebra to be semiprimitive.
Description:
Group automata occur in the Krohn-Rhodes Decomposition Theorem and have been extensively investigated in the literature. The incidence rings of group automata were introduced by the first author in analogy with group rings and incidence rings of graphs. The main theorem of the present paper gives a complete description of the structure of incidence rings of group automata in terms of matrix rings over group rings and their natural modules. As a consequence, when the ground ring is a field, we can use known group algebra results to determine when the incidence algebra is prime, semiprime, Artinian or semisimple. We also offer sufficient conditions for the algebra to be semiprimitive.