2000 character limit reached
Congruence-simple multiplicatively idempotent semirings
Published 17 Jul 2022 in math.RA | (2207.08160v1)
Abstract: Let $S$ be a multiplicatively idempotent congruence-simple semiring. We show that $|S|=2$ if $S$ has a multiplicatively absorbing element. We also prove that if $S$ is finite then either $|S|=2$ or $S\cong End(L)$ or $S{op}\cong End(L)$ where $L$ is a 2-element semilattice. It seems to be an open question, whether $S$ can be infinite at all.
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.