相关论文: Length-factoriality in commutative monoids and int…

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 (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…

For an integral domain $R$ and a commutative cancellative monoid $M$, the ring consisting of all polynomial expressions with coefficients in $R$ and exponents in $M$ is called the monoid ring of $M$ over $R$. An integral domain is called…

An atomic monoid is length-factorial if each two distinct factorizations of any element have distinct factorization lengths. We provide a characterization of length-factorial Krull monoids in terms of their class groups and the distribution…

For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…

A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…

Let $M$ be a cancellative commutative monoid and call a submonoid $S$ of $M$ an undermonoid if $\G(S)=\G(M)$ inside the Grothendieck group of $M$. Gotti and Li asked whether the finite factorization property is hereditary once it is known…

In an additive factorial monoid each element can be represented as a linear combination of irreducible elements (atoms) with uniquely determined coefficients running over all natural numbers. In this paper we develop for a wide class of…

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

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…

Oftentimes the elements of a ring or semigroup $H$ can be written as finite products of irreducible elements, say $a=u_1 \cdot \ldots \cdot u_k = v_1 \cdot \ldots \cdot v_{\ell}$, where the number of irreducible factors is distinct. The set…

Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…

In classical factorization theory, an integral domain is called \emph{atomic} if every nonzero nonunit element can be written as a finite product of irreducible elements. Here, we introduce and study a weaker notion of atomicity, which…

For a commutative cancellative monoid $M$, we introduce the notion of the length density of both a nonunit $x\in M$, denoted $\mathrm{LD}(x)$, and the entire monoid $M$, denoted $\mathrm{LD}(M)$. This invariant is related to three widely…

Length density is a recently introduced factorization invariant, assigned to each element $n$ of a cancellative commutative atomic semigroup $S$, that measures how far the set of factorization lengths of $n$ is from being a full interval.…

An integral domain (or a commutative cancellative monoid) is atomic if every nonzero nonunit element is the product of irreducibles, and it satisfies the ACCP if every ascending chain of principal ideals eventually stabilizes. The interplay…

Let $D$ be a Dedekind domain with infinitely many maximal ideals, all of finite index, and $K$ its quotient field. Let $\operatorname{Int}(D) = \{f\in K[x] \mid f(D) \subseteq D\}$ be the ring of integer-valued polynomials on $D$. Given any…

In this paper, we study factorizations in the additive monoids of positive algebraic valuations $\mathbb{N}_0[\alpha]$ of the semiring of polynomials $\mathbb{N}_0[X]$ using a methodology introduced by D. D. Anderson, D. F. Anderson, and M.…

We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…

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…