A characterization of class groups via sets of lengths

The system of sets of lengths in Krull monoids under set addition

Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. Then every element $a \in H$ has a factorization into irreducible elements, and the set $\mathsf L (a)$ of all possible factorization lengths is the set of lengths of $a$. We consider the system $\mathcal L (H) = \{ \mathsf L (a) \mid a \in H \}$ of all sets of lengths, and we characterize (in terms of the class group $G$) when $\mathcal L (H)$ is additively closed under set addition.

A characterization of finite abelian groups via sets of lengths in transfer Krull monoids

Let $H$ be a transfer Krull monoid over a finite ablian group $G$ (for example, rings of integers, holomorphy rings in algebraic function fields, and regular congruence monoids in these domains). Then each nonunit $a \in H$ can be written as a product of irreducible elements, say $a = u_1 \ldots u_k$, and the number of factors $k$ is called the length of the factorization. The set $\mathsf L (a)$ of all possible factorization lengths is the set of lengths of $a$. It is classical that the system $\mathcal L (H) = \{ \mathsf L (a) \mid a \in H \}$ of all sets of lengths depends only on the group…

A characterization of Krull monoids for which sets of lengths are (almost) arithmetical progressions

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 combinatorics we establish a characterization of those class groups G guaranteeing that all sets of lengths are (almost) arithmetical progressions.

Systems of sets of lengths of Puiseux monoids

In this paper we study the system of sets of lengths of non-finitely generated atomic Puiseux monoids (a Puiseux monoid is an additive submonoid of $\mathbb{Q}_{\ge 0}$). We begin by presenting a BF-monoid $M$ with full system of sets of lengths, which means that for each subset $S$ of $\mathbb{Z}_{\ge 2}$ there exists an element $x \in M$ whose set of lengths $\mathsf{L}(x)$ is $S$. It is well known that systems of sets of lengths do not characterize numerical monoids. Here, we prove that systems of sets of lengths do not characterize non-finitely generated atomic Puiseux monoids. In a recent…

Sets of Lengths of Powers of a Variable

A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.

A realization result for systems of sets of lengths

Let $\mathcal L^*$ be a family of finite subsets of $\mathbb N_0$ having the following properties. (a). $\{0\}, \{1\} \in \mathcal L^*$ and all other sets of $\mathcal L^*$ lie in $\mathbb N_{\ge 2}$. (b). If $L_1, L_2 \in \mathcal L^*$, then the sumset $L_1 + L_2 \in \mathcal L^*$. We show that there is a Dedekind domain $D$ whose system of sets of lengths equals $\mathcal L^*$.

Sets of minimal distances and characterizations of class groups of Krull monoids

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of all possible factorization lengths $k$ is called the set of lengths of $a$. There is a constant $M \in \mathbb N$ such that all sets of lengths are almost arithmetical multiprogressions with bound $M$ and with difference $d \in Δ^* (H)$, where $Δ^* (H)$ denotes the set of minimal distances of $H$. We study the structure of $Δ^* (H)$ and establish a character…

Sets of lengths in atomic unit-cancellative finitely presented monoids

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 L (H) = \{\mathsf L (a) \mid a \in H \}$ with a focus on the unions $\mathcal U_k (H) \subset \mathbb N$ which are the unions of all sets of lengths containing a given $k \in \mathbb N$. The Structure Theorem for Unions -- stating that for all sufficiently large $k$, the sets $\mathcal U_k (H)$ are almost arithmetical progressions with the same difference a…

关于具有最大弹性长度集的结构

On the structure of length sets with maximal elasticity

研究具有最大弹性的元素的长度集结构，证明其通常为区间。

数值半群长度集的结构定理

The structure theorem for sets of length for numerical semigroups

本文针对任意数值半群证明了特化版长度集结构定理，利用由原半群生成元导出的两个数值半群的Apéry集及其间隙刻画大元素长度集的缺失长度，并给出满足定理的元素的明确界值。

Long sets of lengths with maximal elasticity

We introduce a new invariant describing the structure of sets of lengths in atomic monoids and domains. For an atomic monoid $H$, let $Δ_ρ (H)$ be the set of all positive integers $d$ which occur as differences of arbitrarily long arithmetical progressions contained in sets of lengths having maximal elasticity $ρ(H)$. We study $Δ_ρ (H)$ for transfer Krull monoids of finite type (including commutative Krull domains with finite class group) with methods from additive combinatorics, and also for a class of weakly Krull domains (including orders in algebraic number fields) for which we use ideal t…

