2000 character limit reached
Dedekind semidomains
Published 16 Jul 2019 in math.RA and math.AC | (1907.07162v1)
Abstract: We define Dedekind semidomains as semirings in which each nonzero fractional ideal is invertible. Then we find some equivalent condition for semirings to being Dedekind. For example, we prove that a Noetherian semidomain is Dedekind if and only if it is multiplication. Then we show that a subtractive Noetherian semidomain is Dedekind if and only if it is a $\pi$-semiring and each of it nonzero prime ideal is invertible. We also show that the maximum number of the generators of each ideal of a subtractive Dedekind semidomain is 2.
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.