Related papers: On the sets of lengths of Puiseux monoids generate…

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…

A molecule is a nonzero non-unit element of an integral domain (resp., commutative cancellative monoid) having a unique factorization into irreducibles (resp., atoms). Here we study the molecules of Puiseux monoids as well as the molecules…

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…

Let $M$ be a Puiseux monoid, that is, a monoid consisting of nonnegative rationals (under addition). A nonzero element of $M$ is called an atom if its only decomposition as a sum of two elements in $M$ is the trivial decomposition (i.e.,…

If $M$ is an atomic monoid and $x$ is a nonzero non-unit element of $M$, then the set of lengths $\mathsf{L}(x)$ of $x$ is the set of all possible lengths of factorizations of $x$, where the length of a factorization is the number 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…

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…

Let $M$ be a commutative monoid. The monoid $M$ is called atomic if every non-invertible element of $M$ factors into atoms (i.e., irreducible elements), while $M$ is called a Furstenberg monoid if every non-invertible element of $M$ is…

Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…

Primary and strongly primary monoids and domains play a central role in the ideal and factorization theory of commutative monoids and domains. It is well-known that primary monoids satisfying the ascending chain condition on divisorial…

Let $H$ be a multiplicatively written monoid with identity $1_H$ (in particular, a group). We denote by $\mathcal P_{\rm fin,\times}(H)$ the monoid obtained by endowing the collection of all finite subsets of $H$ containing a unit with the…

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Let $M$ be a cancellative and commutative monoid. A submonoid $N$ of $M$ is called an undermonoid if the Grothendieck groups of $M$ and $N$ coincide. For a given property $\mathfrak{p}$, we are interested in providing an answer to the…

We introduce and investigate the category $\mathsf{AtoMon}$ of atomic monoids and atom-preserving monoid homomorphisms, which is a (non-full) subcategory of the usual category of monoids. In particular, we compute all limits and colimits,…

For an element $a$ of a monoid $H$, its set of lengths $\mathsf L (a) \subset \mathbb N$ is the set of all positive integers $k$ for which there is a factorization $a=u_1 \cdot \ldots \cdot u_k$ into $k$ atoms. We study the system $\mathcal…

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations…

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…

Let H be a Krull monoid with finite class group G and suppose that every class contains a prime divisor. Then sets of lengths in H have a well-defined structure which just depends on the class group G. With methods from additive…

We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…

In this paper, we investigate the internal (finite) sum of submonoids of rank-$1$ torsion-free abelian groups. These submonoids, when not groups, are isomorphic to nontrivial submonoids of the nonnegative cone of $\mathbb Q$, known as…