Related papers: Factorization Theory in Commutative Monoids
Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…
Let $M$ be a commutative cancellative monoid. The set $\Delta(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…
A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
We study the arithmetic of seminormal $v$-noetherian weakly Krull monoids with nontrivial conductor which have finite class group and prime divisors in all classes. These monoids include seminormal orders in holomorphy rings in global…
We study finiteness properties, especially the noetherian property, the Krull dimension and a variation of finite presentation, in categories of polynomial functors from a small symmetric monoidal category whose unit is an initial object to…
We discuss various square-free factorizations in monoids in the context of: atomicity, ascending chain condition for principal ideals, decomposition, and a greatest common divisor property. Moreover, we obtain a full characterization of…
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
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…
Let $R$ be a commutative ring with identity. The structure theorem says that $R$ is a PIR (resp., UFR, general ZPI-ring, $\pi$-ring) if and only if $R$ is a finite direct product of PIDs (resp., UFDs, Dedekind domains, $\pi$-domains) and…
We give a precise description of how the class group of a number field measures the failure of unique factorization in its ring of integers. Specifically, following ideas of Kummer, we determine the structure of all irreducible…
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…
The Corona Factorization Property of a C*-algebra, originally defined to study extensions of C*-algebras, has turned out to say something important about intrinsic structural properties of the C*-algebra. We show in this paper that a…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
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…
We study functions from a unique factorization monoid to a field. The set of all such functions is a commutative ring isomorphic to a ring of formal power series over the field, with indeterminates indexed by the prime elements of the…
Let $H$ be a multiplicatively written monoid. Given $k\in{\bf N}^+$, we denote by $\mathscr U_k$ the set of all $\ell\in{\bf N}^+$ such that $a_1\cdots a_k=b_1\cdots b_\ell$ for some atoms $a_1,\ldots,a_k,b_1,\ldots,b_\ell\in H$. The sets…
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…
The Huneke-Wiegand conjecture has prompted much recent research in Commutative Algebra. In studying this conjecture for certain classes of rings, Garc\'ia-S\'anchez and Leamer construct a monoid S_\Gamma^s whose elements correspond to…