This paper introduces a new invariant to analyze the structure of sets of lengths in atomic monoids, using additive combinatorics and ideal theory to study their properties in various algebraic contexts.
Contribution
It defines the invariant $ ext{Delta}_
ho(H)$ for atomic monoids and explores its properties in transfer Krull monoids and weakly Krull domains, advancing the understanding of factorizations.
Findings
01
Characterization of $ ext{Delta}_
ho(H)$ for transfer Krull monoids.
02
Analysis of $ ext{Delta}_
ho(H)$ in weakly Krull domains.
03
Application of additive combinatorics and ideal theory methods.
Abstract
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 theoretic methods.
Equations243
L=y+(L′∪{0,d,…,ℓd}∪L′′)⊂y+dZ
L=y+(L′∪{0,d,…,ℓd}∪L′′)⊂y+dZ
LH(a)=L(a)={k∣kis a factorization length ofa}⊂N
LH(a)=L(a)={k∣kis a factorization length ofa}⊂N
L(H)={L(a)∣a∈H}
L(H)={L(a)∣a∈H}
ρ(H)=sup{ρ(L)∣L∈L(H)}∈R≥1∪{∞}
ρ(H)=sup{ρ(L)∣L∈L(H)}∈R≥1∪{∞}
ΔH(S)=a∈S⋃Δ(LH(a))⊂N
ΔH(S)=a∈S⋃Δ(LH(a))⊂N
a=p∈P∏pvp(a)∈F(P),wherevp:F(P)→N0is the p-adic exponent,
a=p∈P∏pvp(a)∈F(P),wherevp:F(P)→N0is the p-adic exponent,
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Long sets of lengths with maximal elasticity
Alfred Geroldinger and Qinghai Zhong
Abstract.
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 theoretic methods.
Key words and phrases:
transfer Krull monoids, weakly Krull monoids, sets of lengths, elasticity
2010 Mathematics Subject Classification:
13A05, 13F05, 16H10, 16U30, 20M13
This work was supported by
the Austrian Science Fund FWF, Project Number P28864-N35
1. Introduction
Let H be a monoid or domain such that every (non-zero and non-unit) element can be written as a finite product of atoms. If a=u1⋅…⋅uk is a factorization into atoms u1,…,uk, then k is called the length of this factorization and the set L(a)⊂N of all possible factorization lengths is called the set of lengths of a. The system L(H)={L(a)∣a∈H} of all sets of lengths is a well-studied means of describing the non-uniqueness of factorizations of H. If there is some a∈H such that ∣L(a)∣>1, then L(an)⊃L(a)+…+L(a) whence L(an) has more than n elements for every n∈N. Weak ideal theoretic conditions on H guarantee that all sets of lengths are finite. Then, apart from the trivial case where all sets of lengths are singletons, L(H) is a family of finite subsets of the integers containing arbitrarily long sets. Only in a couple of very special cases the system L(H) can be written down explicitly. In general, L(H) is described by parameters such as the set of distances Δ(H), the elasticity ρ(H), and others. We recall the definition of the elasticity ρ(H). If L∈L(H), then ρ(L)=sup(L)/minL is the elasticity of L (thus ρ(L)=1 if and only if ∣L∣=1). The elasticity ρ(H) of H is the supremum of all ρ(L) over all L∈L(H), and we say that it is accepted if there is some L∈L(H) such that ρ(H)=ρ(L)<∞.
The goal of the present paper is to study the possible differences of arbitrarily long arithmetical progressions contained in sets of lengths having maximal possible elasticity.
More precisely, suppose that H has accepted elasticity with 1<ρ(H)<∞. Then let Δρ(H) denote the set of all d∈N with the following property: for every k∈N, there is some Lk∈L(H) with ρ(Lk)=ρ(H) and L_{k}=y_{k}+\big{(}L_{k}^{\prime}\cup\{0,d,\ldots,\ell_{k}d\}\cup L_{k}^{\prime\prime}\big{)}\subset y_{k}+d\mathbb{Z}, where yk∈Z, maxLk′<0, minLk′′>ℓkd, and ℓk≥k. We study Δρ(H) for transfer Krull monoids of finite type and for classes of weakly Krull monoids.
A transfer Krull monoid of finite type is a monoid having a weak transfer homomorphism to a monoid of zero-sum sequences over a finite subset of an abelian group. Transfer homomorphisms preserve factorization lengths which implies that the systems of sets of lengths of the two monoids coincide.
This setting includes commutative Krull domains with finite class group, but also classes of not necessarily integrally closed noetherian domains, and classes of non-commutative Dedekind prime rings (for a detailed discussion see the beginning of Section 3).
Let H be a transfer Krull monoid over a finite abelian group G such that ∣G∣≥3. Then \mathcal{L}(H)=\mathcal{L}\big{(}\mathcal{B}(G)\big{)}=:\mathcal{L}(G), whence sets of lengths of H can be studied in the monoid B(G) of zero-sum sequences over G and methods from additive combinatorics can be applied.
This setting has found wide interest in the literature ([8, 17, 34]). Our main results on Δρ(⋅) for transfer Krull monoids are summarized after Conjecture 3.20. In a discussion preceding Lemma 3.2 we review the tools from zero-sum theory required for studying Δρ(⋅) and their state of the art. A central question in all studies of systems of sets of lengths is the so-called Characterization Problem, which asks whether for two non-isomorphic finite abelian groups G and G′ (with Davenport constant D(G)≥4) the systems of sets of lengths L(G) and L(G′) can coincide. The standing conjecture is that this is not possible (see [15, Section 6] for a survey, and [20, 25, 37] for recent progress), and the new invariant Δρ(⋅) turns out to be a further useful tool in these investigations (Corollary 3.19).
Within factorization theory the case of (transfer) Krull monoids and domains is by far the best understood case. Much less is known in the non-Krull case. The most investigated class are Mori domains R with non-zero conductor f, finite v-class group, and a finiteness condition on the factor ring R/f (see [13, 31]). However, in the overwhelming number of situations only abstract arithmetical finiteness results are known but no precise results (such as in the Krull case). Mori domains, which are weakly Krull, have a defining family of one-dimensional local Mori domains which provides a strategy for obtaining precise results. In Section 4 we study Δρ(⋅) for such weakly Krull Mori domains and
for their monoids of v-invertible v-ideals under natural algebraic finiteness assumptions which are satisfied, among others, by orders in algebraic number fields (Theorem 4.4). This is done by studying the local case first and then the local results are glued together with the help of the associated T-block monoid. Our results on Δρ(⋅) allow to reveal further classes of weakly Krull monoids which are not transfer Krull (Corollary 4.6).
2. Background on sets of lengths
For integers a and b, we denote by [a,b]={x∈Z∣a≤x≤b} the discrete interval between a and b. Let L⊂Z be a subset. If d∈N and ℓ,M∈N0, then L is called an almost arithmetical
progression (AAP for short) with difference d, length ℓ, and
bound M if
[TABLE]
where y∈Z, L′⊂[−M,−1], and L′′⊂ℓd+[1,M].
If L′⊂Z, then L+L′={a+b∣a∈L,b∈L′} denotes the sumset. If L={m1,…,mk}⊂Z is finite with k∈N0 and m1<…<mk, then Δ(L)={mi−mi−1∣i∈[2,k]}⊂N denotes the set of distances of L. If L⊂N is a subset of the positive integers, then ρ(L)=supL/minL denotes its elasticity, and for convenience we set ρ({0})=1.
Let G be a finite abelian group. Let r∈N and (e1,…,er) be an r-tuple of elements of G. Then (e1,…,er) is said to be independent if ei=0 for all i∈[1,r] and if for all (m1,…,mr)∈Zr an equation m1e1+…+mrer=0 implies that miei=0 for all i∈[1,r]. Furthermore, (e1,…,er) is said to be a basis of G if it is independent and G=⟨e1⟩⊕…⊕⟨er⟩. For every n∈N, we denote by Cn an additive cyclic group of order n.
By a monoid, we mean an associative semigroup with unit element, and if not stated otherwise we use multiplicative notation. Let H be a monoid with unit-element 1=1H∈H. We denote by H× the group of invertible elements and say that H is reduced if H×={1}. Let S⊂H be a subset and a∈S. Then [S]⊂H denotes the submonoid generated by S, and [a]=[{a}]={ak∣k∈N0} is the submonoid generated by a. We say that the subset S is divisor-closed if a,b∈H and ab∈S implies that a,b∈S. We denote by [[S]] the smallest divisor-closed submonoid containing S, and [[a]]=[[{a}]] is the smallest divisor-closed submonoid of H containing a. The monoid H is said to be unit-cancellative if for each two elements a,u∈H any of the equations au=a or ua=a implies that u∈H×. Clearly, every cancellative monoid is unit-cancellative.
Suppose that H is unit-cancellative. An element u∈H is said to be irreducible (or an atom) if u∈/H× and any equation of the form u=ab, with a,b∈H, implies that a∈H× or b∈H×. Let A(H) denote the set of atoms, and we say that H is atomic if every non-unit is a finite product of atoms. If H satisfies the ascending chain condition on principal left ideals and on principal right ideals, then H is atomic ([11, Theorem 2.6]). If a∈H∖H× and a=u1⋅…⋅uk, where k∈N and u1,…,uk∈A(H), then k is a factorization length of a, and
[TABLE]
denotes the set of lengths of a. It is convenient to set L(a)={0} for all a∈H× (note that every divisor of an invertible element is again invertible). The family
[TABLE]
is called the system of sets of lengths of H, and
[TABLE]
denotes the elasticity of H. We say that a monoid H has accepted elasticity
•
if it is atomic unit-cancellative with elasticity ρ(H)<∞, and there is an L∈L(H) such that ρ(L)=ρ(H).
Let H be a monoid with accepted elasticity. Then supL<∞ for every L∈L(H) and for a subset S⊂H,
[TABLE]
denotes the set of distances of S. Let S⊂H be a divisor-closed submonoid and a∈S. Then S×=H×, A(S)=A(H), LS(a)=LH(a), and L(S)⊂L(H). Furthermore, we have ΔS(S)=ΔH(S) and we set Δ(S)=ΔS(S) and Δ(H)=ΔH(H). By definition we have Δ(H)=∅ if and only if ρ(H)=1.
For any set P, we denote by F(P) the free abelian monoid with basis P. If
[TABLE]
then ∣a∣=∑p∈Pvp(a)∈N0 is the length of a.
Let D be a monoid. A submonoid H⊂D is said to be saturated if a∈D, b∈H, and (ab∈H or ba∈H) imply that a∈H. A commutative monoid H is Krull if its associated reduced monoid is a saturated submonoid of a free abelian monoid ([17, Theorem 2.4.8]). A commutative domain is Krull if and only if its monoid of non-zero elements is a Krull monoid. The theory of commutative Krull monoids and domains is presented in [28, 17].
Let G be an additive abelian group and G0⊂G a nonempty subset. An element
[TABLE]
is said to be a zero-sum sequence if its sum σ(S)=g1+…+gℓ=∑g∈G0vg(S)g equals zero. Then the set B(G0) of all zero-sum sequences over G0 is a submonoid, and since B(G0)⊂F(G0) is saturated, it is a commutative Krull monoid. If S is as above, then ∣S∣=ℓ∈N0 is the length of S and supp(S)={g1,…,gℓ}⊂G denotes its support.
The monoid B(G0) plays a crucial role in Section 3. It is usual to set \mathcal{L}(G_{0}):=\mathcal{L}\bigl{(}\mathcal{B}(G_{0})\bigr{)}, \mathcal{A}(G_{0}):=\mathcal{A}\bigl{(}\mathcal{B}(G_{0})\bigr{)}, \rho(G_{0}):=\rho\bigl{(}\mathcal{B}(G_{0})\bigr{)}, and \Delta(G_{0}):=\Delta\bigl{(}\mathcal{B}(G_{0})\bigr{)} (although this is an abuse of notation, it will never lead to confusion). If G0 is finite, then A(G0) is finite and
[TABLE]
denotes the Davenport constant of G0.
Now we introduce the new arithmetical invariant, Δρ(⋅), to be studied in the present paper. For convenience we repeat the definition of the well-studied invariant Δ1(⋅) ([17, Definition 4.3.12]).
Definition 2.1**.**
Let H be an atomic unit-cancellative monoid.
Let Δ1(H) denote the set of all d∈N having the following property :
For every k∈N, there is some Lk∈L(H) which is an AAP with difference d and length at least k.
Let Δρ(H) denote the set of all d∈N having the following property :
For every k∈N, there is some Lk∈L(H) which is an AAP with difference d, length at least k, and with ρ(Lk)=ρ(H).
We set Δρ∗(H)={minΔH([a])∣a∈Hwithρ(L(a))=ρ(H)}.
By definition, we have
[TABLE]
and Δρ(H)=∅ if H does not have accepted elasticity.
The set Δ1(H) is studied with the help of the set Δ∗(H) which is defined as the set of all d∈N having the following property ([17, Definition 4.3.12]) :
There is a divisor-closed submonoid S⊂H with Δ(S)=∅ and d=minΔ(S).
If H is a commutative cancellative BF-monoid, then, by [17, Proposition 4.3.14],
[TABLE]
The sets Δ∗(H), called the set of minimal distances of H, and Δ1(H) have found wide attention, so far mainly for transfer Krull monoids over finite abelian groups ([24, 20, 25, 37, 32]).
In the present paper we study Δρ(H), and the set Δρ∗(H) is a technical tool to do so.
The relationship between the two sets is the topic of Lemma 2.4. In particular, we have ∅=Δρ∗(H)⊂Δρ(H) (provided that H has accepted elasticity ρ(H)>1). Equations (2.3) and (2.4) reveal the formal correspondence between Δ∗(H) and Δρ∗(H) in the case of commutative monoids.
However, there exist commutative monoids H and divisor-closed submonoids S⊂H with ρ(S)=ρ(H)>1 such that minΔ(S)∈/Δρ(H) (use Theorem 3.5 with S=H∈{B(C4),B(C6),B(C10}). Thus, in contrast to (2.3), in Equation (2.4) we cannot replace [[a]] by an arbitrary divisor-closed submonoid.
In contrast to the formal similarity in the definitions, the invariants Δρ(H) and Δ1(H) show a very different behavior (in particular for transfer Krull monoids over finite abelian groups, see Section 3). Thus the additional requirement on the elasticity is a very strong one.
We start with a technical lemma analyzing the set Δρ∗(H).
Lemma 2.2**.**
Let S⊂H be a submonoid with ΔH(S)=∅.
minΔH(S)=gcdΔH(S).
2. 2.
If H is commutative, then minΔ([[S]])=minΔH([[S]])=minΔH(S) whence
[TABLE]
3. 3.
Let a,b∈S with ρ(LH(a))=ρ(LH(b))=ρ(H). Then ρ(LH(ab))=ρ(H). In particular, ρ(LH(ak))=ρ(H) for every k∈N and ρ([[a]])=ρ(H).
Proof.
It is sufficient to prove that
minΔH(S)∣d′ for every d′∈ΔH(S). Let d=minΔH(S) and assume to the contrary that there exists d′∈ΔH(S) such that d∤d′.
We set d0=gcd(d,d′). Then d0<d and there exist x,y∈N such that d0=xd−yd′. Let a1,a2∈S such that {ℓ1,ℓ1+d}⊂LH(a1) and {ℓ2−d′,ℓ2}⊂LH(a2). Thus {xℓ1,xℓ1+d,…,xℓ1+xd}⊂LH(a1x) and {yℓ2−yd′,yℓ2−(y−1)d′,…,yℓ2}⊂LH(a2y). Therefore {xℓ1+yℓ2,xℓ1+yℓ2+xd−yd′}⊂LH(a1xa2y) which implies that d≤xd−yd′=d0, a contradiction.
Suppose that H is commutative. Since S⊂[[S]] and [[S]]⊂H is divisor-closed, it follows that
[TABLE]
To verify the reverse inequality, let b∈[[S]] with minΔ(LH(b))=minΔ([[S]]). There is a c∈H such that bc∈S. Since LH(b)+LH(c)⊂LH(bc), we infer that
[TABLE]
In particular, if S=[a], then minΔ([[a]])=minΔH([a]) and hence the equation for Δρ∗(H) follows.
Since L(a)+L(b)⊂L(ab), it follows that
[TABLE]
and hence
[TABLE]
The in particular statement follows by induction on k.
∎
We continue with a simple observation on the structure of the sets Lk – popping up in the definition of Δρ(H) – for all monoids H under consideration. To do so, we need a further definition. Let d∈N, M∈N0, and {0,d}⊂D⊂[0,d]. A subset L⊂Z is called an almost
arithmetical multiprogression (AAMP for
short) with differenced, periodD,
and boundM, if
[TABLE]
where y∈Z is a shift parameter,
•
L∗ is finite nonempty with minL∗=0 and L∗=(D+dZ)∩[0,maxL∗], and
•
L′⊂[−M,−1] and L′′⊂maxL∗+[1,M].
The following characterization of Δρ(H) follows from the very definitions.
Lemma 2.3**.**
Let H be a monoid with accepted elasticity and with finite non-empty set of distances, and let M∈N. Suppose that every L∈L(H) is an AAMP with some difference d∈Δ(H) and bound M. Then Δρ(H) is the set of all d∈N with the following property :* for every k∈N there is some ak∈H such that ρ(L(ak))=ρ(H) and*
[TABLE]
where y∈Z, ℓ≥k, L′⊂[−M,−1], and L′′⊂ℓd+[1,M].
The assumption in Lemma 2.3, that all sets of lengths are AAMPs with global bounds, is a well-studied property in factorization theory. It holds true, among others, for transfer Krull monoids of finite type (studied in Section 3) and for weakly Krull monoids (as studied in Theorem 4.4). We refer to [17, Chapter 4.7] for a survey on settings where sets of lengths are AAMPs and also to [18]. Thus, under this assumption, the above lemma shows that the sets Lk (in Definition 2.1.2 of Δρ(H)) have globally bounded beginning and end parts L′ and L′′, and the goal is to study the set of possible distances in the middle part which can get arbitrarily long.
Lemma 2.4**.**
Let H be a monoid with accepted elasticity.
If ρ(H)>1, then ∅=Δρ∗(H)⊂Δρ(H) and minΔρ∗(H)=minΔρ(H). In particular, if ρ(H)>1 and ∣Δ(H)∣=1, then Δρ∗(H)=Δρ(H)=Δ(H).
2. 2.
If S⊂H is a divisor-closed submonoid with ρ(S)=ρ(H), then Δρ(S)⊂Δρ(H).
3. 3.
*If H is commutative and cancellative with finitely many atoms up to associates, then *
Δρ(H)⊂{d∈N∣ddivides somed′∈Δρ∗(H)}. In particular, maxΔρ(H)=maxΔρ∗(H).
4. 4.
Δρ(H)=∅* if and only if Δ1(H)=∅ if and only if Δ(H)=∅ if and only if ρ(H)=1.*
Proof.
Suppose that ρ(H)>1. Then, by definition, there is an a∈H with ρ(L(a))=ρ(H)>1 whence ΔH([a])=∅ and thus Δρ∗(H)=∅. To verify that Δρ∗(H)⊂Δρ(H), we set d=minΔH([a]). Then there is an ℓ∈N such that d∈Δ(L(aℓ)) and thus for every k∈N the set L(akℓ) contains an arithmetical progression with difference d and length at least k. Since minΔH([a])=gcdΔH([a]) by Lemma 2.2.2, L(akℓ) is an AAP with difference d and length at least k for every k∈N. By Lemma 2.2.3, we have ρ(LH(akℓ))=ρ(H) and thus d∈Δρ(H).
Since Δρ∗(H)⊂Δρ(H), it follows that minΔρ(H)≤minΔρ∗(H). To verify the reverse inequality, let d∈Δρ(H) be given. Then there is an a∈H such that L(a) is an AAP with
difference d, length at least 1, and ρ(L(a))=ρ(H).
Thus minΔH([a])∈Δρ∗(H) by definition, and clearly we have minΔH([a])≤minΔ(L(a))=d.
If ρ(H)>1 and ∣Δ(H)∣=1, then the inclusions given in (2.2) imply that Δρ∗(H)=Δρ(H)=Δ(H).
Suppose that S⊂H is divisor-closed with ρ(S)=ρ(H). Then for every a∈S, we have LS(a)=LH(a), and hence L(S)⊂L(H). If d∈Δρ(S), then by definition, for every k∈N, there is some Lk∈L(S)⊂L(H) which is an AAP with difference d, length at least k, and with ρ(Lk)=ρ(S)=ρ(H), and thus d∈Δρ(H).
Clearly, the in particular statement follows from the asserted inclusion and from the fact that Δρ∗(H)⊂Δρ(H) as shown in 1. We use several times the fact that finitely generated commutative monoids are locally tame and have accepted elasticity ([17, Theorem 3.1.4]).
Without restriction we may suppose that H is reduced, and we set A(H)={u1,…,ut} with t∈N. Let d∈Δρ(H) be given. Then for every k∈N, there is a bk∈H such that \rho\bigl{(}\mathsf{L}(b_{k})\bigr{)}=\rho(H) and L(bk) is an AAP with difference d and length ℓk≥k. Since A(H) is finite, there are a nonempty subset A⊂A(H), say A={u1,…,us} with s∈[1,t], a constant M1∈N0, and a subsequence (bmk)k≥1 of (bk)k≥1, say bmk=ck for all k∈N, such that, again for all k∈N,
[TABLE]
By Theorem [17, Theorem 4.3.6] (applied to the monoid [[u1⋅…⋅us]]), Lk=L(∏i=1suimk,i) is an AAP with difference d′=minΔ([[u1⋅…⋅us]]) for every k∈N. Since H is locally tame, [17, Proposition 4.3.4] implies that there is a constant M2∈N0 such that for every k∈N
[TABLE]
Since for every k∈N there is a yk∈N such that yk+Lk⊂L(ck), we infer that d divides d′. Being a divisor-closed submonoid of a finitely generated monoid, the monoid [[u1⋅…⋅us]] is finitely generated by [17, Proposition 2.7.5]. Thus there is an a∈[[u1⋅…⋅us]] such that ρ(L(a))=ρ([[u1⋅…⋅us]]). Since d divides d′=minΔ([[u1⋅…⋅us]]) and d′ divides minΔ([[a]]), it follows that d divides minΔ([[a]]).
Next we verify that ρ([[u1⋅…⋅us]])=ρ(H) from which it follows that minΔ([[a]])∈Δρ∗(H) by Lemma 2.2.2. For k∈N, we have
[TABLE]
If k tends to infinity, then (maxLk+M2)/(minLk−M2) tends to maxL(ck)/minL(ck) which implies that ρ([[u1⋅…⋅us]])=ρ(H).
This follows from 1. and from the basic relation given in (2.2).
∎
Lemma 2.5**.**
Let H be a monoid with accepted elasticity. Then for every nonempty subset Δ⊂Δρ(H) there is a d∈Δρ(H) such that d≤gcdΔ.
Proof.
Let Δ={d1,…,dn}⊂Δρ(H) be a nonempty subset. For every i∈[1,n] and every k∈N there is an ai,k∈H such that L(ai,k) is an AAP with difference di, length at least k, and with ρ(L(ai,k))=ρ(H). By Lemma 2.2.3, L(a1,k⋅…⋅an,k) has elasticity ρ(H) for all k∈N, and thus d=minΔH([a1,k⋅…⋅an,k])∈Δρ∗(H)⊂Δρ(H). If k is sufficiently large, then gcd(d1,…,dn) occurs as a distance of the sumset L(a1,k)+…+L(an,k).
Since the sumset
[TABLE]
and d=gcdΔH([a1,k⋅…⋅an,k]) by Lemma 2.2.1, d divides any distance of \Delta\big{(}\mathsf{L}(a_{1,k}\cdot\ldots\cdot a_{n,k})\big{)} whence it divides gcd(d1,…,dn).
∎
Lemma 2.6**.**
Let H=H1×…×Hn where n∈N and H1,…,Hn are atomic unit-cancellative monoids.
Then ρ(H)=sup{ρ(H1),…,ρ(Hn)}, and H has accepted elasticity if and only if there is some i∈[1,n] such that Hi has accepted elasticity ρ(Hi)=ρ(H).
2. 2.
Let s∈[1,n] and suppose that Hi has accepted elasticity ρ(Hi)=ρ(H) for all i∈[1,s], and that Hi either does not have accepted elasticity or ρ(Hi)<ρ(H) for all i∈[s+1,n]. We set
[TABLE]
Then Δ′⊂Δρ(H), Δ′′⊂Δρ∗(H), and if ∣Δ(Hi)∣=1 for all i∈[1,s], then Δ′=Δ′′=Δρ∗(H)=Δρ(H).
Proof.
The formula for ρ(H) follows from [17, Proposition 1.4.5], where a proof is given for cancellative monoids but the proof of the general case runs along the same lines. The formula for ρ(H) immediately implies the second assertion.
2.(i) First we show that Δ′⊂Δρ(H). Let ∅=I⊂[1,s], say I=[1,r], and choose di∈Δρ(Hi) for every i∈[1,r]. For each i∈[1,r] and every ℓ∈N there is an ai,ℓ∈Hi such that L(ai,ℓ) is an AAP with difference di, length at least 2ℓ, and with ρ(L(ai,ℓ))=ρ(H). Then
\rho\big{(}\mathsf{L}(a_{1,\ell}\cdot\ldots\cdot a_{r,\ell})\big{)}=\rho(H) by Lemma 2.2.3. Thus, for all sufficiently large ℓ, the sumset L(a1,ℓ)+…+L(ar,ℓ)=L(a1,ℓ⋅…⋅ar,ℓ) is an AAP with difference gcd(d1,…,dr) and length at least ℓ.
2.(ii) Second we show that Δ′′⊂Δρ∗(H). Let ∅=I⊂[1,s], say I=[1,r], and choose di∈Δρ∗(Hi) for every i∈[1,r]. Thus there are ai∈Hi such that ρ(L(ai))=ρ(H) and minΔHi([ai])=minΔH([ai])=di for all i∈[1,r]. Therefore, again for all i∈[1,r], there is an ℓi∈N such that di∈Δ(L(aiℓi)) and thus, for every k∈N, L(ai2kℓi) contains an arithmetical progression with difference di and length at least 2k. Setting ℓ=max(ℓ1,…,ℓr) we infer that
[TABLE]
is an AAP with difference gcd(d1,…,dr) and length at least k for all sufficiently large k. Thus minΔH([a1⋅…⋅ar])=gcd(d1,…,dr). Since
ρ(L(a1⋅…⋅ar))=ρ(H) by Lemma 2.2.3, it follows that gcd(d1,…,dr)=minΔH([a1⋅…⋅ar])∈Δρ∗(H).
2.(iii)
Now suppose that Δ(Hi)={di} for all i∈[1,s]. Then Δρ∗(Hi)=Δρ(Hi)=Δ(Hi) by Lemma 2.4.1 and hence Δ′=Δ′′. By 2.(i) and 2.(ii) it remains to show that Δρ(H)⊂Δ′. Then all four sets are equal as asserted.
Let d∈Δρ(H) and let k∈N be sufficiently large. Then there are a1,k∈H1,…,as,k∈Hs such that L(a1,k⋅…⋅as,k) is an AAP with difference d, elasticity ρ(H), and length at least k. Since Δ(Hi)={di} for all i∈[1,s],
[TABLE]
is a sumset of arithmetical progressions with differences d1,…,ds.
After renumbering if necessary there is an r∈[1,s] such that ∣L(ai,k)∣>1 for all i∈[1,r] and ∣L(ai,k)∣=1 for all i∈[r+1,s]. Thus we clearly obtain that d≥gcd(d1,…,dr).
Since L(a1,k⋅…⋅as,k) is an AAP with difference d and length at least k with k being sufficiently large, it follows that L(a1,k⋅…⋅as,k)⊂y+dZ for some y∈Z (see (2.1)), which implies that d∣di for all i∈[1,r]. Thus
d=gcd(d1,…,dr) and hence d∈Δ′.
∎
3. Transfer Krull monoids
An atomic unit-cancellative monoid H is said to be a transfer Krull monoid if one of the following two equivalent properties is satisfied:
(a)
There is a commutative Krull monoid B and a weak transfer homomorphism θ:H→B.
(b)
There is an abelian group G, a subset G0⊂G, and a weak transfer homomorphism θ:H→B(G0).
In case (b) we say that H is a transfer Krull monoid over G0, and if G0 is finite, then H is said to be a transfer Krull monoid of finite type.
We do not repeat the technical definition of weak transfer homomorphisms (introduced by Baeth and Smertnig in [3]) because we use only that they preserve sets of lengths. Therefore
L(H)=L(G0) ([15, Lemma 4.2]) which, by definition, implies that
[TABLE]
and H has accepted elasticity if and only if B(G0) has accepted elasticity. Note that, as with other invariants, we use the abbreviations
[TABLE]
Every commutative Krull monoid (and thus every commutative Krull domain) with class group G is a transfer Krull monoid over the subset G0⊂G containing prime divisors. In particular, if the class group G is finite and every class contains a prime divisor (which holds true for holomorphy rings in global fields), then it is a transfer Krull monoid over G. Deep results, due to D. Smertnig, reveal large classes of bounded HNP (hereditary noetherian prime) rings to be transfer Krull ([36, 3, 35]). To mention one of these results in detail, let O be a ring of integers of an algebraic number field K, A a central simple algebra over K, and R a classical maximal O-order of A. Then the monoid of cancellative elements of R is transfer Krull if and only if every stably free left R-ideal is free, and if this holds, then it is a tranfer Krull monoid over a finite abelian group (namely a ray class group of O).
We refer to [15] for a detailed discussion of commutative Krull monoids with finite class group and of further transfer Krull monoids.
Let H be a transfer Krull monoid over a finite abelian group G. The system L(H)=L(G), together with all parameters controlling it, is a central object of interest in factorization theory (see [34] for a survey). By (2.2) and Lemma 2.4.1, we have
[TABLE]
The set Δ(G) is an interval by [22], but Δ1(G) is far from being an interval ([32]). A characterization when Δ1(G) is an interval can be found in [37]. We have maxΔ1(G)=max{r(G)−1,exp(G)−2} (for ∣G∣≥3, by [24]). This section will reveal that Δρ(G) is quite different from Δ1(G).
We start with a result for transfer Krull monoids over arbitrary finite subsets. It shows that in finitely generated commutative Krull monoids H with finite class group (and without restriction on the classes containing prime divisors) a large variety of finite sets can be realized as Δρ(H) sets (Lemma 2.5 shows that not every finite set can be realized as a Δρ(⋅) set of some monoid; see also Lemmas 2.6 and 4.3). In contrast to this we will see that the set Δρ(H) is extremely restricted if the set of classes containing prime divisors is very large.
Theorem 3.1**.**
Let H be a transfer Krull monoid over a finite subset G0. Then H has accepted elasticity ρ(H)=ρ(G0)≤D(G0)/2 and equality holds if G0=−G0.
2. 2.
For every finite set Δ={d1,…,dn}⊂N there exists a finitely generated commutative Krull monoid H with finite class group such that {gcd{di∣i∈I}∣∅=I⊂[1,n]}=Δρ∗(H)=Δρ(H).
3. 3.
If H be a transfer Krull monoid over a subset G0 of a finite abelian group G with ρ(H)=D(G)/2, then ⟨G0⟩=G and Δρ(H)⊂Δρ(G).
Proof.
By (3.1), we have L(H)=L(G0) and hence ρ(H)=ρ(G0).
Since the set G0 is finite, the monoid B(G0) is finitely generated whence the elasticity ρ(G0) is accepted ([17, Theorems 3.1.4 and 3.4.2]). The statements on ρ(G0) follow from [17, Theorem 3.4.11].
Let Δ={d1,…,dn}⊂N be a finite set. We start with the following assertion.
A.
For every i∈[1,n], there is a finite abelian group Gi and a subset Gi′⊂Gi such that Δρ(Gi′)=Δ(Gi′)={di} and ρ(Gi′)=2.
Proof ofA. We do the construction for a given d∈N and omit all indices. If d=1, then G=C8={0,g,…,7g} and G′={g,3g} have the required properties. Suppose that d≥2. Consider a finite abelian group G, independent elements e1,…,ed−1∈G with ord(e1)=…=ord(ed−1)=2d, and set e0=−(e1+…+ed−1). It is easy to check that G′={e0,e1,…,ed−1} satisfies ρ(G′)=2 and Δ(G′)={d} (for details of a more general construction see [17, Proposition 4.1.2]).
∎[Proof of A]
We set
[TABLE]
Then H=B(G1′)×…×B(Gn′) is a finitely generated commutative Krull monoid with finite class group. By Lemma 2.6.1, H has accepted elasticity ρ(H)=2 and
[TABLE]
Let H be a transfer Krull monoid over G0 such that ρ(H)=D(G)/2. Then 1. shows that
[TABLE]
Thus
[TABLE]
and since proper subgroups of G have a strictly smaller Davenport constant ([17, Proposition 5.1.11]), it follows that ⟨G0⟩=G.
Since ρ(H)=ρ(G0) and ρ(G)=D(G)/2 by 1., we obtain that
ρ(G0)=ρ(G). Since Δρ(H)=Δρ(G0) and B(G0)⊂B(G) is a divisor-closed submonoid, the assertion follows from Lemma 2.4.2.
∎
Let all notation be as in Theorem 3.1.3. Since Δρ(H)=∅ and Δρ(G) will turn out to be small (Conjecture 3.20), we have Δρ(H)=Δρ(G) in many situations (as it holds true in the case G0=G).
In the remainder of this section we study Δρ(G) for finite abelian groups G. Suppose that
[TABLE]
where 1<n1∣…∣nr, nr=exp(G) is the exponent of G, and r=r(G) is the rank of G. Thus r(G)=max{rp(G)∣p∈P} is the maximum of all p-ranks rp(G) over all primes p∈P.
The next lemma, Lemma 3.2, reveals that the study of Δρ(G) needs information on the Davenport constant D(G) as well as (at least some basic) information on the structure of minimal zero-sum sequences having length D(G). Although studied since the 1960s, the precise value of the Davenport constant is known only in a very limited number of cases. Clearly, we have
D∗(G)≤D(G) and since the 1960s it is known that equality holds if r(G)≤2 or if G is a p-group. Further classes of groups have been found where equality holds and also where it does not hold, but a good understanding of this phenomenon is still missing. Even less is known on the inverse problem, namely on the structure of minimal zero-sum sequences having length D(G). The structure of such sequences is clear for cyclic groups and for elementary 2-groups, and recently the structure was determined for rank two groups. For general groups, even harmless looking questions (such as whether each minimal zero-sum sequence of length D(G) does contain an element of order exp(G)) are open. In this section we study Δρ(G) for all classes of groups where at least some information on the inverse problem is available.
Recall that Δ(G)=∅ if and only if ∣G∣≤2 whence we will always assume that ∣G∣≥3.
Lemma 3.2**.**
Let G be a finite abelian group with ∣G∣≥3.
For A∈B(G) the following statements are equivalent :**
Comment on 1. If U1,…,Um∈A(G) with ∣U1∣=…=∣Um∣=D(G), then obviously we obtain an equation of the form U1(−U1)⋅…⋅Um(−Um)=V1⋅…⋅VmD(G) with ∣Vi∣=2 for all i∈[1,mD(G)]. But there are also equations U1⋅…⋅Uk=V1⋅…⋅Vℓ with all properties as in 1.(b) and with k odd ([12]).
Proof.
(a) ⇒ (b) We set L=L(A) and suppose that ρ(L)=D(G)/2. If A=0mC, with m∈N0 and C∈B(G∖{0}), then
[TABLE]
whence m=0. Suppose that
[TABLE]
with k=minL(A), ℓ=maxL(A), and U1,…,Uk,V1,…,Vℓ∈A(G). Then ρ(L)=ℓ/k=D(G)/2 and
[TABLE]
This implies that ∣A∣=2ℓ=kD(G), ∣V1∣=…=∣Vℓ∣=2, and ∣U1∣=…=∣Uk∣=D(G).
(b) ⇒ (a) Suppose that A=U1⋅…⋅Uk=V1⋅…⋅Vℓ where U1,…,Uk,V1,…,Vℓ are as in (b). Then we infer that
[TABLE]
and hence
[TABLE]
2.(a) ⇒ (b) This follows from 1.
(b) ⇒ (a) We set G0={g1,−g1,…,gk,−gk}. For every i∈[1,k], let Ai∈A(G0) with gi∣Ai and ∣Ai∣=D(G), and set A=∏i=1k(−Ai)Ai. Then supp(A)=G0 and \rho\bigl{(}\mathsf{L}(A)\bigr{)}=\mathsf{D}(G)/2.
Since for every A∈B(G) we have [[A]]=B(supp(A)), the assertion follows from 2.
∎
Since B(G) is finitely generated, this follows from Lemma 2.4.
The first equality follows from 1. Then Lemma 3.2.3 implies that
[TABLE]
Let A∈B(G) with G0=supp(A) and ρ(L(A))=D(G)/2. Then, by Lemma 3.2, G0=−G0 and A=U1⋅…⋅Uk with U1,…,Uk∈A(G) and ∣U1∣=…=∣Uk∣=D(G). Then G_{1}=\operatorname{supp}\big{(}(-U_{1})U_{1}\big{)}\subset G_{0} and minΔ(G0)≤minΔ(G1). Thus the assertion follows.
∎
Let G be a finite abelian group and let g∈G with ord(g)=n≥2. For every
sequence S=(n1g)⋅…⋅(nℓg)∈F(⟨g⟩), where ℓ∈N0 and n1,…,nℓ∈[1,n], we define its g-norm
[TABLE]
Note that, σ(S)=0 implies that n1+…+nℓ≡0modn whence ∥S∥g∈N0.
Lemma 3.4**.**
Let G be a finite abelian group with ∣G∣≥3 and G0⊂G be a subset.
If −G0=G0, then minΔ(G0) divides gcd{∣U∣−2∣U∈A(G0)}.
2. 2.
If r≥2, (e1,…,er) independent, ord(ei)=ni for all i∈[1,r] where n1∣…∣nr, nr>2, e0=e1+…+er, and G0={e1,−e1,…,er,−er,e0,−e0}, then minΔ(G0)=1.
3. 3.
If ⟨G0⟩=⟨g⟩ for some g∈G0 and Δ(G0)=∅, then \min\Delta(G_{0})=\gcd\bigl{\{}\|V\|_{g}-1\,\bigm{|}\,V\in\mathcal{A}(G_{0})\bigr{\}}.
Proof.
If U=g1⋅…⋅gℓ∈A(G0), then (-U)U=\prod_{i=1}^{\ell}\big{(}(-g_{i})g_{i}\big{)} whence \{2,\ell\}\subset\mathsf{L}\big{(}(-U)U\big{)} and so gcdΔ(G0) divides ℓ−2.
Since e0=e1+…+er, we have ord(e0)=nr>2. We distinguish two cases. First, suppose that n1>2. Then
[TABLE]
and W^{2}=e_{0}^{n_{r}}\cdot(-e_{r})^{n_{r}}\cdot\big{(}e_{0}^{n_{r}-2}e_{1}^{2}\cdot\ldots\cdot e_{r-1}^{2}(-e_{r})^{n_{r}-2}\big{)} is a product of three atoms whence minΔ(G0)=1.
Now, we suppose that n1=2, and let t∈[1,r−1] such that n1=…=nt=2 and nt+1>2. Then
[TABLE]
Then
[TABLE]
is a product of t+1 atoms and
[TABLE]
is a product of t+2 atoms. Thus minΔ(G0)∣gcd(t+1−2,t+2−2)=1 which implies that minΔ(G0)=1.
Let H be a transfer Krull monoid over a finite abelian group G with ∣G∣≥3. Then 1∈Δρ(H) if and only if G is not cyclic of order 4,6 or 10.
Proof.
By (3.1), it is sufficient to prove the assertion for B(G) instead of H. We distinguish two cases.
CASE 1: r(G)≥2.
By Corollary 3.3.1, it is sufficient to prove that 1∈Δρ∗(G).
For each prime p dividing ∣G∣, we denote by Gp the Sylow p-subgroup of G. Since r(G)≥2, there exists a Sylow-p subgroup Gp such that r(Gp)≥2. We distinguish two subcases.
CASE 1.1: There exists a Sylow p-subgroup Gp such that r(Gp)≥2 and exp(Gp)≥3.
Then there exists a subgroup H of G with p∤∣H∣ such that G≅Gp⊕H (clearly, we may have H={0}). Let A be an atom of B(G) with length ∣A∣=D(G). Thus for every g dividing A, there exists a unique pair (fg,hg) with fg∈Gp and hg∈H such that g=fg+hg. Since ⟨supp(A)⟩=G, there must exist g∈supp(A) such that ord(fg)=exp(Gp). Therefore we can find e2,…,er(Gp) such that Gp=⟨fg⟩⊕⟨e2⟩⊕…⊕⟨er(Gp)⟩. There are group isomorphisms
[TABLE]
and
[TABLE]
It follows that ϕ(A) and ψ(A) are atoms of length D(G). We consider the set
[TABLE]
Obviously, we have
G0=−G0 and for every a∈G0 there is some A′∈A(G0) with a∣A′ and ∣A′∣=D(G). Thus, by Lemma 3.2, it is sufficient to prove minΔ(G0)=1. Since
[TABLE]
and
[TABLE]
it follows that minΔ(G0)∣gcd{ord(g)−2,ord(g)−3}. Since ord(g)≥exp(Gp)≥3, we obtain that minΔ(G0)=1.
CASE 1.2: There is no Sylow p-subgroup Gp such that r(Gp)≥2 and exp(Gp)≥3.
Let Gp be the Sylow p-subgroup with r(Gp)≥2. Then p=2, G2 is an elementary 2-group, and G≅C2r(G)⊕H, where H is a cyclic subgroup of odd order.
Let A be an atom of B(G) with length ∣A∣=D(G). There exists an element g0∈supp(A) such that ord(g0) is even and hence g0=f0+h0, where f0∈G2∖{0} and h0∈H.
We can find e2,…,er(G) with ord(ei)=2 for each i∈[2,r(G)] such that G2≅⟨f0⟩⊕⟨e2⟩⊕…⊕⟨er(G)⟩. Then we can construct two group isomorphisms
[TABLE]
and
[TABLE]
It follows that ϕ(A) and ψ(A) are atoms of length D(G). We consider the set
[TABLE]
Obviously, we have
G0=−G0 and for every a∈G0 there is some A′∈A(G0) with a∣A′ and ∣A′∣=D(G). Thus it is sufficient to prove minΔ(G0)=1.
Note that {g0,−g0,ϕ(g0),ψ(g0)}={g0,−g0,e2+h0,g0+e2}⊂G0.
If ord(g0)=2, then h0=0 and L(g02e22(g0+e2)2)={2,3} imply that minΔ(G0)=1.
Suppose that ord(g0)≥4. Since
[TABLE]
it follows that minΔ(G0) divides gcd{ord(g0)−2,ord(g0)−3}=1.
CASE 2: r(G)=1.
Let ∣G∣=n and g∈G with ord(g)=n. First, we suppose that n is odd.
Then gn and (2g)n are atoms of length D(G)=n, and we set G0={g,−g,2g,−2g}. Then G0=−G0 and for every h∈G0 there is some A∈A(G0) with h∣A and ∣A∣=D(G). It is sufficient to prove that minΔ(G0)=1. In fact, by Lemma 3.4.1, we obtain that minΔ(G0) divides gcd{∣gn∣−2,∣gn−2(2g)∣−2}=1.
Now we suppose that n is even and distinguish two subcases.
CASE 2.1: n∈/{4,6,10}.
It is sufficient to show that 1∈Δρ∗(G). We distinguish two cases.
First, suppose that there exists an odd positive divisor m of 2n+1 such that m≥5. Then gcd(m,n)=1. Let n=m(t+1)−2, where t≥1. Then A1=(mg)tgm−2, A2=(mg)gn−m, A3=(mg)2t+1gm−4, and A4=gn are atoms. Since A12A2=A3A4, we obtain that 1∈Δ({g,−g,mg,−mg}). By the definition of Δρ∗(G) and Lemma 3.2, we have that 1∈Δρ∗(G)⊂Δρ(G).
Second, suppose that for every odd positive divisor m of 2n+1, we have m≤3. Then 2n+1=2α or 2n+1=3⋅2α−1 where α∈N. Thus n+4∈{2(2α+1),2(3⋅2α−1+1)}. Since n∈/{4,6,10}, we obtain that α≥3. Let g∈G with ord(g)=n, and n+4=2k, where k is odd with k≥9. It follows that gcd(k,n)=1 and A5=(kg)gn−k, A6=(kg)3g2n−3k, A7=gn are atoms. Since A53=A6A7, we have that 1∈Δ({g,−g,kg,−kg}).
CASE 2.2: n∈{4,6,10}.
We have to show that 1∈Δρ(G).
If n∈{4,6}, it is easy to check Δρ(G)={n−2}. Suppose that n=10. Let
By Lemma 2.4.1, we infer that minΔρ∗(G)=minΔρ(G). By Lemma 3.4.3, minΔ(G0)=gcd{∥V∥g−1∣V∈A(G0)}=2 which implies that 1∈/Δρ(G).
∎
Lemma 3.6**.**
Let G=Cm⊕Cmn with n≥1 and m≥2. A sequence S
over G of length D(G)=m+mn−1 is a minimal zero-sum
sequence if and only if it has one of the following two forms :**
•
[TABLE]
where
(a)
{e1,e2}* is a basis of G,*
(b)
x1,…,xord(e2)∈[0,ord(e1)−1]* and x1+…+xord(e2)≡1modord(e1).*
In this case, we say that S is of type I(a) or I(b) according to whether ord(e2)=m or ord(e2)=mn>m.
•
[TABLE]
where
(a)
{f1,f2}* is a generating set for G with ord(f2)=mn and ord(f1)>m,*
(b)
ϵ∈[1,m−1]* and
s∈[1,n−1],*
(c)
x1,…,xm−ϵ∈[1,m−1]* with x1+…+xm−ϵ=m−1,*
(d)
either s=1 or
mf1=mf2, with both holding when n=2, and
(e)
either ϵ≥2 or mf1=mf2.
In this case, we say that S is of type II.
Proof.
The characterization of minimal zero-sum sequences of maximal length over groups of rank two was done in a series of papers by Gao, Geroldinger, Grynkiewicz, Reiher, and Schmid. For the formulation used above we refer to [16, Main Proposition 7].
∎
Theorem 3.7**.**
Let H be a transfer Krull monoid over a finite abelian group G. If G has rank two, then Δρ(H)={1}.
Proof.
By (3.1), we may consider B(G) instead of H.
Let G=Cm⊕Cmn with n∈N, m≥2 and let S be a minimal zero-sum sequence of length D(G) over G. By Corollary 3.3.2, it suffices to prove that 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}. We distinguish two cases depending on Lemma 3.6.
CASE 1: S=e1ord(e1)−1∏i=1ord(e2)(xie1+e2) is of type I in Lemma 3.6, where (e1,e2) is a basis of G.
If x1=…=xord(e2), then ord(e2)x1≡1(modord(e1)) and hence gcd(ord(e1),ord(e2))=1, a contradiction.
Suppose that ∣{x1,…,xord(e2)}∣≥2. Then there exists a subsequence Y=y1⋅…⋅yord(e2) of X=x12⋅…⋅xord(e2)2 such that σ(Y)≡1(modord(e1)). Let σ(Y)≡ord(e1)−a(modord(e1)), where a∈[0,ord(e1)−2]. Then
[TABLE]
are two minimal zero-sum sequences with S2=e1ord(e1)⋅T1⋅T2 whence 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}.
CASE 2: S=f1sm−1f2(n−s)m+ϵ∏i=1m−ϵ(−xif1+f2) is of type II in Lemma 3.6, where (f1′,f2) is a basis with ord(f1′)=m, ord(f2)=mn and f1=f1′+αf2, α∈[1,mn−1].
Since sm−1+(n−s)m+ϵ=nm+ϵ−1≥nm, we have that 2\big{(}(n-s)m+\epsilon\big{)}\geq mn or 2(sm−1)≥mn. We distinguish two subcases.
CASE 2.1: 2((n−s)m+ϵ)≥mn.
Then S2=f2nm⋅f12sm−2f2nm−2sm+2ϵ∏i=1m−ϵ(−xif1+f2)2. It suffices to prove that
[TABLE]
where y1⋅…⋅y2m−2ϵ=x12⋅…⋅xm−ϵ2,
is a product of two atoms, since this implies that 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}.
Note that ∑i∈[1,2m−2ϵ]yi=2(∑i∈[1,m−ϵ]xi)=2m−2 and ∣W∣=mn+2m−2>D(G), whence W is not an atom.
Suppose that s=1. Then
[TABLE]
Let T be an atom dividing W, say
[TABLE]
[TABLE]
If r=∑i∈Iyi, then ∣I∣+r′≥mn which implies that I=[1,2m−2ϵ] and r′=nm−2m+2ϵ. Therefore WT−1∣(f1′+αf2)2m−2−r, a contradiction to ord(f1)=ord(f1′+αf2)>m. Thus ∣r−∑i∈Iyi∣=m.
Now we assume to the contrary that there exist three atoms T1,T2, and T3 such that T1T2T3∣W, say
[TABLE]
Then ∣r1−∑i∈I1yi∣=∣r2−∑i∈I2yi∣=∣r3−∑i∈I3yi∣=m, a contradiction to r1+r2+r3≤2m−2 and ∑i∈I1yi+∑i∈I2yi+∑i∈I3yi≤2m−2.
Suppose that s≥2. Then mf1=mf2 whence αm≡m(modmn).
Let T be an atom dividing W, say
[TABLE]
[TABLE]
If r=∑i∈Iyi, then nm≤∣I∣+r′≤2m−2ϵ+nm−2sm+2ϵ≤nm−2sm+2m which implies that s=1, a contradiction.
We claim that r−∑i∈Iyi∈{(2s−1)m,−m}.
If r<∑i∈Iyi, then ∑i∈Iyi−r=m. We assume that r>∑i∈Iyi. Then r−∑i∈Iyi∈{m,…,(2s−1)m}. Since ∣I∣+r′≤2m−2ϵ+nm−2sm+2ϵ=nm−2sm+2m and αm≡m(modmn), we have r−∑i∈Iyi∈{(2s−2)m,(2s−1)m}. If r−∑i∈Iyi=(2s−2)m, then ∣I∣+r′=2m−2ϵ+nm−2sm+2ϵ whence T=W, a contradiction. Therefore r−∑i∈Iyi∈{(2s−1)m,−m}.
Now we assume to the contrary that there exist three atoms T1,T2, and T3 such that T1T2T3∣W, say
[TABLE]
Then there exist two distinct i,j∈[1,3], say i=1,j=2, such that r1−∑i∈I1yi=r2−∑i∈I2yi=(2s−1)m. Thus 2sm−2≥r1+r2≥2(2s−1)m, a contradiction.
CASE 2.2: 2(sm−1)≥mn.
Then 2s≥n+1. Therefore mf1=mf2 which implies that αm≡m(modmn) and ord(f1)=mn.
Since S2=f1nm⋅f12sm−nm−2f22nm−2sm+2ϵ∏i=1m−ϵ(−xif1+f2)2, it suffices to prove that
[TABLE]
where y1⋅…⋅y2m−2ϵ=x12⋅…⋅xm−ϵ2,
is a product of two atoms since this implies that 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}. Note that ∑i∈[1,2m−2ϵ]yi=2(∑i∈[1,m−ϵ]xi)=2m−2, 2sm−nm−2<mn and ∣W∣=mn+2m−2>D(G) whence W is not an atom.
Let T be an atom dividing W, say
[TABLE]
[TABLE]
Suppose that 2s=n+1. Then
[TABLE]
and we assume to the contrary that there exist three atoms T1,T2, and T3 such that T1T2T3∣W, say
[TABLE]
Then there exist two distinct i,j∈[1,3], say i=1,j=2, such that r1−∑i∈I1yi=r2−∑i∈I2yi=0. Thus 2nm≤∣I1∣+r1′+∣I2∣+r2′<(n−1)m+2ϵ+2m−2ϵ=nm+m, a contradiction.
Suppose that 2s≥n+2. Consider the atom T.
If r=∑i∈Iyi, then nm≤∣I∣+r′≤2m−2ϵ+2nm−2sm+2ϵ≤(2n−2s+2)m≤nm. Therefore I=[1,2m−2ϵ] and r′=2nm−2sm+2ϵ which infers that T=W, a contradiction.
We claim that r−∑i∈Iyi∈{(2s−n−1)m,−m}.
If r<∑i∈Iyi, then ∑i∈Iyi−r=m. We assume that r>∑i∈Iyi. Then r−∑i∈Iyi∈{m,…,(2s−n−1)m}. Since ∣I∣+r′≤2m−2ϵ+2nm−2sm+2ϵ≤(2n−2s+2)m and αm≡m(modmn), we have r−∑i∈Iyi∈{(2s−n−2)m,(2s−n−1)m}. If r−∑i∈Iyi=(2s−n−2)m, then I=[1,2m−2ϵ] and r′=2nm−2sm+2ϵ which infers that T=W, a contradiction. Therefore r−∑i∈Iyi∈{(2s−n−1)m,−m}.
Assume to the contrary that there exist three atoms T1,T2, and T3 such that T1T2T3∣W, say
[TABLE]
Then there exist two distinct i,j∈[1,3], say i=1,j=2, such that r1−∑i∈I1yi=r2−∑i∈I2yi=(2s−n−1)m. Thus 2sm−nm−2≥r1+r2≥2(2s−n−1)m and hence (n+2)m−2≥2sm≥(n+2)m, a contradiction.
∎
The characterization of all minimal zero-sum sequences over groups C2⊕C2⊕C2n, as given in the next lemma, is due to Schmid ([33, Theorem 3.13]).
Lemma 3.8**.**
Let G=C2⊕C2⊕C2n with n≥2. Then A∈F(G) is a minimal zero-
sum sequence of length D(G) if and only if there exists a basis (f1,f2,f3) of G, where
ord(f1)=ord(f2)=2 and ord(f3)=2n, such that A is equal to one of the following sequences :**
(i)
f3v3(f3+f2)v2(f3+f1)v1(−f3+f2+f1)* with v1,v2,v3∈N odd, v3≥v2≥v1, and v3+v2+v1=2n+1.*
2. (ii)
f3v3(f3+f2)v2(af3+f1)(−af3+f2+f1)* with v2,v3∈N odd, v3≥v2, v2+v3=2n, and a∈[2,n−1].*
3. (iii)
f32n−1(af3+f2)(bf3+f1)(cf3+f2+f1)* with a+b+c=2n+1 where a≤b≤c and a,b∈[2,n−1], c∈[2,2n−3]∖{n,n+1}.*
4. (iv)
f_{3}^{2n-1-2v}(f_{3}+f_{2})^{2v}f_{2}(af_{3}+f_{1})\big{(}(1-a)f_{3}+f_{2}+f_{1}\big{)}* with v∈[0,n−1] and a∈[2,n−1].*
5. (v)
f_{3}^{2n-2}(af_{3}+f_{2})\big{(}(1-a)f_{3}+f_{2}\big{)}(bf_{3}+f_{1})\big{(}(1-b)f_{3}+f_{1}\big{)}* with a,b∈[2,n−1] and a≥b.*
6. (vi)
(∏i=12n(f3+di))f2f1* where S=∏i=12ndi∈F(⟨f1,f2⟩) with σ(S)=f1+f2.*
Theorem 3.9**.**
Let H be a transfer Krull monoid over a group G where G≅C2⊕C2⊕C2n with n≥2. Then Δρ(H)={1}.
Proof.
By (3.1), we may consider B(G) instead of H.
Let S be a minimal zero-sum sequence of length D(G) over G. By Corollary 3.3.2, it suffices to prove that 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}. We distinguish five cases induced by the structural description given by Lemma 3.8, and use Lemma 3.4.1 without further mention.
CASE 1: S=f3v3(f3+f2)v2(af3+f1)(−af3+f2+f1) with a∈[1,n−1] as in Lemma 3.8.(i) or (ii).
Since
[TABLE]
and
[TABLE]
we obtain that 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}.
CASE 2: S=f32n−1(af3+f2)(bf3+f1)(cf3+f2+f1) as in Lemma 3.8.(iii).
Suppose that c≥n+2. Then S2=f32n⋅f32n−2a(af3+f2)2⋅f32a−2(bf3+f1)2(cf3+f2+f1)2, where f32n−2a(af3+f2)2 and f32a−2(bf3+f1)2(cf3+f2+f1)2 are atoms, and hence 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}.
Suppose that c≤n−1. Then
[TABLE]
and W=(−f3)(af3+f2)(bf3+f1)(cf3+f2+f1) are atoms with W_{1}W_{2}W_{3}=W^{2}\cdot\big{(}(-f_{3})^{2n}\big{)}^{2} whence 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}.
CASE 3: S=f_{3}^{2n-1-2v}(f_{3}+f_{2})^{2v}f_{2}(af_{3}+f_{1})\big{(}(1-a)f_{3}+f_{2}+f_{1}\big{)} as in Lemma 3.8.(iv).
Then {f3,−f3,f2,af3+f1,(1−a)f3+f2+f1}⊂supp((−S)S).
Since W=(-f_{3})f_{2}(af_{3}+f_{1})\big{(}(1-a)f_{3}+f_{2}+f_{1}\big{)} is an atom of length 4, we have that \min\Delta\big{(}\operatorname{supp}((-S)S)\big{)}\,|\,2.
Setting
[TABLE]
we observe that W1W2(f2)2=W2(f3(−f3))2a−2. Therefore \min\Delta\big{(}\operatorname{supp}((-S)S)\big{)}\,|\,2a-3 which implies that \min\Delta\big{(}\operatorname{supp}((-S)S)\big{)}=1.
CASE 4: S=f_{3}^{2n-2}(af_{3}+f_{2})\big{(}(1-a)f_{3}+f_{2}\big{)}(bf_{3}+f_{1})\big{(}(1-b)f_{3}+f_{1}\big{)} as in Lemma 3.8.(v).
Since (-f_{3})(af_{3}+f_{2})\big{(}(1-a)f_{3}+f_{2}\big{)} is an atom of length 3 over supp((−S)S), we have that 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}.
CASE 5: S=(∏i=12n(f3+di))f2f1 with T=∏i=12ndi and σ(T)=f1+f2 as in Lemma 3.8.(vi).
Since σ(T)=0, we have ∣supp(T)∣≥2, say d1=d2. If d1+d2∈{f1,f2}, then (f3+d1)(−f3+d2)(d1+d2) is an atom of length 3 over supp((−S)S) which implies that 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}. If d1+d2=f1+f2, then W1=(f3+d1)(−f3+d2)f1f2 and W2=(f3+d1)2(−f3+d2)2 are atoms with W12=W⋅f12⋅f22 whence 1\in\Delta\big{(}\operatorname{supp}((-S)S)\big{)}.
∎
Lemma 3.10**.**
Let G be a finite abelian group with rank r(G)≥2 and exp(G)≥3, and let U∈A(G) with ∣U∣=D(G). If there exist independent elements e1,…,et with t≥2 and an element g such that {e1,…,et,g}⊂supp(U) and ag=k1e1+…+ktet for some a∈[1,ord(g)−1]∖{2ord(g)} and with ki∈[1,ord(ei)−1] for all i∈[1,t], then \min\Delta\big{(}\operatorname{supp}((-U)U)\big{)}=1. In particular, if supp(U) contains a basis of G, then \min\Delta\big{(}\operatorname{supp}((-U)U)\big{)}=1.
Proof.
Let (e1,…,et) be independent with t≥2 and let g∈G such that {e1,…,et,g}⊂supp(U) and ag=k1e1+…+ktet for some a∈[1,ord(g)−1]∖{2ord(g)} and with ki∈[1,ord(ei)−1] for every i∈[1,t].
Now we assume that a∈[1,ord(g)−1]∖{2ord(g)} is minimal such that ag∈⟨e1,…,et⟩ which implies that a∣ord(g) and hence a∈[1,⌊2ord(g)⌋−1]. For every i∈[1,t],
we replace ei by −ei, if necessary, in order to obtain ki≤ord(ei)/2. Thus we obtain that {e1,…,et}⊂supp((−U)U) such that ag=k1e1+…+ktet with ki∈[1,⌊ord(ei)/2⌋] for every i∈[1,t]. Since a=2ord(g), there exists i∈[1,t], say i=1, such that k1=ord(e1)/2. Now we distinguish two cases.
CASE 1: For all i∈[1,t], we have ki=ord(ei)/2.
Then, by the minimality of a,
[TABLE]
are atoms over supp((−U)U). Since W12=W2⋅e1ord(e1)⋅e2ord(e2), we infer that 1\in\Delta\big{(}\operatorname{supp}((-U)U)\big{)} which implies that \min\Delta\big{(}\operatorname{supp}((-U)U)\big{)}=1.
CASE 2: There exists i∈[2,t] such that ki=ord(ei)/2.
After renumbering if necessary, there exists t0∈[1,t−1] such that ki=ord(ei)/2 for every i∈[1,t0] and ki=ord(ei)/2 for every i∈[t0+1,t]. Then
[TABLE]
are atoms over supp((−U)U). Since
[TABLE]
and g2a∏i∈[1,t0](−ei)2ki,g2ae1ord(e1)−2k1∏i∈[2,t0](−ei)2ki are atoms,
we infer that
To show the in particular part, let {e1,…,et}⊂supp(U) be a basis of G, and note that t≥r(G) by [17, Lemma A.6]. For each i∈[1,t], we set Ii={g∈supp(U)∣g∈⟨ei⟩} and Ti=∏g∈Iigvg(U). Then
[TABLE]
Therefore for every g∈supp(T), there exists a subset J⊂[1,t] with ∣J∣≥2 such that g=∑j∈Jkjej, where kj∈[1,ord(ej)−1] for each j∈J. If ord(g)=2 for some g∈supp(T), then the assumptions of the main case hold whence \min\Delta\big{(}\operatorname{supp}((-U)U)\big{)}=1.
Now suppose that ord(g)=2 for each g∈supp(T). Then σ(T1)⋅…⋅σ(Tt)σ(T) is an atom, ord(σ(T))=2, and σ(Ti)∈⟨ei⟩ for each i∈[1,t]. It follows that σ(Ti)=2ord(ei)ei for each i∈[1,t], ∣T∣=1, and σ(T)=2ord(e1)e1+…+2ord(et)et. Since ∣U∣=D(G)≥D∗(G)≥1+∑j=1t(ord(ej)−1) by [17, Proposition 5.1.7], we have ∣Tj∣=ord(ej)−1 for each i∈[1,t].
Since exp(G)≥3, we may assume that ord(e1)≥3 after renumbering if necessary.
Since e1∈supp(T1) and T1 is a zero-sum free sequence over ⟨e1⟩ of length ord(e1)−1, we obtain σ(T1)=−e1=2ord(e1)e1 by [17, Theorem 5.1.10], a contradiction to ord(e1)≥3.
∎
Theorem 3.11**.**
Let H be a transfer Krull monoid over a group G where G=Cpkr with k,r∈N, r≥2, and p∈P such that pk≥3. Then Δρ(H)={1}.
Proof.
By (3.1), it is sufficient to consider B(G) instead of H.
By Corollary 3.3.2, we only need to show that \min\Delta\big{(}\operatorname{supp}((-U)U)\big{)}=1 for every atom U∈A(G) of length D(G).
Let U be an atom of length D(G). Then ⟨supp(U)⟩=G by [17, Proposition 5.1.4], and hence supp(U) contains a basis of G by [17, Lemma A.7]. Now Lemma 3.10 implies that \min\Delta\big{(}\operatorname{supp}((-U)U)\big{)}=1.
∎
If G is an elementary 2-group of rank r≥3, then the above assumption of Lemma 3.10 never holds true. Thus elementary 2-groups need a different approach.
Lemma 3.12**.**
Let G be an elementary 2-group of rank r≥3 and let U,V∈A(G) be distinct atoms of length D(G). Then 1∈Δ(L(UV2)).
Proof.
Since U and V are distinct, there exists an element g∈supp(U)∖supp(V), and clearly supp(U)∖{g} is a basis of G. We set supp(U)∖{g}={e1,…,er}, g=e0=e1+…+er, and then U=e0e1⋅…⋅er. Since {e1,…,er} is a basis of G, V can be written in the form V=eI1⋅…⋅eIr+1, where ∅=Ij⊂[1,r] and eIj=∑i∈Ijei for every j∈[1,r+1]. We continue with the following assertion.
A.
There exist two distinct k1,k2∈[1,r+1] such that Ik1∩Ik2=∅, Ik1∖Ik2=∅, and Ik2∖Ik1=∅.
Proof ofA. First, we choose I, say I=I1, to be maximal in {Ij∣j∈[1,r+1]}. Note that e0∈supp(V) and hence Ij=[1,r] for every j∈[1,r+1]. Since I1⊂∪j∈[2,r+1]Ij, we can choose K⊂[2,r+1] to be minimal such that I1⊂∪j∈KIj. Then I∩Ik=∅ and I∖Ik=∅ for all k∈K. If there exists k∈K such that Ik∖I1=∅, then we are done. Otherwise, Ik⊂I1 for all k∈K. By the maximality of I1, we know that ∣K∣≥2 and by the minimality of K, we have that Ik1∖Ik2=∅ and Ik2∖Ik1=∅ for every two distinct k1 and k2. Assume to the contrary that Ik1∩Ik2=∅ for every distinct k1 and k2. Thus eI1∏k∈KeIk is an atom, a contradiction to ∣V∣=D(G). ∎[Proof of A]
After renumbering if necessary, we suppose that I1∩I2=∅, I1∖I2=∅, and I2∖I1=∅. We define
[TABLE]
and observe that W1,W2 are atoms. Since
[TABLE]
we obtain that 1∈Δ(L(UV2)).
∎
Theorem 3.13**.**
Let H be a transfer Krull monoid over an elementary 2-group G of rank r≥2. Then Δρ∗(H)=Δρ(H)={1,r−1}.
Proof.
By (3.1), it is sufficient to consider B(G) instead of H.
Let (e1,…,er) be a basis of G and S=e0e1⋅…⋅er∈A(G), where e0=e1+…+er. Then \Delta\big{(}\operatorname{supp}(S)\big{)}=\{r-1\} and hence r−1∈Δρ∗(G). By Theorem 3.5, we have that Δρ(G)⊃Δρ∗(G)⊃{1,r−1}. Thus it remains to prove that Δρ(G)⊂{1,r−1}.
Since maxΔρ(G)≤maxΔ(G)=r−1 by [17, Theorem 6.7.1], we may suppose that r≥4. Assume to the contrary that there exists d∈Δρ(G)∖{1,r−1}.
Then for every k∈N there is a Bk∈B(G) such that \rho\big{(}\mathsf{L}(B_{k})\big{)}=\mathsf{D}(G)/2 and L(Bk) is an AAP with difference d and length ℓ≥k. Lemma 3.2.1 implies that Bk is a product of atoms having length D(G). We fix k=∣{A∈A(G)∣∣A∣=D(G)}∣+1. If Bk=Ut with t∈N for some U∈A(G) with ∣U∣=D(G), then r-1=\min\Delta\big{(}\operatorname{supp}(U)\big{)}=\min\Delta\big{(}\operatorname{supp}(B_{k})\big{)}\,|\,d, a contradiction. Otherwise, the choice of k implies that there are distinct atoms U,V∈A(G) with ∣U∣=∣V∣=D(G) such that U2V∣Bk. By Lemma 3.12, 1∈Δ(L(U2V))⊂Δ(L(Bk)) and hence d∣1, a contradiction.
∎
Theorem 3.14**.**
Let H be a transfer Krull monoid over a finite cyclic group G of order n≥3. Then n−2∈Δρ∗(H)=Δρ(H).
Proof.
By (3.1), it is sufficient to consider B(G) instead of H.
Since n−2∈Δρ∗(G)⊂Δρ(G), it remains to verify that Δρ(G)⊂Δρ∗(G).
Let d∈Δρ(G). Then for every k∈N there is a Bk∈B(G) such that \rho\big{(}\mathsf{L}(B_{k})\big{)}=\mathsf{D}(G)/2 and L(Bk) is an AAP with difference d and length ℓ≥k. Thus gcdΔ(L(Bk))=d.
We set k=n(n−1)+1, G0=supp(Bk), and claim that minΔ(G0)=gcdΔ(L(Bk)) which implies that d=minΔ(G0)∈Δρ∗(G).
Clearly, minΔ(G0)∣d, and hence it remains to prove that d∣minΔ(G0).
By Lemma 3.2, Bk is a product of atoms having length D(G)=n. Note that ∣supp(U)∣=1 for all atoms of length n and ∣{U∈A(G)∣∣U∣=n}∣≤n−1.
Thus k=n(n−1)+1 implies that Bk is a product of the form
[TABLE]
where r∈N, U1,…,Ur are atoms of length n, and U1=gn, where g∈G with ord(g)=n.
Then for every atom V∈A(G0), we have V∣U1⋅…⋅Ur and {n+1,∥V∥g+n}⊂L(U1nV). Therefore d∣∥V∥g−1 for all V∈A(G0) whence d divides gcd{∥V∥g−1∣V∈A(G0)}. Since minΔ(G0)=gcd{∥V∥g−1∣V∈A(G0)} by Lemma 3.4.3, the claim follows.
∎
Corollary 3.15**.**
We have Δρ(C4)={2}, Δρ(C5)={1,3}, Δρ(C6)={4}, Δρ(C7)={1,5}, Δρ(C8)={1,6}, Δρ(C9)={1,7},
Δρ(C10)={2,8}, Δρ(C11)={1,9}, Δρ(C12)={1,10}.
Proof.
Let G be a cyclic group of order ∣G∣=n∈[4,12]. By Theorem 3.14, we infer that n−2∈Δρ∗(G)=Δρ(G). By Theorem 3.5, we have 1∈Δρ(G) if and only if n∈/{4,6,10}. Lemma 3.2 shows that
[TABLE]
Now we use Lemma 3.4.3.
If n∈{4,6}, then for some g∈G with ord(g)=n we get
[TABLE]
If n=10, then for some g∈G with ord(g)=n we get
[TABLE]
Suppose that n∈[4,12]∖{4,6,10]. Let G0⊂G be a subset consisting of elements of order n and with G0=−G0. If ∣G0∣=2, then minΔ(G0)=n−2. Suppose that ∣G0∣>2. Then there is some g∈G0 and some k∈N with gcd(k,n)=1 such that {g,−g,kg,−kg}⊂G0. Then minΔ(G0) divides minΔ({g,−g,kg,−kg}) and, by going through all cases and using Lemma 3.4.3, we obtain that minΔ({g,−g,kg,−kg})=1. Thus the assertion follows.
∎
In the next lemma we need some basics from the theory of continued fractions (see [29] for some background; in particular, we use Theorems 2.1.3 and 2.1.7 of [29]).
Lemma 3.16**.**
Let G be a cyclic group with order n>3, g∈G with ord(g)=n, and a∈[2,n−1] with gcd(a,n)=1. Let [a0,…,am] be the continued fraction expansion of n/a with odd length (i.e. m is even).
minΔ({g,ag})=gcd(a1,a3,…,am−1)<n−2* and minΔ({g,−g,ag,−ag})∈Δρ∗(G).*
2. 2.
If a<n/2, then minΔ({g,ag,−ag,−g})=gcd(a0−1,a1,…,am−1,am−1). Note that this also holds for the continued fraction expansion of n/a with even length and hence this holds for the regular continued fraction expansion of n/a (i.e. am>1).
Proof.
For the first part, see [7, Theorem 2.1] or [14, Theorem 1]. For the second part, since gn and (ag)n are two atoms of length D(G), we obtain \rho\big{(}\mathsf{L}(g^{n}(-g)^{n}(ag)^{n}(-ag)^{n})\big{)}=\mathsf{D}(G)/2 which implies
minΔ({g,−g,ag,−ag})∈Δρ∗(G) by Lemma 3.2.3.
Since the continued fraction of n−an with odd length is
[TABLE]
implies that minΔ({g,ag})=gcd(a1,a3,…,am−1) and
[TABLE]
Therefore, we obtain
[TABLE]
∎
Theorem 3.17**.**
Let H be a transfer Krull monoid over a finite cyclic group G of order n≥3.
Then the following statements are equivalent :**
(a)
Δρ∗(H)∖{1,n−2}=∅.
2. (b)
There is an a∈[2,⌊n/2⌋] with gcd(n,a)=1 such that gcd(a0−1,a1,…,am−1,am−1)>1, where [a0,a1,…,am] is the regular continued fraction expansion of n/a (i.e. am>1).
Proof.
By (3.1), it is sufficient to prove the equivalence for B(G) instead of H.
(a) ⇒ (b) Note that for any distinct atoms U,V of length n, we have \min\Delta\big{(}\operatorname{supp}((-U)U(-V)V)\big{)}<n-2 by Lemma 3.16.1. Since Δρ∗(H)∖{1,n−2}=∅, there must exist distinct atoms U,V of length n such that \min\Delta\big{(}\operatorname{supp}((-U)U(-V)V)\big{)}\in\Delta_{\rho}^{*}(G)\setminus\{1,n-2\}. Let U=gn and V=(ag)n, where g∈G and a∈[2,n−2] with gcd(n,a)=1. Then let G0={g,ag,−g,−ag}. If a≥2n, then n−a≤2n. Thus we assume that a≤2n. Therefore Lemma 3.16.2 implies that gcd(a0−1,a1,…,am−1,am−1)>1, where [a0,a1,…,am] is the regular continued fraction expansion of n/a.
(b) ⇒ (a) We set G0={g,ag,−g,−ag} where g∈G with ord(g)=n. Then minΔ(G0)<n−2 and Lemma 3.16.2 implies that minΔ(G0)>1. It follows that Δρ∗(H)∖{1,n−2}=∅.
∎
Corollary 3.18**.**
Let G be a cyclic group of order n>4, and let g∈G with ord(g)=n.
If n is even and n−1 is not a prime, then there is an even d∈Δρ∗(G)∖{1,n−2}.
2. 2.
If n is even, 3∣n, and n−3 is not a prime, then there is an even d∈Δρ∗(G)∖{1,n−2}.
3. 3.
If n is even and n≡2q(modq2) for some odd prime q with q2+2q≤n, then there is an even d∈Δρ∗(G)∖{1,n−2}.
4. 4.
If n is even and n≡q(mod2q+1) for some odd q with 5q+2≤n, then there is an even d∈Δρ∗(G)∖{1,n−2}.
5. 5.
*If n is even with n∈[8,109], then Δρ∗(G)={1,n−2} if and only if *
If n>5 is odd and n−1 is a square, then there is an odd d∈Δρ∗(G)∖{1,n−2}.
Proof.
Note that if a∈[2,n−1] with gcd(a,n)=1, then minΔ({g,ag,−g,−ag})∈Δρ∗(G) and minΔ({g,ag,−g,−ag})<n−2 by Lemma 3.16.1.
Let n=mt+1 be even with m∈[2,n−2], and set G0={g,mg,−mg,−g}. Then m,t are odd, gcd(m,n)=1, and m<n/2. Since [t,m] is the regular continued fraction of n/m, we have that minΔ(G0)=gcd(m−1,t−1) is even and hence minΔ(G0)∈Δρ∗(G)∖{1,n−2}.
If n≡1(mod3), then n−1 is not a prime and hence 1. implies the assertion. Suppose n≡2(mod3) and let n−3=m1m2 with 1<m1<n−3. Then there exists i∈[1,2], say i=1, such that m1≡1(mod3). Set G0={g,m1g,−m1g,−g}. Since n is even, we obtain that m1,m2 are odd and hence ⌊3m1⌋ is even. Since [m2,⌊3m1⌋,3] is the regular continued fraction of n/m, we have that minΔ(G0)=gcd(m2−1,⌊3m1⌋,2)=2 by Lemma 3.16.1 and hence minΔ(G0)∈Δρ∗(G)∖{1,n−2}.
Let n=q2t+2q be even with m=qt+1, and set G0={g,mg,−mg,−g}. Then n=qm+q and t≥1 is even.
Since [q,t,q] is the regular continued fraction of n/m, we have that minΔ(G0)=gcd(q−1,t,q−1) is even by Lemma 3.16.1 and hence minΔ(G0)∈Δρ∗(G)∖{1,n−2}.
Let n=(2q+1)t+q be even with t odd, and set G0={g,(2q+1)g,−(2q+1)g,−g}. Then gcd(2q+1,n)=1 and 5q+2≤n implies that 2q+1<n/2. Since [t,2,q] is the regular continued fraction of n/(2q+1), we have that minΔ(G0)=gcd(t−1,2,q−1)=2 by Lemma 3.16.1 and hence minΔ(G0)∈Δρ∗(G)∖{1,n−2}.
This was done by a computer program.
Let n=m2+1 be odd, and set G0={g,mg,−mg,−g}. Then m is even. Since [m,m] is the regular continued fraction of n/m, we have that minΔ(G0)=gcd(m−1,m−1)=m−1>1 is odd by Lemma 3.16.1 and hence minΔ(G0)∈Δρ∗(G)∖{1,n−2}.
∎
Next we discuss an application of Theorem 3.17 to the so-called
Characterization Problem which is in the center of all arithmetical investigations of transfer Krull monoids. It asks whether two finite abelian groups G with D(G)≥4 and G′, whose systems of sets of lengths L(G) and L(G′) coincide, have to be isomorphic (for an overview on this topic we refer [15, Section 6]). It is well-known that for every n≥4, the systems L(Cn) and L(C2n−1) are distinct and that L(C2n−1)⊂L(Cn) ([21, Theorem 3.5]).
If n∈[4,5], then L(Cn)⊂L(C2n−1) ([21, Section 4]), but for n≥6 there is no information available so far. The results of the present section yield the following corollary.
Corollary 3.19**.**
Let G be a cyclic group of order n≥6. If the equivalent statements in Theorem 3.17 hold, then L(Cn)⊂L(C2n−1).
Comment. Note that Corollary 3.18 shows that the equivalent statements in Theorem 3.17 hold true for infinitely many n∈N.
Proof.
Assume to the contrary that L(Cn)⊂L(C2n−1). Then Δρ(Cn)⊂Δρ(C2n−1). Since Δρ(C2n−1)={1,n−2} by Theorem 3.13, we obtain a contradiction to Theorem 3.17.
∎
We end this section with the following conjecture (note, if G is cyclic of order three or isomorphic to C2⊕C2, then Δρ(G)={1}).
Conjecture 3.20**.**
Let H be a transfer Krull monoid over a finite abelian group G with ∣G∣>4. Then Δρ(H)={1} if and only if G is neither cyclic nor an elementary 2-group.
We summarize what follows so far by the results of the present section. Clearly, one implication of Conjecture 3.20 holds true. Indeed,
if G is cyclic or an elementary 2-group with ∣G∣>4, then Δρ(H)={1} by Theorems 3.13 and 3.14. Conversely, for groups of rank two, and for groups isomorphic either to C2⊕C2⊕C2n or to Cpkr, where n,r≥2, k≥1, and p is a prime with pk≥3, the conjecture holds true by Theorems 3.7, 3.9, and 3.11 (consequently, the conjecture holds true for all groups G with ∣G∣∈[5,47]). In view of our discussion (preceding Lemma 3.2) on the state of the art on the Davenport constant, Conjecture 3.20 might seem to be quite bold, but it is consistent with all what we know on the Davenport constant so far. Indeed, let U∈A(G) with ∣U∣=D(G). The goal is to show that \min\Delta\big{(}\operatorname{supp}((-U)U)\big{)}=1. By [17, Proposition 5.1.11], supp(U) contains a generating set of G. If it contains a basis, then we are done by Lemma 3.10.
Suppose G is as in (3.2) with D(G)=D∗(G), r(G)=r>1, and (e1,…,er) is a basis with ord(ei)=ni for all i∈[1,r]. Then
[TABLE]
is the canonical example of a minimal zero-sum sequence of length D∗(G). Clearly, there are minimal zero-sum sequences of different form (as Lemma 3.6 shows for r=2) but their support can only be greater than or equal to r(G)+1 (recall that r(G)=min{∣G0∣∣G0⊂Gis a generating set} by [17, Lemma A.6]). Furthermore, for subsets G0⊂G1 of G, we have minΔ(G1)≤minΔ(G0). The combination of these two facts provides strong support for the above conjecture.
4. Weakly Krull monoids
The main goal in this section is to study the set Δρ(⋅) for v-noetherian weakly Krull monoids and for their monoids of v-invertible v-ideals. Our main result is given by Theorem 4.4.
We start with the local case, namely with finitely primary monoids.
A monoid H is said to be finitely primary if there are s,α∈N and a factorial monoid F=F××F({p1,…,ps}) such that H⊂F with
[TABLE]
In this case s is called the rank of H and α is called an exponent of H. It is well-known ([17, Theorems 2.9.2 and 3.1.5]) that F is the complete integral closure of H, that
[TABLE]
and that
[TABLE]
To provide some examples of finitely primary monoids, we first recall that
every numerical monoid H⊊(N0,+) is finitely generated and finitely primary of rank one with accepted elasticity ρ(H)>1. Furthermore, if R is a one-dimensional local Mori domain, R its complete integral closure, and (R:R)={0}, then its multiplicative monoid of non-zero elements is finitely primary ([17, Sections 2.9, 2.10, and 3.1]). Note that a finitely primary monoid H with ρ(H)>1 is not a transfer Krull monoid by [21, Theorem 5.5].
Our first lemma is known for numerical monoids ([9, Theorem 2.1] and [6, Proposition 2.9]).
Lemma 4.1**.**
Let H⊂F=F××F({p}) be a finitely primary monoid of rank 1 and exponent α, and let v=vp:H→N0 denote the homomorphism onto the value semigroup of H. Suppose that {v(a)∣a∈A(H)}={n1,…,ns} with 1≤n1<…<ns.
Then v(H)⊂N0 is a numerical monoid, and we have
ρ(H)=ns/n1, and if F×/H× is a torsion group, then the elasticity is accepted.
2. 2.
Let d=gcd{ni−ni−1∣i∈[2,s]}. Then d∣gcdΔ(H) and if ∣F×/H×∣=1, then d=gcdΔ(H).
Proof.
If a∈A(H), then pαF⊂H (see (4.1)) implies v(a)≤2α−1, and hence ns≤2α−1. Since N≥α⊂v(H), it follows that v(H)⊂N0 is a numerical monoid.
To show that ρ(H)≤ns/n1, let a∈H be given and suppose that a=u1⋅…⋅uk=v1⋅…⋅vℓ where k,ℓ∈N and u1,…,uk,v1,…,vℓ∈A(H). Then
[TABLE]
whence ℓ/k≤ns/n1 and thus ρ(L(a))≤ns/n1.
To show that ρ(H)=ns/n1, let u1=ϵ1pn1,u2=ϵ2pns∈A(H) with ϵ1,ϵ2∈F×, and let s∈N0 such that sn1ns≥α. Then for every k>s we have
[TABLE]
Thus
[TABLE]
tends to ns/n1 as k tends to infinity.
Now suppose that F×/H× is a torsion group, and let u1,u2 be as above. Then there is a k0∈N such that (ϵ2n1ϵ1−ns)k0∈H×. Then the above calculation with k=k0 and s=0 shows that ρ(L(u2k0n1))=ns/n1.
For every i∈[1,s] there are ti∈N0 such that ni=n1+tid. Since pαF⊂H, it follows that gcd(n1,d)=1. Let a∈H and consider two factorizations
[TABLE]
where all ui,j,vi,j are (not necessarily distinct) atoms with v(ui,j)=ni=v(vi,j) for all i∈[1,s]. Then
[TABLE]
whence
[TABLE]
and this implies that d divides ∑i=1s(ℓi−ki). Thus d divides gcdΔ(H)=minΔ(H).
Now suppose that F×=H×. We show that gcdΔ(H) divides ni−ni−1 for every i∈[2,s] which implies that gcdΔ(H) divides d and equality follows. Let i∈[2,s]. Then there are atoms ui−1=ϵi−1pni−1 and ui=ϵipni with ϵi−1,ϵi∈F×=H×. Then
[TABLE]
where η=ϵini−1ϵi−1−ni∈H×. Thus gcdΔ(H) divides ni−ni−1.
∎
We continue with simple examples showing that the elasticity need not be accepted if F×/H× fails to be a torsion group, and that d need not be equal to minΔ(H).
Example 4.2**.**
Let H⊂F be a finitely primary monoid as in (4.1), and generated by {ϵ1p2,ϵ2p4,ϵp3∣ϵ∈F×}, where ϵ1,ϵ2∈F× with ord(ϵ1)=∞ and ord(ϵ2)<∞. We assert that ρ(H) is not accepted.
First, we observe that A(H)={ϵ1p2,ϵ2p4,ϵp3∣ϵ∈F×}. Thus Lemma 4.1.1 implies that ρ(H)=2. For every b∈H, we have v(b)≤4minL(b) and v(b)≥2maxL(b) which infer that ρ(L(b))≤2. Assume to the contrary that ρ(L(b))=2. Then v(b)=4minL(b)=2maxL(b) which implies that
b=(ϵ2p4)minL(b)=(ϵ1p2)maxL(b). It follows that ϵ2minL(b)=ϵ12minL(b), a contradiction to our assumption on ord(ϵ1) and ord(ϵ2). Therefore ρ(L(b))<2 for all b∈H whence ρ(H) is not accepted.
Let F×={ϵ} with ϵ2=1, and H=⟨ϵp3,p5⟩⊂F=F××F({p}). Then minΔ(H)=4>2=d, where d as in Lemma 4.1.2.
Lemma 4.3**.**
Let H be a finitely primary monoid with accepted elasticity ρ(H)>1. Then Δρ∗(H)=Δρ(H)=Δ1(H)={minΔ(H)}.
2. 2.
Let H=H1×…×Hn where n∈N and Hi is a finitely primary monoid with accepted elasticity and minΔ(Hi)=di for all i∈[1,n].
Suppose that ρ(H1)=…=ρ(Hs)=ρ(H)>ρ(Hi) for all i∈[s+1,n]. Then minΔρ(H)=minΔρ∗(H)=gcd(d1,…,ds), maxΔρ(H)=maxΔρ∗(H), and
If a∈H with ρ(L(a))=ρ(H)>1, then a∈H∖H× and hence [[a]]=H. Thus it remains to show that Δ1(H)={minΔ(H)}, which follows from [17, Theorem 4.3.6].
Without restriction we may suppose that H is reduced. Then also H1,…,Hn are reduced. We use Lemma 2.6. Note that H1,…,Hn need not be finitely generated whence Lemma 2.4.3 cannot be applied to the present setting.
Let a=a1⋅…⋅an∈H with ai∈Hi for all i∈[1,n]. If ρ(L(a))=ρ(H), then as+1=…=an=1 and
[TABLE]
For every i∈[1,s], 1. implies that Δρ(Hi)={di}. If ∅=I⊂[1,s], then [17, Proposition 1.4.5] implies that
[TABLE]
and clearly
[TABLE]
Thus we obtain that (the first equality follows from Lemma 2.2.2)
[TABLE]
Since Δρ(H)=Δρ(H1×…×Hs), minΔ(H1×…×Hs)=gcd(d1,…,ds), and minΔρ∗(H)=gcd(d1,…,ds), it follows that minΔρ(H)=gcd(d1,…,ds).
Lemma 2.4.1 implies that Δρ∗(H)⊂Δρ(H), and it remains to show that \Delta_{\rho}(H)\subset\big{\{}d\in\mathbb{N}\mid d\ \text{divides some}\ d^{\prime}\in\Delta_{\rho}^{*}(H)\big{\}}. If this holds, then we immediately get that maxΔρ(H)=maxΔρ∗(H).
Now let d∈Δρ(H) be given. We claim that d divides some element from Δρ∗(H).
For every k∈N there is some a(k)∈H such that L(a(k)) is an AAP with difference d, length at least k, and with \rho\big{(}\mathsf{L}(a^{(k)})\big{)}=\rho(H). Let k∈N. Then a(k)=a1(k)⋅…⋅as(k) with ai(k)∈Hi and \rho\big{(}\mathsf{L}(a_{i}^{(k)})\big{)}=\rho(H_{i})=\rho(H) for all i∈[1,s]. Then there is a subsequence b(ℓ)=a(kℓ) of a(k), a nonempty subset I⊂[1,s], say I=[1,r], and a constant M such that the following holds for every k∈N.
•
For every i∈[1,r], L(bi(k)) is an AAP with difference di, length at least k, and with \rho\big{(}\mathsf{L}(B_{i}^{(k)})\big{)}=\rho(H).
•
For every i∈[r+1,s], ∣L(bi(k))∣≤M.
Thus L(b1(k)⋅…⋅br(k))=L(b1(k))+…+L(br(k)) is an AAP with difference gcd(d1,…,dr)∈Δρ∗(H) and length growing with k. Since L(b(k)) is an AAP with difference d, it follows that d divides gcd(d1,…,dr).
∎
For our discussion of weakly Krull monoids we put together some notation and gather their main properties. For any undefined notion we refer to [28, 17]. In the remainder of this sections all monoids are commutative and cancellative and by a domain we always mean a commutative integral domain. If R is a domain, then its semigroup R∙=R∖{0} of non-zero elements is a monoid.
Let H be a monoid. Then q(H) denotes its quotient group,
[TABLE]
its complete integral closure, and (H:H)={x∈q(H)∣xH⊂H} the conductor of H. Furthermore, Hred={aH×∣a∈H} is the associated reduced monoid of H and X(H) is the set of minimal non-empty prime s-ideals of H. Let Iv∗(H) denote the monoid of v-invertible v-ideals of H (together with v-multiplication). Then \mathcal{F}_{v}(H)^{\times}=\mathsf{q}\big{(}\mathcal{I}_{v}^{*}(H)\big{)} is the quotient group of fractional v-invertible v-ideals, and Cv(H)=Fv(H)×/{xH∣x∈q(H)} is the v-class group of H.
The monoid H is said to be weakly Krull ([28, Corollary 22.5]) if
[TABLE]
If H is v-noetherian, then H is weakly Krull if and only if v-max(H)=X(H) ([28, Theorem 24.5]). A domain R is weakly Krull if R∙ is a weakly Krull monoid. Weakly Krull domains were introduced by Anderson, Anderson, Mott, and Zafrullah ([1, 2]), and weakly Krull monoids by Halter-Koch ([26]).
The monoid H is Krull if and only if H is weakly Krull and Hp is a discrete valuation monoid for each p∈X(H).
Every saturated submonoid H of a monoid D=F(P)×D1…×Dn, where P is a set of primes and D1,…,Dn are primary monoids, is weakly Krull if the class group \mathsf{q}(D)/\big{(}D^{\times}\mathsf{q}(H)\big{)} is a torsion group ([19, Lemma 5.2]).
We mention a few key examples examples of v-noetherian weakly Krull monoids and domains and refer to [19, Examples 5.7] for a detailed discussion. Suppose that H is as in Theorem 4.4. Then, by the previous remark, its monoid of v-invertible v-ideals Iv∗(H) is a weakly Krull monoid. Furthermore, all one-dimensional noetherian domains are v-noetherian weakly Krull. If R is v-noetherian weakly Krull domain with non-zero conductor (R:R) and p∈X(R), then Rp∙ is finitely primary, and thus the assumption made in Theorem 4.4 holds.
Orders in algebraic number fields are one-dimensional noetherian and hence they are v-noetherian weakly Krull domains. If R is an order, then its v-class group Cv(R) (which coincides with the Picard group) as well as the index of the unit groups (R×:R×) are finite and every class contains a minimal prime ideal p∈P. Thus all assumptions made in Theorem 4.4.4 are satisfied. It was first proved by Halter-Koch ([27, Corollary 4]) that the elasticity of orders in number fields is accepted whenever it is finite.
Theorem 4.4**.**
Let H be a v-noetherian weakly Krull monoid with conductor
∅=f=(H:H)⊊H such that Hp is finitely primary for each p∈X(H). Let P∗={p∈X(H)∣p⊃f}, P=X(H)∖P∗, and let π:X(H)→X(H) be the natural map defined by π(P)=P∩H for all P∈X(H).
Iv∗(H)* has finite elasticity if and only if π is bijective.*
2. 2.
If π is bijective and Hp×/Hp× are torsion groups for all p∈P∗, then Iv∗(H) has accepted elasticity.
3. 3.
Suppose that Iv∗(H) has accepted elasticity, and let p1,…,ps∈P∗ be the minimal prime ideals with \rho\big{(}H_{\mathfrak{p}_{i}}\big{)}=\rho\big{(}\mathcal{I}_{v}^{*}(H)\big{)} for all i∈[1,s], and set di=minΔ(Hpi). Then
[TABLE]
4. 4.
Let GP⊂Cv(H) denote the set of classes containing a minimal prime ideal from P. Suppose that π is bijective, and that Cv(H) and H×/H× are both finite. Then H has accepted elasticity and if ρ(H)=ρ(GP), then Δρ(GP)⊂Δρ(H).
Proof.
By [19, Section 5]), we infer that H is Krull, P∗ is finite, and that
[TABLE]
This follows from (4.2), from (4.4), and from Lemma 2.6.1.
This follows from Lemma 2.6.1 and from Lemma 4.1.1.
is the T-block monoid of H and the inclusion is saturated and cofinal ([17, Definition 3.4.9]). Thus \mathcal{L}\big{(}\mathcal{B}(H)\big{)}=\mathcal{L}(H), whence it suffices to prove all the statements for B(H) instead of proving them for H.
Since Cv(H) and H×/H× are finite, the exact sequence ([19, Proposition 5.4])
[TABLE]
implies that (Hp×:Hp×)<∞ for all p∈P∗. Thus, by 4.3, all factors of T are finitely generated and hence T is finitely generated. Therefore B(H) is finitely generated (as a saturated submonoid of a finitely generated monoid) and hence B(H) has accepted elasticity by [17, Theorem 3.1.4].
Since B(GP)⊂B(H) is a divisor-closed submonoid, the remaining statement follows from Lemma 2.4.2.
∎
Remarks 4.5**.**
Let H be as in Theorem 4.4. If π is bijective and H is seminormal, then Iv∗(H) is half-factorial ([19, Theorem 5.8.1.(a)]) and hence \Delta\big{(}\mathcal{I}_{v}^{*}(H)\big{)}=\emptyset.
Let R be a noetherian weakly Krull domain such that its integral closure R is a finitely generated R-module. Then, for p∈P∗, the index (Rp×:Rp×) is finite if and only if R/p is finite ([30, Theorem 2.1]).
Lemma 4.1 shows that the elasticity of a finitely primary monoid of rank 1 is completely determined by its value semigroup. The interplay of algebraic and arithmetical properties of one-dimensional local Mori domains with properties of their value semigroup has found wide attention in the literature ([5, 4, 10]).
For every d∈N, there is a v-noetherian finitely primary monoid H with minΔ(H)=d. However, even for orders R in algebraic number fields the precise value of minΔ(Rp), p∈P∗, is known only for some explicit examples (as discussed in [17, Examples 3.7.3]).
To consider the global case, let H is as in Theorem 4.4 with finite v-class group Cv(H), and suppose further that every class contains a minimal prime ideal from P. If H is seminormal or ∣G∣≥3, then minΔ(H)=1 ([23, Theorem 1.1]).
It is a central but far open problem in factorization theory to characterize when a weakly Krull monoid H and when its monoid Iv∗(H) of v-invertible v-ideals are transfer Krull monoids resp. transfer Krull monoids of finite type.
To begin with the local case, finitely primary monoids are not transfer Krull and the same is true for finite direct products of finitely primary monoids ([21, Theorem 5.6]). These are one of the spare results available so far which indicate that weakly Krull monoids (with the properties of Theorem 4.4) are transfer Krull only in exceptional cases. Clearly, combining results from Section 3 with Theorem 4.4.3 we obtain examples of when the system of sets of lengths of Iv∗(H) does not coincide with L(G) for any resp. some finite abelian groups G. Clearly, if \mathcal{L}\big{(}\mathcal{I}_{v}^{*}(H)\big{)}\neq\mathcal{L}(G) for an abelian group G, then Iv∗(H) is not transfer Krull over G.
We formulate one such result (others would be possible) as a corollary. But, of course, we are far away from a characterization of when H and the monoid Iv∗(H) are transfer Krull resp. of when L(H) or L(Iv∗(H)) coincide with L(G) for some finite abelian group G (see Section 5 and Problem 5.9 in [21]).
Corollary 4.6**.**
Let H be a v-noetherian weakly Krull monoid with conductor
∅=f=(H:H)⊊H such that Hp is finitely primary for each p∈X(H) and Iv∗(H) has accepted elasticity.
Let p1,…,ps be the minimal prime ideals with \rho\big{(}H_{\mathfrak{p}_{i}}\big{)}=\rho\big{(}\mathcal{I}_{v}^{*}(H)\big{)}>1.
If \gcd\big{(}\min\Delta(H_{\mathfrak{p}_{1}}),\ldots,\min\Delta(H_{\mathfrak{p}_{s}})\big{)}>1 and G is a finite abelian group with \mathcal{L}\big{(}\mathcal{I}_{v}^{*}(H)\big{)}=\mathcal{L}(G), then G is cyclic of order 4, 6, or 10.
2. 2.
If there is an i∈[1,s] with minΔ(Hpi)>1 and G is a finite abelian group with \mathcal{L}\big{(}\mathcal{I}_{v}^{*}(H)\big{)}=\mathcal{L}(G), then G does not have rank two and is not of the form Cpkr with k,r∈N, r≥2, and p prime with pk≥3. Moreover, if Conjecture 3.20 holds true, then G is either cyclic or isomorphic to C21+minΔ(Hpi).
Proof.
We set d=\gcd\big{(}\min\Delta(H_{\mathfrak{p}_{1}}),\ldots,\min\Delta(H_{\mathfrak{p}_{s}})\big{)}. Then Theorem 4.4.3 and Lemma 4.3.2 imply that \min\Delta_{\rho}\big{(}\mathcal{I}_{v}^{*}(H)\big{)}=d. Thus the assertion follows from Theorem 3.5.
We set p=pi, minΔ(Hp)=d, and let G be a finite abelian group such that \mathcal{L}(G)=\mathcal{L}\big{(}\mathcal{I}_{v}^{*}(H)\big{)}. Then Theorem 4.4.3 implies that d\in\Delta_{\rho}^{*}\big{(}\mathcal{I}_{v}^{*}(H)\big{)}\subset\Delta_{\rho}\big{(}\mathcal{I}_{v}^{*}(H)\big{)}=\Delta_{\rho}(G). Thus the assertion follows from Theorems 3.7, 3.11, 3.13 and Conjecture 3.20.
∎
Acknowledgement. We thank the referees for their careful reading.
Bibliography37
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] D.D. Anderson, D.F. Anderson, and M. Zafrullah, Atomic domains in which almost all atoms are prime , Commun. Algebra 20 (1992), 1447 – 1462.
2[2] D.D. Anderson, J. Mott, and M. Zafrullah, Finite character representations for integral domains , Boll. Unione Mat. Ital. 6 (1992), 613 – 630.
3[3] N.R. Baeth and D. Smertnig, Factorization theory: From commutative to noncommutative settings , J. Algebra 441 (2015), 475 –– 551.
4[4] V. Barucci, M. D’Anna, and R. Fröberg, Analytically unramified one-dimensional semilocal rings and their value semigroups , J. Pure Appl. Algebra 147 (2000), 215 – 254.
5[5] V. Barucci, D.E. Dobbs, and M. Fontana, Maximality Properties in Numerical Semigroups and Applications to One-Dimensional Analytically Irreducible Local Domains , vol. 125, Memoirs of the Amer. Math. Soc., 1997.
6[6] C. Bowles, S.T. Chapman, N. Kaplan, and D. Reiser, On delta sets of numerical monoids , J. Algebra Appl. 5 (2006), 695 – 718.
7[7] S. Chang, S.T. Chapman, and W.W. Smith, On minimum delta set values in block monoids over cyclic groups , Ramanujan J. 14 (2007), 155 – 171.
8[8] S.T. Chapman, M. Fontana, A. Geroldinger, and B. Olberding (eds.), Multiplicative Ideal Theory and Factorization Theory , Proceedings in Mathematics and Statistics, vol. 170, Springer, 2016.