On the sets of lengths of Puiseux monoids generated by multiple geometric sequences

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 description of the rational multicyclic monoids $M$ that are hereditarily atomic (i.e., every submonoid of $M$ is atomic). Additionally, we show that the sets of lengths of certain rational multicyclic monoids are finite unions of multidimensional arithmetic progressions, while their unions satisfy the Structure Theorem for Unions of Sets of Lengths. Finally, we…

On the system of sets of lengths and the elasticity of submonoids of a finite-rank free commutative monoid

Let $H$ be an atomic monoid. For $x \in H$, let $\mathsf{L}(x)$ denote the set of all possible lengths of factorizations of $x$ into irreducibles. The system of sets of lengths of $H$ is the set $\mathcal{L}(H) = \{\mathsf{L}(x) \mid x \in H\}$. On the other hand, the elasticity of $x$, denoted by $ρ(x)$, is the quotient $\sup \mathsf{L}(x)/\inf \mathsf{L}(x)$ and the elasticity of $H$ is the supremum of the set $\{ρ(x) \mid x \in H\}$. The system of sets of lengths and the elasticity of $H$ both measure how far is $H$ from being half-factorial, i.e., $|\mathsf{L}(x)| = 1$ for each $x \in H$. …

Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields

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 finite multiset $\{k_1, \ldots, k_n\}$ of integers greater than $1$, we construct a polynomial in $\operatorname{Int}(D)$ which has exactly $n$ essentially different factorizations into irreducibles in $\operatorname{Int}(D)$, the lengths of these factorizations being $k_1$, \ldots, $k_n$. We also show that there is no transfer homomorphism from the multipl…

整数值多项式在主理想环素理想上的长度集

Sets of Lengths of Integer-Valued Polynomials on Prime Ideals of Principal Ideal Domains

研究整数值多项式环Int(M,D)中长度集的构造与非转移克鲁尔域性质，探讨其在不同环结构下的应用。

Union of sets of lengths of numerical semigroups

Let $S=\langle a_1,\ldots,a_p\rangle$ be a numerical semigroup, $s\in S$ and ${\sf z}(s)$ its set of factorizations. The set of length is denoted by ${\mathcal L}(s)=\{{\tt L}(x_1,\dots,x_p)\mid (x_1,\dots,x_p)\in{\sf Z}(s)\}$ where ${\tt L}(x_1,\dots,x_p)=x_1+\ldots+x_p$. From these definitions, the following sets can be defined ${\textsf W}(n)=\{s\in S\mid \exists x\in{\sf z}(s) \textrm{ such that } {\tt{L}}(x)=n\}$, $ν(n)=\cup_{s\in {\textsf W}(n)} {\mathcal L}(s)=\{l_1<l_2<\ldots< l_r\}$ and $Δν(n)=\{l_2-l_1,\ldots,l_r-l_{r-1}\}$. In this paper, we prove that the set $Δν(S)=\cup_{n\in{\mat…

Factorization Theory in Commutative Monoids

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 the multiplicative monoids of domains (including Krull domains, rings of integer-valued polynomials, orders in algebraic number fields) and of their ideals. We offer examples for all these classes of monoids and discuss their main arithmetical finiteness properties. These describe the structure of their sets of lengths, of the unions of sets of lengths, and th…

Some remarks on orbit sets of unimodular rows

We give a cohomological interpretation of orbit sets of unimodular rows of length d+1 over smooth algebras of Krull dimension d.

关于幂幺半群长度集系统

On the system of length sets of power monoids

本文研究幂幺半群中有限子集的因子分解长度集，证明任意有理数 $q\geq1$ 均可表示为某集合最大与最小长度之比，支持了 Fan 和 Tringali 的猜想。

On arithmetical numerical monoids with some generators omitted

Numerical monoids (cofinite, additive submonoids of the non-negative integers) arise frequently in additive combinatorics, and have recently been studied in the context of factorization theory. Arithmetical numerical monoids, which are minimally generated by arithmetic sequences, are particularly well-behaved, admitting closed forms for many invariants that are difficult to compute in the general case. In~this paper, we answer the question "when does omitting generators from an arithmetical numerical monoid $S$ preserve its (well-understood) set of length sets and/or Frobenius number?" in two …