2000 character limit reached
A "classification" of congruence primal arithmetical algebras
Published 25 Jun 2014 in math.LO, math.CT, and math.RA | (1406.6546v1)
Abstract: We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove that for a finite algebra, it has an irredundant non-refinable cover consists of primal algebras if and only if it is the both congruence primal and arithmetical. Finally, we obtain combinatorial description of congruence primal arithmetical algebras.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.