An unrestricted notion of the finite factorization property
Jonathan Du, Felix Gotti

TL;DR
This paper introduces and explores the unrestricted finite factorization (U-FF) property in integral domains, analyzing its hierarchy position, behavior under extensions, and providing explicit examples to understand its nuances.
Contribution
It defines the U-FF property, positions it within classical finiteness conditions, and investigates its behavior under standard algebraic constructions and extensions.
Findings
Every IDF domain is U-FF but not vice versa.
Necessary and sufficient conditions for U-FF to ascend along D+M extensions.
Constructed an integral domain with U-FF whose polynomial ring is not U-FF.
Abstract
A nonzero element of an integral domain (or commutative cancellative monoid) is called atomic if it can be written as a finite product of irreducible elements (also called atoms). In this paper, we introduce and investigate an unrestricted version of the finite factorization property, extending the work on unrestricted UFDs carried out by Coykendall and Zafrullah who first studied unrestricted. An integral domain is said to have the unrestricted finite factorization (U-FF) property if every atomic element has only finitely many factorizations, or equivalently, if its atomic subring is a finite factorization domain (FFD). We position the property U-FF within the hierarchy of classical finiteness conditions, showing that every IDF domain is U-FF but not conversely, and we analyze its behavior under standard constructions. In particular, we determine necessary and sufficient conditions for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Polynomial and algebraic computation · semigroups and automata theory
