Related papers: Arithmetic properties encoded in undermonoids
If $\mathbb{F}$ is an ordered field and $M$ is a finite-rank torsion-free monoid, then one can embed $M$ into a finite-dimensional vector space over $\mathbb{F}$ via the inclusion $M \hookrightarrow \text{gp}(M) \hookrightarrow \mathbb{F}…
A Puiseux monoid is an additive submonoid of the nonnegative cone of the rational numbers. We say that a Puiseux monoid $M$ is exponential provided that there exist a positive rational $r$ and a set $S$ consisting of nonnegative integers,…
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…
A semidomain is an additive submonoid of an integral domain that is closed under multiplication and contains the identity element. Although atomicity and divisibility in integral domains have been systematically investigated for more than…
Let $M$ be a cancellative and commutative monoid (written additively). The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements (often called atoms in the literature). Weaker versions of…
Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…
In this paper, we study some of the factorization aspects of rational multicyclic monoids, that is, additive submonoids of the nonnegative rational numbers generated by multiple geometric sequences. In particular, we provide a complete…
A Puiseux monoid is an additive submonoid of the nonnegative cone of rational numbers. Although Puiseux monoids are torsion-free rank-one monoids, their atomic structure is rich and highly complex. For this reason, they have been important…
A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…
We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…
This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…
In [Math. Proc. Cambridge Philos. Soc. 64 (1968), 251-264], P.M. Cohn famously claimed that a commutative domain is atomic if and only if it satisfies the ascending chain condition on principal ideals (ACCP). Some years later, a…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…
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…
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…
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…
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 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…
The ascending chain condition on principal ideals (ACCP) is almost always complementary to atomicity within integral domains: in fact, Cohn initially stated that these two conditions were equivalent. This assertion has been shown to be…
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…