arXiv subjects
Publications and source records attributed to Scott T. Chapman.
With the growing evolution of the theory of non-unique factorization in integral domains and monoids, the study of several variations to the classical unique factorization domain (or UFD) property have become popular in the literature. Using one of these variations, the length-factorial property, it can be shown that part of the standard classical axioms used in the definition of a UFD is essentially superfluous.
Several papers in the recent literature have studied factorization properties of affine monoids using the monoid's Betti elements. In this paper, we extend this study to more general rings and monoids. We open by demonstrating the issues with computing the complete set of Betti elements of a general commutative cancellative monoid, and as an example compute this set for an algebraic number ring of class number two. We specialize our study to the case where the monoid has a single Betti element, before examining monoids with full atomic support (that is, when each Betti element is divisible by every atom). For such a monoid, we show that the catenary degree, tame degree, and omega value agree and can be computed using the monoid's set of Betti elements. We close by considering Betti elements in block monoids, giving a "Carlitz-like" characterization of block monoids with full atomic support and proving that these are precisely the block monoids having a unique Betti element.
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., one of the summands is $0$), while a nonzero element $b \in M$ is called atomic if it can be expressed as a sum of finitely many atoms allowing repetitions: this formal sum of atoms is called an (additive) factorization of $b$. The monoid $M$ is called atomic if every nonzero element of $M$ is atomic. In this paper, we study factorizations in atomic Puiseux monoids through the lens of their associated Betti graphs. The Betti graph of $b \in M$ is the graph whose vertices are the factorizations of $b$ with edges between factorizations that share at least one atom. Betti graphs have been useful in the literature to understand several factorization invariants in the more general class of atomic monoids.
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 additively reduced semidomain $S$ and a torsion-free monoid $M$, we denote by $S[M]$ the semidomain consisting of polynomial expressions with coefficients in $S$ and exponents in $M$; we refer to these objects as additively reduced monoid semidomains. We study the factorization properties of additively reduced monoid semidomains. Specifically, we determine necessary and sufficient conditions for an additively reduced monoid semidomain to be a bounded factorization semidomain, a finite factorization semidomain, and a unique factorization semidomain. We also provide large classes of semidomains with full and infinity elasticity. Throughout the paper we provide examples aiming to shed some light upon the arithmetic of additively reduced semidomains.
In this paper, we study various factorization invariants of arithmetical congruence monoids. The invariants we investigate are the catenary degree, a measure of the maximum distance between any two factorizations of the same element, the length density, which describes the distribution of the factorization lengths of an element, and the omega primality, which measures how far an element is from being prime.
An additive submonoid of the nonnegative cone of the real line is called a positive monoid. Positive monoids consisting of rational numbers (also known as Puiseux monoids) have been the subject of several recent papers. Moreover, those generated by a geometric sequence have also received a great deal of recent attention. Our purpose is to survey many of the recent advances regarding positive monoids, and we provide numerous examples to illustrate the complexity of their atomic and arithmetic structures.
Let $S$ be a nonnegative semiring of the real line, called here a positive semiring. We study factorizations in both the additive monoid $(S,+)$ and the multiplicative monoid $(S\setminus\{0\}, \cdot)$. In particular, we investigate when, for a positive semiring $S$, both $(S,+)$ and $(S\setminus\{0\}, \cdot)$ have the following properties: atomicity, the ACCP, the bounded factorization property (BFP), the finite factorization property (FFP), and the half-factorial property (HFP). It is well known that in the context of cancellative and commutative monoids, the chain of implications HFP $\Rightarrow$ BFP and FFP $\Rightarrow$ BFP $\Rightarrow$ ACCP $\Rightarrow$ atomicity holds. Here we construct classes of positive semirings wherein both the additive and multiplicative structures satisfy each of these properties, and we also give examples to show that, in general, none of the implications in the previous chain is reversible.
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 introduced by Coykendall and Smith in 2011 as a dual of the well-studied notion of half-factoriality. They proved that in the setting of integral domains, length-factoriality can be taken as an alternative definition of a unique factorization domain. However, being a length-factorial monoid is in general weaker than being a factorial monoid (i.e., a unique factorization monoid). Here we further investigate length-factoriality. First, we offer two characterizations of a length-factorial monoid $M$, and we use such characterizations to describe the set of Betti elements and obtain a formula for the catenary degree of $M$. Then we study the connection between length-factoriality and purely long (resp., purely short) irreducibles, which are irreducible elements that appear in the longer (resp., shorter) part of any unbalanced factorization relation. Finally, we prove that an integral domain cannot contain purely short and a purely long irreducibles simultaneously, and we construct a Dedekind domain containing purely long (resp., purely short) irreducibles but not purely short (resp., purely long) irreducibles.
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 studied invariants in the theory of non-unit factorizations, $L(x)$, $\ell(x)$, and $ρ(x)$. We consider some general properties of $\mathrm{LD}(x)$ and $\mathrm{LD}(M)$ and give a wide variety of examples using numerical semigroups, Puiseux monoids, and Krull monoids. While we give an example of a monoid $M$ with irrational length density, we show that if $M$ is finitely generated, then $\mathrm{LD}(M)$ is rational and there is a nonunit element $x\in M$ with $\mathrm{LD}(M)=\mathrm{LD}(x)$ (such a monoid is said to have accepted length density). While it is well-known that the much studied asymptotic versions of $L(x)$, $\ell (x)$ and $ρ(x)$ (denoted $\overline{L}(x)$, $\overline{\ell}(x)$, and $\overlineρ (x)$) always exist, we show the somewhat surprising result that $\overline{\mathrm{LD}}(x) = \lim_{n\rightarrow \infty} \mathrm{LD}(x^n)$ may not exist. We also give some finiteness conditions on $M$ that force the existence of $\overline{\mathrm{LD}}(x)$.
A Puiseux monoid is an additive submonoid of the nonnegative rational numbers. If $M$ is a Puiseux monoid, then the question of whether each non-invertible element of $M$ can be written as a sum of irreducible elements (that is, $M$ is atomic) is surprisingly difficult. Although various techniques have been developed over the past few years to identify subclasses of Puiseux monoids that are atomic, no general characterization of such monoids is known. Here we survey some of the most relevant aspects related to the atomicity of Puiseux monoids. We provide characterizations of when $M$ is finitely generated, factorial, half-factorial, other-half-factorial, Prüfer, seminormal, root-closed, and completely integrally closed. In addition to the atomicity, characterizations are also not known for when $M$ satisfies the ACCP, the bounded factorization property, or the finite factorization property. In each of these cases, we construct an infinite class of Puiseux monoids satisfying the corresponding property.
We study some of the factorization invariants of the class of Puiseux monoids generated by geometric sequences, and we compare and contrast them with the known results for numerical monoids generated by arithmetic sequences. The class we study consists of all atomic monoids of the form $S_r := \langle r^n \mid n \in \mathbb{N}_0 \rangle,$ where $r$ is a positive rational. As the atomic monoids $S_r$ are nicely generated, we are able to give detailed descriptions of many of their factorization invariants. One distinguishing characteristic of $S_r$ is that all its sets of lengths are arithmetic sequences of the same distance, namely $|a-b|$, where $a,b \in \mathbb{N}$ are such that $r = a/b$ and $\text{gcd}(a,b) = 1$. We prove this, and then use it to study the elasticity and tameness of $S_r$.
Most undergraduate level abstract algebra texts use $\mathbb{Z}[\sqrt{-5}]$ as an example of an integral domain which is not a unique factorization domain (or UFD) by exhibiting two distinct irreducible factorizations of a nonzero element. But such a brief example, which requires merely an understanding of basic norms, only scratches the surface of how elements actually factor in this ring of algebraic integers. We offer here an interactive framework which shows that while $\mathbb{Z}[\sqrt{-5}]$ is not a UFD, it does satisfy a slightly weaker factorization condition, known as half-factoriality. The arguments involved revolve around the Fundamental Theorem of Ideal Theory in algebraic number fields.
Using factorization properties, we give several characterizations for an algebraic number ring to have class number 2.
Let $M$ be a commutative cancellative monoid. The set $Δ(M)$, which consists of all positive integers which are distances between consecutive factorization lengths of elements in $M$, is a widely studied object in the theory of nonunique factorizations. If $M$ is a Krull monoid with cyclic class group of order $n \ge 3$, then it is well-known that $Δ(M) \subseteq \{1, \dots, n-2\}$. Moreover, equality holds for this containment when each class contains a prime divisor from $M$. In this note, we consider the question of determining which subsets of $\{1, \dots, n-2\}$ occur as the delta set of an individual element from $M$. We first prove for $x \in M$ that if $n - 2 \in Δ(x)$, then $Δ(x) = \{n-2\}$ (i.e., not all subsets of $\{1,\dots, n-2\}$ can be realized as delta sets of individual elements). We close by proving an Archimedean-type property for delta sets from Krull monoids with finite cyclic class group: for every natural number m, there exist a Krull monoid $M$ with finite cyclic class group such that $M$ has an element $x$ with $|Δ(x)| \ge m$.