On the arithmetic of polynomial semidomains (Q6073697)

A \textit{semidomain} \(S\) is a subset of a commutative integral domain containing \(0\) and \(1\) and closed under both addition and multiplication. Since the set of nonzero elements \(S^{*}\) of \(S\) is a monoid with respect to multiplication, one can define semidomain concepts using this monoid. For example, \(S\) is an atomic semidomain if and only if the monoid \(S^{*}\) is atomic, etc. The following three conditions are equivalent: \begin{itemize} \item[1.] \(S\) is atomic and the set of coefficients of each indecomposable polynomial in \(S\) has an mcd (maximal common divisor). \item[2.] \(S[x]\) is atomic. \item[3.] \(S[x^{\pm 1}]\) is atomic. \end{itemize} If one of the three semidomains \(S, S[x], S[x^{\pm 1}]\) satisfies the ascending chain comdition on principal ideals, then all these three semidomains satisfy ACCP. Similar results hold for the bounded factorization and the finite factorization properties. If either \(S[x]\) or \(S[x^{\pm 1}]\) is a length-factorial semidomain, then \(S\) is a unique factorization \textit{domain}. The semidomain \(N_{0}[\![x]\!]\) is not atomic, although \(\mathbb N_{0}\) is a unique factorization \textit{semidomain.}