Related papers: Bounded and finite factorization domains

For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…

We study those integral domains in which every proper ideal can be written as an invertible ideal multiplied by a nonempty product of proper radical ideals.

Let $D$ be an integral domain. A nonzero nonunit $a$ of $D$ is called a valuation element if there is a valuation overring $V$ of $D$ such that $aV\cap D=aD$. We say that $D$ is a valuation factorization domain (VFD) if each nonzero nonunit…

A subset $S$ of an integral domain is called a semidomain if the pairs $(S,+)$ and $(S\setminus\{0\}, \cdot)$ are commutative and cancellative semigroups with identities. The multiplication of $S$ extends to the group of differences…

We generalize the theory of radical factorization from almost Dedekind domain to strongly discrete Pr\"ufer domains; we show that, for a fixed subset $X$ of maximal ideals, the finitely generated ideals with $\mathcal{V}(I)\subseteq X$ have…

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

An integral domain $R$ is called atomic if every nonzero nonunit of $R$ factors into irreducibles, while $R$ satisfies the ascending chain condition on principal ideals if every ascending chain of principal ideals of $R$ stabilizes. It is…

An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The…

An atomic monoid $M$ is called a length-factorial monoid (or an other-half-factorial monoid) if for each non-invertible element $x \in M$ no two distinct factorizations of $x$ have the same length. The notion of length-factoriality was…

An integral domain $D$ is a {\em valuation ideal factorization domain} (VIFD) if each nonzero principal ideal of $D$ can be written as a finite product of valuation ideals. Clearly, $\pi$-domains are VIFDs. We study the ring-theoretic…

Let $D$ be a Krull domain admitting a prime element with finite residue field and let $K$ be its quotient field. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $D$,…

An integral domain $D$ is called a \emph{prime-divisor-finite domain} (PDF-domain) if every nonzero element has only finitely many nonassociate prime divisors. A domain $D$ is said to be a \emph{tightly prime-divisor-finite domain}…

An integral domain $D$ is a $v$--domain if, for every finitely generated nonzero (fractional) ideal $F$ of $D$, we have $(FF^{-1})^{-1}=D$. The $v$--domains generalize Pr\"{u}fer and Krull domains and have appeared in the literature with…

Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is…

Let $R$ be an integral domain. For elements $a,b \in R$, let $[a,b]$ denote their greatest common divisor, if it exists. We say that $R$ has the Z-property if whenever $a,b,c,d$ and $e$ are nonzero nonunits of $R$ such that $abc=de$, then…

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

Let $M$ be a cancellative and commutative monoid. A non-invertible element of $M$ is called an atom (or irreducible element) if it cannot be factored into two non-invertible elements, while an atom $a$ of $M$ is called strong if $a^n$ has a…

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…