On the arithmetic of polynomial semidomains

From MaRDI portal
Publication:6073697

DOI10.1515/FORUM-2022-0091arXiv2203.11478OpenAlexW4385252796MaRDI QIDQ6073697FDOQ6073697


Authors: Felix Gotti, Harold Polo Edit this on Wikidata


Publication date: 18 September 2023

Published in: Forum Mathematicum (Search for Journal in Brave)

Abstract: A subset S of an integral domain R is called a semidomain provided that the pairs (S,+) and (S,cdot) are semigroups with identities. The study of factorizations in integral domains was initiated by D. D. Anderson, D. F. Anderson, and M. Zafrullah in 1990, and this area has been systematically investigated since then. In this paper, we study the divisibility and arithmetic of factorizations in the more general context of semidomains. We are specially concerned with the ascent of the most standard divisibility and factorization properties from a semidomain to its semidomain of (Laurent) polynomials. As in the case of integral domains, here we prove that the properties of satisfying ACCP, having bounded factorizations, and having finite factorizations ascend in the class of semidomains. We also consider the ascent of the property of being atomic, and we show that the property of having unique factorization ascends only when a semidomain is an integral domain. Throughout the paper we provide several examples aiming to shed some light upon the arithmetic of factorizations of semidomains.


Full work available at URL: https://arxiv.org/abs/2203.11478




Recommendations




Cites Work


Cited In (6)





This page was built for publication: On the arithmetic of polynomial semidomains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073697)