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 characterization when $Δ^*(H)$ is an interval.
The system $\mathcal L (H) = \{ \mathsf L (a) \mid a \in H \}$ of all sets of lengths depends only on the class group $G$, and a standing conjecture states that conversely the system $\mathcal L (H)$ is characteristic for the class group. We confirm this conjecture (among others) if the class group is isomorphic to $C_n^r$ with $r,n \in \mathbb N$ and $Δ^*(H)$ is not an interval.
Transfer Krull monoids are monoids which allow a weak transfer homomorphism to a commutative Krull monoid, and hence the system of sets of lengths of a transfer Krull monoid coincides with that of the associated commutative Krull monoid. We unveil a couple of new features of the system of sets of lengths of transfer Krull monoids over finite abelian groups G, and we provide a complete description of the system for all groups G having Davenport constant D(G) = 5 (these are the smallest groups for which no such descriptions were known so far). Under reasonable algebraic finiteness assumptions, s…
Some of the fundamental notions related to sets of lengths of Krull monoids with finite class group are discussed, and a survey of recent results is given. These include the elasticity and related notions, the set of distances, and the structure theorem for sets of lengths. Several open problems are mentioned.
Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the involved monoids. The abstract results will be applied to numerical monoids and to Krull monoids.
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 fields. The crucial property of seminormality allows us to give precise arithmetical results analogous to the well-known results for Krull monoids having finite class group and prime divisors in each class. This allows us to show, for example, that unions of sets of lengths are intervals and to provide a characterization of half-factoriality.
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…
Let $H$ be a Krull monoid with finite class group $G$. 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$. If $G$ is finite, then 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 show that $\max Δ^* (H) \le \max \{\exp (G)-2, \mathsf r (G)-1\}$ and that equalit…
Every Krull monoid has a transfer homomorphism onto a monoid of zero-sum sequences over a subset of its class group. This transfer homomorphism is a crucial tool for studying the arithmetic of Krull monoids. In the present paper, we strengthen and refine this tool for Krull monoids with finitely generated class group.
Transfer Krull monoids are a recent concept including all commutative Krull domains and also, for example, wide classes of non-commutative Dedekind domains. We show that transfer Krull monoids are fully elastic (i.e., every rational number between $1$ and the elasticity of the monoid can be realized as the elasticity of an element). In commutative Krull monoids which have sufficiently many prime divisors in all classes of their class group, the set of catenary degrees and the set of tame degrees are intervals. Without the assumption on the distribution of prime divisors, arbitrary finite sets …
Let $H$ be a cancellative commutative monoid, let $\mathcal{A}(H)$ be the set of atoms of $H$ and let $\widetilde{H}$ be the root closure of $H$. Then $H$ is called transfer Krull if there exists a transfer homomorphism from $H$ into a Krull monoid. It is well known that both half-factorial monoids and Krull monoids are transfer Krull monoids. In spite of many examples and counter examples of transfer Krull monoids (that are neither Krull nor half-factorial), transfer Krull monoids have not been studied systematically (so far) as objects on their own. The main goal of the present paper is to a…
We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values that can occur as a minimal distance of a Krull monoid with finite cyclic class group, as well as the exact distribution of prime divisors over the ideal classes in these cases. Our results apply to various classical objects, including maximal orders and certain semi-groups of modules. In addition, we present applications to quantitative problems in factorization theory. More specifically, we deter…
Let $D$ be a domain and let $S$ be a torsion-free monoid whose quotient group satisfies the ascending chain condition on cyclic subgroups. We give a characterization of when the monoid algebra $D[S]$ is weakly Krull. As corollaries, we obtain the results on when $D[S]$ is Krull resp. generalized Krull, due to Chouinard resp. El Baghdadi and Kim. Furthermore, we deduce Chang's theorem on weakly factorial monoid algebras and we characterize the weakly Krull domains among the affine monoid algebras.
A (not necessarily commutative) Krull monoid---as introduced by Wauters---is defined as a completely integrally closed monoid satisfying the ascending chain condition on divisorial two-sided ideals. We study the structure of these Krull monoids, both with ideal theoretic and with divisor theoretic methods. Among others we characterize normalizing Krull monoids by divisor theories. Based on these results we give a criterion for a Krull monoid to be a bounded factorization monoid, and we provide arithmetical finiteness results in case of normalizing Krull monoids with finite Davenport constant.
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.
An atomic monoid is length-factorial if each two distinct factorizations of any element have distinct factorization lengths. We provide a characterization of length-factorial Krull monoids in terms of their class groups and the distribution of prime divisors in the classes.
Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor (for example, a ring of integers in an algebraic number field or a holomorphy ring in an algebraic function field). The catenary degree $\mathsf c (H)$ of $H$ is the smallest integer $N$ with the following property: for each $a \in H$ and each two factorizations $z, z'$ of $a$, there exist factorizations $z = z_0, ..., z_k = z'$ of $a$ such that, for each $i \in [1, k]$, $z_i$ arises from $z_{i-1}$ by replacing at most $N$ atoms from $z_{i-1}$ by at most $N$ new atoms. To exclude trivial cases,…
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.
In the present work, we prove that every class of the divisor class group of a Krull monoid algebra contains infinitely many prime divisors. Several attempts to this result have been made in the literature so far, unfortunately with open gaps. We present a complete proof of this fact.
Let H be a Krull monoid with finite class group G such that every class contains a prime divisor. Then the global tame degree t (H) equals zero if and only if H is factorial (equivalently, |G|=1). If |G| > 1, then D (G) <= t (H) <= 1 + D (G) (D (G) -1) / 2, where D (G) is the Davenport constant of G. We analyze the case when t (H) equals the lower bound, and we show that t (H) grows asymptotically as the upper bound, when both terms are considered as functions of the rank of G. We provide more precise results if G is either cyclic or an elementary 2-group.
Let $H$ be a transfer Krull monoid over a subset $G_0$ of an abelian group $G$ with finite exponent. 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$, and $H$ is said to be half-factorial if $|\mathsf L(a)|=1$ for all $a\in H$. We show that, if $a \in H$ and $|\mathsf L(a^{\lfloor (3\exp(G) - 3)/2 \rfloor})| = 1$, then the smallest divisor-closed submonoid of $H$ containing $a$ is half-factorial. In addition, we prove that, if $G_0$ i…
We study the algebraic and arithmetic structure of monoids of invertible ideals (more precisely, of $r$-invertible $r$-ideals for certain ideal systems $r$) of Krull and weakly Krull Mori domains. We also investigate monoids of all nonzero ideals of polynomial rings with at least two indeterminates over noetherian domains. Among others, we show that they are not transfer Krull but they share several arithmetical phenomena with Krull monoids having infinite class group and prime divisors in all classes.
The set of distances of a monoid or of a domain is the set of all $d \in \mathbb N$ with the following property: there are irreducible elements $u_1, \ldots, u_k, v_1, \ldots, v_{k+d}$ such that $u_1 \cdot \ldots \cdot u_k = v_1 \cdot \ldots \cdot v_{k+d}$, but $u_1 \cdot \ldots \cdot u_k$ cannot be written as a product of $l$ irreducible elements for any $l$ with $k < l < k+d$. We show that the set of distances is an interval for certain seminormal weakly Krull monoids which include seminormal orders in holomorphy rings of global fields.
Let $H$ be a Krull monoid with infinite cyclic class group $G$ and let $G_P \subset G$ denote the set of classes containing prime divisors. We study under which conditions on $G_P$ some of the main finiteness properties of factorization theory--such as local tameness, the finiteness and rationality of the elasticity, the structure theorem for sets of lengths, the finiteness of the catenary degree, and the existence of monotone and of near monotone chains of factorizations--hold in $H$. In many cases, we derive explicit characterizations.
Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. For $k\in \mathbb N$, let $\mathcal U_k(H)$ denote the set of all $m\in \mathbb N$ with the following property: There exist atoms $u_1, \ldots, u_k, v_1, \ldots , v_m\in H$ such that $u_1\cdot\ldots\cdot u_k=v_1\cdot\ldots\cdot v_m$. It is well-known that the sets $\mathcal U_k (H)$ are finite intervals whose maxima $ρ_k(H)=\max \mathcal U_k(H) $ depend only on $G$. If $|G|\le 2$, then $ρ_k (H) = k$ for every $k \in \mathbb N$. Suppose that $|G| \ge 3$. An elementary counting argument shows th…
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 …
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…
Let $H$ be a Krull monoid with class group $G$. Then $H$ is factorial if and only if $G$ is trivial. Sets of lengths and sets of catenary degrees are well studied invariants describing the arithmetic of $H$ in the non-factorial case. In this note we focus on the set $Ca (H)$ of catenary degrees of $H$ and on the set $\mathcal R (H)$ of distances in minimal relations. We show that every finite nonempty subset of $\mathbb N_{\ge 2}$ can be realized as the set of catenary degrees of a Krull monoid with finite class group. This answers Problem 4.1 of {arXiv:1506.07587}. Suppose in addition that ev…
It is well-known that a C-monoid is completely integrally closed if and only if its reduced class semigroup is a group and if this holds, then the C-monoid is a Krull monoid and the reduced class semigroup coincides with the usual class group of Krull monoids. We prove that a C-monoid is seminormal if and only if its reduced class semigroup is a union of groups. Based on this characterization we establish a criterion (in terms of the class semigroup) when seminormal C-monoids are half-factorial.
Let $R$ be a (possibly noncommutative) ring and let $\mathcal C$ be a class of finitely generated (right) $R$-modules which is closed under finite direct sums, direct summands, and isomorphisms. Then the set $\mathcal V (\mathcal C)$ of isomorphism classes of modules is a commutative semigroup with operation induced by the direct sum. This semigroup encodes all possible information about direct sum decompositions of modules in $\mathcal C$. If the endomorphism ring of each module in $\mathcal C$ is semilocal, then $\mathcal V (\mathcal C)$ is a Krull monoid. Although this fact was observed nea…
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…
Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. We consider the system $\mathcal L (H)$ of all sets of lengths of $H$ and study when $\mathcal L (H)$ contains or is contained in a system $\mathcal L (H')$ of a Krull monoid $H'$ with finite class group $G'$, prime divisors in all classes and Davenport constant $\mathsf D (G')=\mathsf D (G)$. Among others, we show that if $G$ is either cyclic of order $m \ge 7$ or an elementary $2$-group of rank $m-1 \ge 6$, and $G'$ is any group which is non-isomorphic to $G$ but with Davenport constant $\ma…
Let $H$ be a commutative and cancellative monoid. The elasticity $ρ(a)$ of a non-unit $a \in H$ is the supremum of $m/n$ over all $m, n$ for which there are factorizations of the form $a=u_1 \cdot \ldots \cdot u_m=v_1 \cdot \ldots \cdot v_{n}$, where all $u_i$ and $v_j$ are irreducibles. The elasticity $ρ(H)$ of $H$ is the supremum over all $ρ(a)$. We establish a characterization, valid for finitely generated monoids, when every rational number $q$ with $1< q < ρ(H)$ can be realized as the elasticity of some element $a \in H$. Furthermore, we derive results of a similar flavor for locally fini…
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…
We investigate the class groups and the distribution of prime divisors in affine monoid algebras over fields and thereby extend the result of Kainrath that every finitely generated integral algebra of Krull dimension at least 2 over an infinite field has infinitely many prime divisors in all classes.
We study a zero-sum problem dealing with minimal zero-sum sequences of maximal length over finite abelian groups. A positive answer to this problem yields a structural description of sets of lengths with maximal elasticity in transfer Krull monoids over finite abelian groups.
Let $G$ be a finite group. A finite unordered sequence $S = g_1 \boldsymbol{\cdot} \ldots \boldsymbol{\cdot} g_{\ell}$ of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their product equals $1_G$, the identity element of the group. As usual, we consider sequences as elements of the free abelian monoid $\mathcal F (G)$ with basis $G$, and we study the submonoid $\mathcal B (G) \subset \mathcal F (G)$ of all product-one sequences. This is a finitely generated C-monoid, which is a Krull monoid if and only if $G$ is abelian. In case of …
Let $G$ be a finite group and $G'$ its commutator subgroup. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals the identity element of $G$. The monoid $\mathcal B (G)$ of all product-one sequences over $G$ is a finitely generated C-monoid whence it has a finite commutative class semigroup. It is well-known that the class semigroup is a group if and only if $G$ is abelian (equivalently, $\mathcal B (G)$ is Krull). In the present paper w…
Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor. Then every nonunit $a \in H$ can be written as a finite product of irreducible elements. If $a=u\_1 \cdot \ldots \cdot u\_k$, with irreducibles $u\_1, \ldots u\_k \in H$, then $k$ is called the length of the factorization and the set $\mathsf L (a)$ of all possible $k$ is called the set of lengths of $a$. It is well-known that the system $\mathcal L (H) = \{\mathsf L (a) \mid a \in H \}$ depends only on the class group $G$. In the present paper we study the inverse question asking whether or not the …
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$ …
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 $\mathscr U_k$ are one of the most fundamental invariants studied in the theory of non-unique factorization, and understanding their structure is a basic problem in the field: In particular, it is known that, in many cases of interest, these sets are almost arithmetic progressions with the same difference and bound for all large $k$, namely, $H$ satisfies the…
We study the lattice of divisor-closed submonoids of finitely generated cancellative commutative monoids. In case the monoid is an affine semigroup, we give a geometrical characterization of such submonoids in terms of its cone. Finally, we use our results to give an algorithm for computing $Δ^*(H)$ the set of minimal distance of $H$.
A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal relations among the generators of $M_n$ when $n$ is sufficiently large, culminating in a description that is periodic in the shift parameter $n$. We explore several applications to computation, combinatorial commutative algebra, and factorization theory.
We describe a minimal set of generators of the defining ideal of the Rees Algebra associated to a proper parametrization of any monoid hypersurface. In the case of plane curves, we recover a known description for rational parametrizations having a syzygy of minimal degree (μ=1). We also show that our approach can be applied to parametrizations of rational surfaces having a Hilbert-Burch resolution with μ_1=μ_2=1.
Let $R$ be a factorial domain. In this work we investigate the connections between the arithmetic of ${\rm Int}(R)$ (i.e., the ring of integer-valued polynomials over $R$) and its monadic submonoids (i.e., monoids of the form $\{g\in {\rm Int}(R)\mid g\mid_{{\rm Int}(R)} f^k$ for some $k\in\mathbb{N}_0\}$ for some nonzero $f\in {\rm Int}(R)$). Since every monadic submonoid of ${\rm Int}(R)$ is a Krull monoid it is possible to describe the arithmetic of these monoids in terms of their divisor-class group. We give an explicit description of these divisor-class groups in several situations and pr…
Let $H$ be an atomic monoid. The set of distances $Δ(H)$ of $H$ is the set of all $d \in \mathbb{N}$ with the following property: there are irreducible elements $u\_1, \ldots, u\_k, v\_1 \ldots, v\_{k+d}$ such that $u\_1 \cdot \ldots \cdot u\_k=v\_1 \cdot \ldots \cdot v\_{k+d}$ but $u\_1 \cdot \ldots \cdot u\_k$ cannot be written as a product of $\ell$ irreducible elements for any $\ell \in \mathbb{N}$ with $k\lt \ell \lt k+d$. It is well-known (and easy to show) that, if $Δ(H)$ is nonempty, then $\min Δ(H) = \gcd Δ(H)$. In this paper we show conversely that for every finite nonempty set $Δ\su…
We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.
In this paper, we study factorizations in the additive monoids of positive algebraic valuations $\mathbb{N}_0[α]$ of the semiring of polynomials $\mathbb{N}_0[X]$ using a methodology introduced by D. D. Anderson, D. F. Anderson, and M. Zafrullah in 1990. A cancellative commutative monoid is atomic if every non-invertible element factors into irreducibles. We begin by determining when $\mathbb{N}_0[α]$ is atomic, and we give an explicit description of its set of irreducibles. An atomic monoid is a finite factorization monoid (FFM) if every element has only finitely many factorizations (up to or…
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 …
Let $\{a_1,\dots,a_p\}$ be the minimal generating set of a numerical monoid $S$. For any $s\in S$, its Delta set is defined by $Δ(s)=\{l_{i}-l_{i-1}|i=2,\dots,k\}$ where $\{l_1<\dots<l_k\}$ is the set $\{\sum_{i=1}^px_i\,|\, s=\sum_{i=1}^px_ia_i \textrm{ and } x_i\in \N \textrm{ for all }i\}.$ The Delta set of $S$, denoted by $Δ(S)$, is the union of all the sets $Δ(s)$ with $s\in S.$ As proved in [S.T. Chapman, R. Hoyer, and N. Kaplan. Delta sets of numerical monoids are eventually periodic. Aequationes Math. 77 (2009), no. 3, 273--279], there exists a bound $N$ such that $Δ(S)$ is the union o…
Over a commutative noetherian ring $R$ of finite Krull dimension, we show that every complex of flat cotorsion $R$-modules decomposes as a direct sum of a minimal complex and a contractible complex. Moreover, we define the notion of a semi-flat-cotorsion complex as a special type of semi-flat complex, and provide functorial ways to construct a quasi-isomorphism from a semi-flat complex to a semi-flat-cotorsion complex. Consequently, every $R$-complex can be replaced by a minimal semi-flat-cotorsion complex in the derived category over $R$. Furthermore, we describe structure of semi-flat-cotors…
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, namely the ideal $\mathcal L_{\mathcal S}$. To this end, we work with a certain (lattice) ideal associated to the monoid $\mathcal S$. Our study can be seen as a new approach generalizing \cite{chapman:2011}, which only studies the case of numerical semigroups. When $\mathcal S$ is a numerical semigroup we give three main results: (1) we compute explicitly a set…
