A characterization of Krull monoids for which sets of lengths are (almost) arithmetical progressions
Alfred Geroldinger and Wolfgang Alexander Schmid
Institute for Mathematics and Scientific Computing
University of Graz, NAWI Graz
Heinrichstraße 36
8010 Graz, Austria
[email protected]
Université Paris 13
Sorbonne Paris Cité
LAGA, CNRS, UMR 7539, Université Paris 8
F-93430, Villetaneuse, France
and
Laboratoire Analyse, Géométrie et Applications (LAGA, UMR 7539)
COMUE Université Paris Lumières
Université Paris 8, CNRS
93526 Saint-Denis cedex, France
[email protected]
Abstract.
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 depends only 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.
Key words and phrases:
Krull monoids, transfer Krull monoids, sets of lengths, zero-sum sequences
2010 Mathematics Subject Classification:
11B30, 13A05, 13F05, 20M13
This work was supported by the Austrian Science Fund FWF, Project Number P28864-N35.
1. Introduction
Let H be a Krull monoid with class group G and suppose that every class contains a prime divisor. Then every element has a factorization into irreducibles. If a=u1⋅…⋅uk with irreducibles u1,…,uk∈H, then k is called the factorization length. The set L(a)⊂N0 of all possible factorization lengths is finite and called the set of lengths of a. The system L(H)={L(a)∣a∈H} is a well-studied means for describing the arithmetic of H. It is classic that ∣L∣=1 for all L∈L(H) if and only if ∣G∣≤2 and if ∣G∣≥3, then there are arbitrarily large L∈L(H).
Sets of lengths in H can be studied in the associated
monoid of zero-sum sequences B(G). The latter is a Krull monoid again and it is well-known that \mathcal{L}(H)=\mathcal{L}\big{(}\mathcal{B}(G)\big{)} (as usual we write L(G) for \mathcal{L}\big{(}\mathcal{B}(G)\big{)}. Our results on L(G) also apply to the larger class of transfer Krull monoids over G. This will be outlined in Section 2.
If the group G is infinite, then, by a Theorem of Kainrath, every finite set L⊂N≥2 lies in L(H) ([25], [16, Theorem 7.4.1]; for further rings and monoids with this property see [10] or [24, Corollary 4.7]).
Now suppose that the group G is finite. In this case sets of lengths have a well-defined structure. Indeed,
by the Structure Theorem for Sets of Lengths (Proposition 2.2.1), the sets in L(G) are AAMPs (almost arithmetical multiprogressions) with difference in Δ∗(G) and some universal bound. By a realization result of the second author, this description is best possible (Proposition 2.2.2). By definition, the concept of an AAMP comprises APs (arithmetical progressions), AAPs (almost arithmetical progressions), and AMPs (arithmetical multiprogressions); definitions are gathered in Definition 2.1. The goal of this paper is to characterize those groups where all sets of lengths are not only AAMPs, but have one of these more special forms. We formulate the main result of this paper.
Theorem 1.1**.**
Let G be a finite abelian group.
-
The following statements are equivalent :**
- (a)
All sets of lengths in L(G) are APs with difference in Δ∗(G).
2. (b)
All sets of lengths in L(G) are APs.
3. (c)
The system of sets of lengths L(G) is additively closed, that is, L1+L2∈L(G) for all L1,L2∈L(G).
4. (d)
G* is cyclic of order ∣G∣≤4 or isomorphic to a subgroup of C23 or isomorphic to a subgroup of C32.*
2. 2.
The following statements are equivalent :**
- (a)
There is a constant M∈N such that all sets of lengths in L(G) are AAPs with bound M.
2. (b)
G* is isomorphic to a subgroup of C33 or isomorphic to a subgroup of C43.*
3. 3.
For all finite sets Δ with Δ⊃Δ∗(G) the following statements are equivalent :**
- (a)
All sets of lengths in L(G) are AMPs with difference in Δ.
2. (b)
G* is cyclic of order ∣G∣≤6 or isomorphic to a subgroup of C23 or isomorphic to a subgroup of C32.*
A central topic in the study of sets of lengths is the Characterization Problem (for recent progress see [4, 17, 23, 31, 30]) which reads as follows:
- Let G be a finite abelian group with D(G)≥4, and let G′ be an abelian group with L(G)=L(G′).
Does it follow that G≅G′?
A finite abelian group G has Davenport constant D(G)≤3 if and only if either ∣G∣≤3 or G≅C2⊕C2. Since L(C1)=L(C2) and L(C3)=L(C2⊕C2) (Proposition 3.1), small groups require special attention in the study of the Characterization Problem.
As a consequence of Theorem 1.1 we obtain an affirmative answer to the Characterization Problem for all involved small groups.
Corollary 1.2**.**
Let G be a finite abelian group with Davenport constant D(G)≥4 and suppose that L(G) satisfies one of the properties characterized in Theorem 1.1. If G′ is any abelian group such that L(G)=L(G′), then G≅G′.
In Section 2 we gather the required tools for studying sets of lengths (Propositions 2.2, 2.3, and 2.4). The proof of Theorem 1.1 requires methods from additive combinatorics and is given in Section 3. Several properties occurring in Theorem 1.1 can be characterized by further arithmetical invariants. We briefly outline this in Remark 3.13 where we also discuss the property of being additively closed occurring in Theorem 1.1.1.(c).
2. Background on sets of lengths
Let N denote the set of positive integers, P⊂N the set of prime numbers and put N0=N∪{0}. For real numbers a,b∈R, we set [a,b]={x∈Z∣a≤x≤b}. Let A,B⊂Z be subsets of the integers. We denote by A+B={a+b∣a∈A,b∈B} their sumset, and by Δ(A) the set of (successive) distances of A (that is, d∈Δ(A) if and only if d=b−a with a,b∈A distinct and [a,b]∩A={a,b}). For k∈N, we denote by k⋅A={ka∣a∈A} the dilation of A by k. If A⊂N, then
[TABLE]
is the elasticity of A, and we set ρ({0})=1.
Monoids. By a monoid, we
mean a commutative cancellative semigroup with identity. Let H be a monoid. Then H× denotes the group of invertible elements of H, A(H) the set of atoms of H, and Hred=H/H× the associated reduced monoid. The factorization monoid Z(H)=F(A(Hred)) is the free abelian monoid with basis A(Hred) and π:Z(H)→Hred denotes the canonical epimorphism. For an element a∈H, Z(a)=π−1(aH×) is the set of factorizations of a and L(a)={∣z∣=∑u∈A(Hred)vu(z)∣z=∏u∈A(Hred)uvu(z)∈Z(a)}⊂N0 is the set of lengths of a (note that L(a)={0} if and only if a∈H×). We denote by
[TABLE]
For k∈N, we set ρk(H)=k if H is a group, and
[TABLE]
Then
[TABLE]
is the elasticity of H.
Zero-Sum Theory. Let G be an additive abelian group, G0⊂G a subset, and let F(G0) be the free abelian monoid with basis G0. In Combinatorial Number Theory, the elements of F(G0) are called sequences over G0. For a sequence
[TABLE]
we set −S=(−g1)⋅…⋅(−gl), and we call |S|=l=\sum_{g\in G}\mathsf{v}_{g}(S)\in\mathbb{N}_{0}\ \text{the \ {\it length} \ of \ S,}
[TABLE]
the set of subsequence sums of S. The sequence S is said to be
zero-sum free if 0∈/Σ(S),
a zero-sum sequence if σ(S)=0,
a minimal zero-sum sequence if it is a nontrivial zero-sum
sequence and every proper subsequence is zero-sum free.
The monoid
[TABLE]
is called the monoid of zero-sum sequences over G0. As usual we set, for all k∈N, \rho_{k}(G_{0})=\rho_{k}\big{(}\mathcal{B}(G_{0})\big{)},\ \rho(G_{0})=\rho\big{(}\mathcal{B}(G_{0})\big{)},\ \mathcal{L}(G_{0})=\mathcal{L}(\mathcal{B}(G_{0})), \mathsf{Z}(G_{0})=\mathsf{Z}\big{(}\mathcal{B}(G_{0})\big{)}, and \Delta(G_{0})=\Delta\big{(}\mathcal{B}(G_{0})\big{)}.
The atoms (irreducible elements) of the monoid B(G0) are precisely the
minimal zero-sum sequences over G0, and they will be denoted by A(G0). If G0 is finite, then A(G0) is finite. The Davenport constant D(G0) of G0 is the maximal length of an atom whence
[TABLE]
The set of minimal distances Δ∗(G)⊂Δ(G) is defined as
[TABLE]
A tuple (ei)i∈I is called a basis of G if all elements are nonzero and G=⊕i∈I⟨ei⟩. For p∈P, let rp(G) denote the p-rank of
G, r(G)=sup{rp(G)∣p∈P} denote the
rank of G.
Transfer Krull monoids. A monoid is a Krull monoid if it is completely integrally closed and satisfies the ascending chain condition on divisorial ideals.
An integral domain R is a Krull domain if and only if its
multiplicative monoid R∖{0} is a Krull monoid whence every integrally closed noetherian domain is Krull.
Rings of integers, holomorphy rings in algebraic function fields, and
regular congruence monoids in these domains are Krull monoids with finite
class group such that every class contains a prime divisor
([16, Section 2.11]). Monoid domains and monoids of modules that are Krull
are discussed in [5, 3, 1, 8]. Let H be a Krull monoid with class group G such that every class contains a prime divisor. Then there is a transfer homomorphism θ:H→B(G) which implies that L(H)=L(G) ([16, Theorem 3.4.10]). A transfer Krull monoid H over G is a (not necessarily commutative) monoid allowing a weak transfer homomorphism to B(G) whence L(H)=L(G). Thus Theorem 1.1 applies to transfer Krull monoids over finite abelian groups.
Recent deep work, mainly by Baeth and Smertnig, revealed that wide classes of non-commutative Dedekind domains are transfer Krull ([29, 2, 28]). We refer to the survey [13] for a detailed discussion of these and further examples.
Sets of Lengths.
Let A∈B(G0) and d=min{∣U∣∣U∈A(G0)}. If A=BC with B,C∈B(G0), then
[TABLE]
If A=U1⋅…⋅Uk=V1⋅…⋅Vl with U1,…,Uk,V1,…,Vl∈A(G0) and k<l, then
[TABLE]
For sequences over cyclic groups the g-norm plays a similar role as the length does for sequences over arbitrary groups.
Let g∈G with ord(g)=n≥2. For a
sequence S=(n1g)⋅…⋅(nlg)∈F(⟨g⟩), where l∈N0 and n1,…,nl∈[1,n], we define
[TABLE]
Note that σ(S)=0 implies that n1+…+nl≡0modn whence ∥S∥g∈N0. Thus, ∥⋅∥g:B(⟨g⟩)→N0 is a
homomorphism, and ∥S∥g=0 if and only if S=1. If S∈A(G0), then ∥S∥g∈[1,n−1], and if ∥S∥g=1, then S∈A(G0).
Arguing as above we obtain that
[TABLE]
Now we recall the concept of almost arithmetical multiprogressions (AAMPs) as given in [16, Chapter 4]. Then we gather results on sets of lengths and on invariants controlling their structure such as the set of distances and the elasticities (Propositions 2.2, 2.3, and 2.4). These results form the basis for the proof of Theorem 1.1 given in the next section.
Definition 2.1**.**
Let d∈N, l,M∈N0, and {0,d}⊂D⊂[0,d]. A subset L⊂Z is called an
arithmetical multiprogression (AMP for short) with difference d, period D and length
l, if L is an interval of minL+D+dZ (this means that L is finite nonempty and L=(minL+D+dZ)∩[minL,maxL]),
and l is maximal such that minL+ld∈L.
almost arithmetical multiprogression (AAMP for
short) with difference d, period D,
length l and bound M, if
[TABLE]
where L∗ is an AMP with difference d (whence L∗=∅),
period D
and length l such that minL∗=0, L′⊂[−M,−1], L′′⊂maxL∗+[1,M] and y∈Z.
almost arithmetical progression (AAP for short) with
difference d, bound M and length l, if it is an AAMP with difference d, period {0,d}, bound M
and length l.
Proposition 2.2** (Structural results on L(G)).**
Let G be a finite abelian group with ∣G∣≥3.
-
There exists some M∈N0 such that every set of lengths L∈L(G) is an AAMP with some difference d∈Δ∗(G) and bound M.
2. 2.
For every M∈N0 and every finite nonempty set Δ∗⊂N, there is a finite abelian group G∗ such that the following holds :* for every AAMP L with difference d∈Δ∗ and bound M there is some yL∈N such that*
[TABLE]
3. 3.
Let G0⊂G be a subset. Then there exist a bound M∈N0 and some A∗∈B(G0) such that for all A∈A∗B(G0) the set of lengths L(A) is an AAP with difference minΔ(G0) and bound M.
4. 4.
If A∈B(G) such that supp(A)∪{0} is a subgroup of G, then L(A) is an AP with difference 1.
Proof.
The first statement gives the Structure Theorem for Sets of Lengths ([16, Theorem 4.4.11]), which is sharp by the second statement proved in [27]. The third and the fourth statements show that sets of lengths are extremely smooth provided that the associated zero-sum sequence contains all elements of its support sufficiently often ([16, Theorems 4.3.6 and 7.6.8]).
∎
Proposition 2.3** (Structural results on Δ(G) and on Δ∗(G)).**
Let G=Cn1⊕…⊕Cnr where r,n1,…,nr∈N with r=r(G), 1<n1∣…∣nr, and ∣G∣≥3.
-
Δ(G)* is an interval with*
[TABLE]
2. 2.
1∈Δ∗(G)⊂Δ(G), [1,r(G)−1]⊂Δ∗(G), and maxΔ∗(G)=max{exp(G)−2,r(G)−1}.
3. 3.
If G is cyclic of order ∣G∣=n≥4, then \max\big{(}\Delta^{*}(G)\setminus\{n-2\}\big{)}=\lfloor\frac{n}{2}\rfloor-1.
Proof.
The statement on maxΔ∗(G) follows from [22].
For all remaining statements see [16, Section 6.8]. A more detailed analysis of Δ∗(G) in case of cyclic groups can be found in [26].
∎
Proposition 2.4** (Results on ρk(G) and on ρ(G)).**
Let G be a finite abelian group with ∣G∣≥3, and let k∈N.
-
ρ(G)=D(G)/2* and ρ2k(G)=kD(G).*
2. 2.
1+kD(G)≤ρ2k+1(G)≤kD(G)+D(G)/2. If G is cyclic, then equality holds on the left side.
Proof.
See [16, Chapter 6.3], [12, Theorem 5.3.1], and [15].
∎
We need the following technical lemma which follows from [9, Lemma 6.1].
Lemma 2.5**.**
Let G be a finite abelian group, A∈B(G), x=U1⋅…⋅Ur∈Z(G), with U1,…,Ur∈A(G) and ∣U1∣=…=∣Ur∣=2, such that U1⋅…⋅Ur∣A in B(G). Then there exists a factorization z∈Z(A) with ∣z∣=maxL(A) and x∣z in Z(G).
3. A characterization of extremal cases
The goal of this section is to prove Theorem 1.1. First we recall some cases where the systems of sets of lengths are completely determined.
Proposition 3.1**.**
-
\mathcal{L}(C_{1})=\mathcal{L}(C_{2})=\big{\{}\{m\}\mid m\in\mathbb{N}_{0}\big{\}}.
2. 2.
\mathcal{L}(C_{3})=\mathcal{L}(C_{2}\oplus C_{2})=\bigl{\{}y+2k+[0,k]\,\bigm{|}\,y,\,k\in\mathbb{N}_{0}\bigr{\}}.
3. 3.
\mathcal{L}(C_{4})=\bigl{\{}y+k+1+[0,k]\,\bigm{|}\,y,\,k\in\mathbb{N}_{0}\bigr{\}}\,\cup\,\bigl{\{}y+2k+2\cdot[0,k]\,\bigm{|}\,y,\,k\in\mathbb{N}_{0}\bigr{\}}.
4. 4.
\mathcal{L}(C_{2}^{3})=\bigl{\{}y+(k+1)+[0,k]\,\bigm{|}\,y\in\mathbb{N}_{0},\ k\in[0,2]\bigr{\}}* *
* ** ** ** \cup\ \bigl{\{}y+k+[0,k]\,\bigm{|}\,y\in\mathbb{N}_{0},\ k\geq 3\bigr{\}}\cup\bigl{\{}y+2k+2\cdot[0,k]\,\bigm{|}\,y,\,k\in\mathbb{N}_{0}\bigr{\}}.*
5. 5.
L(C32)={[2k,l]∣k∈N0,l∈[2k,5k]}* *
* ** ** ** ∪ {[2k+1,l]∣k∈N,l∈[2k+1,5k+2]}∪{{1}}.*
Proof.
- This is well-known. A proof of 2.,3., and 4. can be found in [16, Theorem 7.3.2].
For 5. we refer to [18, Proposition 3.12].
∎
Let G be a finite abelian group, g∈G with ord(g)=n≥2, r∈[0,n−1], k,ℓ∈N0, and A=gkn+r(−g)ℓn+r. We often use that
[TABLE]
where U=g(−g), V=gn, and that
[TABLE]
Proposition 3.2**.**
Let G be a cyclic group of order ∣G∣=n≥7, g∈G with ord(g)=n, k∈N, and
[TABLE]
Then there is a bound M∈N such that, for all k≥n−1, the sets L(Ak) are AAPs with difference 1 and bound M, but they are not APs with difference 1.
Proof.
We set G0={g,−g,2g}, U1=(−g)g, U2=(−g)2(2g) and, if n is odd, then V1=(2g)(n+1)/2(−g). Furthermore, for j∈[0,n/2], we define Wj=(2g)jgn−2j. Then, together with −W0=(−g)n, these are all minimal zero-sum sequences which divide Ak for k∈N. Note that
[TABLE]
It is sufficient to prove the following two assertions.
- A1.
There is an M∈N0 such that L(Ak) is an AAP with difference 1 and bound M for all k≥n−1.
2. A2.
For each k∈N, L(Ak) is not an AP with difference 1.
*Proof of *A1. By Proposition 2.2.1 there is a bound M′∈N0 such that, for each k∈N, L(Ak) is an AAMP with difference dk∈Δ∗(G)⊂[1,n−2] and bound M′. Suppose that k≥n−1. Then (W0U2)n−1 divides Ak. Since W0U2=W1U12, it follows that
[TABLE]
and hence \mathsf{L}\big{(}(W_{0}U_{2})^{n-1}\big{)}\supset[2n-2,3n-3]. Thus L(Ak) contains an AP with difference 1 and length n−1. Therefore there is a bound M∈N0 such that L(Ak) is an AAP with difference 1 and bound M for all k≥n−1.
*Proof of *A2. Let k∈N. Observe that
[TABLE]
and it can be seen that minL(Ak)=2k+2. We assert that 2k+3∈/L(Ak). If n is even, then
[TABLE]
and similarly, for odd n we have
[TABLE]
In both cases, all factorizations of Ak of length 2k+2 contain only atoms with g-norm 1 and with g-norm n−1. Let z′ be any factorization of Ak containing only atoms with g-norm 1 and with g-norm n−1. Then ∣z′∣−∣z∣ is a multiple of n−2 whence if ∣z′∣>∣z∣, then ∣z′∣−∣z∣≥n−2>1.
Next we consider a factorization z′ of Ak containing at least one atom with g-norm 2, say z′ has r atoms with g-norm n−1, s≥1 atoms with g-norm 2, and t atoms with g-norm 1. Then k>r,
[TABLE]
and we study
[TABLE]
Note that s≤v2g(Ak)≤n. Thus, if k−r≥2, then
[TABLE]
Suppose that k−r=1. Then we cancel (−W0)k−1, and consider a relation where −W0 occurs precisely once. Suppose that all s atoms of g-norm 2 are equal to U2. Since v−g(U2)=2, it follows that s≤v−g(−W0)/2=n/2 whence
[TABLE]
Suppose that V1 occurs among the s atoms with g-norm 2. Then n is odd, V1 occurs precisely once, and
[TABLE]
whence
[TABLE]
In order to handle the cyclic group with six elements (done in Proposition 3.8), we need five lemmas.
Lemma 3.3**.**
Let G be a cyclic group of order ∣G∣=6, g∈G with ord(g)=6, and A∈B(G) with supp(A)={g,2g,3g,−g}. Then L(A) is an AP with difference 1.
Proof.
We set G0={g,2g,3g,−g} and list all atoms of B(G0):
- ∥⋅∥g=1: g6, g4(2g), g3(3g), g2(2g)2, g(2g)(3g), g(−g), (2g)3, (3g)2
- ∥⋅∥g=2: U1=(2g)2(3g)(−g), U2=(2g)(−g)2,
- ∥⋅∥g=3: U3=(3g)(−g)3,
- ∥⋅∥g=5: U4=(−g)6.
We choose a factorization z∈Z(A) and we show that either ∣z∣=maxL(A) or that ∣z∣+1∈L(A).
In each of the following cases it easily follows that ∣z∣+1∈L(A).
U12∣z in Z(G), because 3∈L(U12).
U1U3∣z in Z(G), because 3∈L(U1U3).
U1U4∣z in Z(G), because 3∈L(U1U4).
From now on we suppose that none of the above cases occurs. If z is divisible only by atoms with g-norm one and by at most one atom having g-norm two, then we are done. Thus it is sufficient to handle the following four cases.
CASE 1: U1∣z.
If z is divisible by an atom W with vg(W)≥1 and W=(−g)g, then 3∈L(U1W) and we are done. Suppose this does not hold. Thus
[TABLE]
with k2∈N and k3,k4,k5∈N0. Then ∣z∣=1+k2+…+k5 and we assert that ∣z∣=maxL(A). By Lemma 2.5 it is sufficient to show that
[TABLE]
Each atom X∈B(G0) with X\mid U_{1}U_{2}^{k_{2}}\Big{(}(2g)^{3}\Big{)}^{k_{3}} and (2g)∣X has length ∣X∣≥3 whence the claim follows.
CASE 2: U3∣z and U1∤z.
If z is divisible by an atom W with v2g(W)≥1. If W∈{g4(2g),g2(2g)2,(2g)3, g(2g)(3g)}, then 3∈L(U3W) and we are done. If this is not the case, then all atoms W are equal to U2. Thus U2U3 divides z. Thus z is divisible by an atom W with vg(W)≥1. If W∈{g6,g3(3g)}, then 3∈L(U2W) and we are done. Thus we may assume that any atom W with vg(W)≥1 is equal to V=(−g)g. This implies that vg(A)=vV(z). We set
[TABLE]
and assert that ∣z∣=maxL(A). By Lemma 2.5 it is sufficient to show that
[TABLE]
and this holds true.
CASE 3: U2∣z and U1∤z and U3∤z.
If z is divisible by an atom W with v2g(W)≥2, then 3∈L(U2W) and we are done. If z is divisible by W=g(2g)(3g), then U_{2}W=U_{1}\Big{(}g(-g)\Big{)}. Thus there is a factorization z′∈Z(A) with ∣z∣=∣z′∣ and U1∣z′ and the claim follows from CASE 1.
Suppose that this is not the case. Then the each atom dividing z and containing g is V=(−g)g whence vg(A)=vV(z). If (2g)3 and U4 divide z, then ∣z∣+1∈L(A) because 3∈L((3g)2U4); otherwise ∣z∣=maxL(A).
CASE 3: U4∣z and U1∤z and U2∤z and U3∤z.
If W=(2g)3 divides z, then 3∈L(U4W) and we are done. Suppose this is not the case. If W=g(2g)(3g) divides z, then 3∈L(U4W) and we are done. Suppose this is not the case. Then there are atoms W1,W2 such that 2g∣W1 and 3g∣W2 such that W1W2 divides z. Then W1∈{g4(2g),g2(2g)2} and W2∈{(3g)2,g3(3g)}. In each case we obtain that W1W2=WW4 for some atom W4∈A(G). Thus we obtain a factorization z′∈Z(A) with ∣z∣=∣z′∣ with WU4∣z′ and we are done.
∎
Lemma 3.4**.**
Let G be a cyclic group of order ∣G∣=6, g∈G with ord(g)=6, and A∈B(G) with supp(A)={g,3g,4g}. Then L(A) is an AP with difference 1.
Proof.
We set G0={g,3g,4g} and list all atoms of B(G0):
- ∥⋅∥g=1: g6, V3=g3(3g), V5=g2(4g), V4=(3g)2
- ∥⋅∥g=2: U1=(4g)2(3g)g, U2=(4g)3,
We choose a factorization z∈Z(A) and we show that either ∣z∣=maxL(A) or that ∣z∣+1∈L(A).
If z is divisible by at most one atom having g-norm two, then the claim holds. Thus from now on we suppose that z is divisible by at least two atoms having g-norm two.
Since U_{1}^{2}=(3g)^{2}\Big{(}(4g)g^{2}\Big{)}\Big{(}(4g)^{3}\Big{)}, we may suppose that U12∤z. Thus U1U2 divides z or U22 divides z.
Since V_{3}^{2}=(g^{6})\Big{(}(3g)^{2}\Big{)}, we may suppose that vV3(z)≤1.
If z is divisible by g6, then 3∈L(U2g6) shows that ∣z∣+1∈L(A). Suppose that g6∤z. It follows that
[TABLE]
where ℓ1≤1, ℓ3≤1. Since U1V3=V4V52 we may suppose that ℓ1+ℓ3≤1.
We assert that ∣z∣=maxL(A), and by Lemma 2.5 it suffices to show that
[TABLE]
Since A′ is not divisible by an atom of length 2, it follows that maxL(A′)≤∣A′∣/3. Since ∣U2∣=∣V5∣=3 and ℓ1+ℓ3≤1, we infer that ℓ1+ℓ2+ℓ3+ℓ5=⌊∣A′∣/3⌋.
∎
Lemma 3.5**.**
Let G be a cyclic group of order ∣G∣=6, g∈G with ord(g)=6, and A∈B(G) with supp(A)={g,2g,3g,4g}. Then L(A) is an AP with difference 1.
Proof.
We set G0={g,2g,3g,4g} and list all atoms of B(G0):
- ∥⋅∥g=1: g6, g4(2g), V3=g3(3g), g2(2g)2, V5=g2(4g), V1=g(2g)(3g),
∥⋅∥g=1: V2=(2g)(4g), (2g)3, V4=(3g)2
- ∥⋅∥g=2: U1=(4g)2(3g)g, U2=(4g)3,
We choose a factorization z∈Z(A) and we show that either ∣z∣=maxL(A) or that ∣z∣+1∈L(A).
If z is divisible by at most one atom having g-norm two, then the claim holds. Thus from now on we suppose that z is divisible by at least two atoms having g-norm two.
Since U_{1}^{2}=(3g)^{2}\Big{(}(4g)g^{2}\Big{)}\Big{(}(4g)^{3}\Big{)}, we may suppose that U12∤z. Thus U1U2 divides z or U22 divides z.
Since V_{3}^{2}=(g^{6})\Big{(}(3g)^{2}\Big{)}, we may suppose that vV3(z)≤1. Since V_{1}^{2}=\Big{(}g^{2}(2g)^{2}\Big{)}(3g)^{2}, we may suppose that vV1(z)≤1. Since V_{1}V_{3}=\Big{(}g^{4}(2g)\Big{)}(3g)^{2}, we may suppose that vV3(z)+vV1(z)≤1. Since V1V5=V2V3, we may suppose that vV5(z)+vV1(z)≤1.
If z is divisible by some W∈{g6,g4(2g),g2(2g)2,(2g)3}, then 3∈L(U2W) shows that ∣z∣+1∈L(A). Suppose that none of these four atoms divides z.
Since v2g(A)≥1, it follows that V1=g(2g)(3g) or V2=(2g)(4g) divides z. If U1V1∣z, then 3∈L(U1V1) shows that ∣z∣+1∈L(A). Since U1V2=U2V1, we may suppose that
U1∤z whence z has the form
[TABLE]
We assert that ∣z∣=maxL(A). By Lemma 2.5 it is sufficient to show that
[TABLE]
If k1=1, then k3=k5=0 and \mathsf{L}\Big{(}V_{1}^{1}U_{2}^{\ell}\Big{)}=\{\ell+1\}. Suppose that k1=0, then V3k3V5k5Uℓ is not divisible by an atom of length two whence (recall that k3≤1)
[TABLE]
Lemma 3.6**.**
Let G be a cyclic group of order ∣G∣=6, g∈G with ord(g)=6, and A∈B(G) with supp(A)={g,2g,−g}. If v2g(A)≥3, then L(A) is an AP with difference 1. If v2g(A)=2, then L(A) is an AMP with period {0,1,2,4},{0,1,3,4}, or {0,2,3,4}, and if v2g(A)=1, then it is an AMP with period {0,1,4} or {0,3,4}.
Proof.
We set G0={g,2g,3g,4g} and list all atoms of B(G0):
- ∥⋅∥g=1: U1=g6,U2=g4(2g),U3=g2(2g)2,U4=(−g)g,U5=(2g)3,
- ∥⋅∥g=2: V1=(2g)(−g)2,
- ∥⋅∥g=5: V2=(−g)6.
CASE 1: v2g(A)=1.
Then each factorization z∈Z(A) is divisible by U2 or V1.
If vg(A)<4 or v−g(A)<2, it is easy to see that L(A) is a singleton. Thus, we assume that neither is the case and write A=(2g)gv+4(−g)w+2. Since A is a zero-sum sequence, it follows that v≡w+2(mod6).
We determine the set of lengths of A. Let z be a factorization of A.
If z contains U2, then z is of the form U2z′ where z′ is a factorization of gv(−g)w+2.
If z contains V1, then z is of the form V1z′′ where z′′ is a factorization of gv+4(−g)w.
Conversely, for each factorization z′ of gv(−g)w+2 we have that U2z′ is a factorization of A, and
for each factorization z′′ of gv(−g)w+2 we have that V1z′′ is a factorization of A.
Consequently L(A)=1+(L(gv(−g)w+2)∪L(gv+4(−g)w)).
We determine L(gv(−g)w+2)∪L(gv+4(−g)w).
If v is odd, then each factorization contains of gv(−g)w+2 and gv+4(−g)w contains (−g)g and
L(gv(−g)w+2)∪L(gv+4(−g)w)=1+(L(gv−1(−g)w−1+2)∪L(gv−1+4(−g)w−1)).
We thus focus on the case that v is even.
If v≡0(mod6), then
[TABLE]
and
[TABLE]
Thus, the union is an AMP with difference 4 and period {0,3,4}.
If v≡2(mod6), then
[TABLE]
and
[TABLE]
Thus, the union is an AMP with difference 4 and period {0,1,4}.
If v≡4(mod6), then
[TABLE]
and
[TABLE]
Thus, the union is an AMP with difference 4 and period {0,1,4}.
CASE 2: v2g(A)=2.
We set A=(2g)2gv+8(−g)w+4 with vg(A)=v+8>0, v−g(A)=w+4>0, and v,w∈Z. Then v≡w+4mod6. If w is odd, then Z(A)=U4Z(A′) with A′=U4−1A. Thus we may suppose that w is even.
First suppose that v−g(A)<4. Then v−g(A)=2, A=(−g)2(2g)2g6m+4 for some m∈N0, and L(A)={m+2,m+3} is an AP with difference 1. Now suppose that v−g(A)≥4. We discuss the cases where vg(A)∈{2,4,6}. If vg(A)=2, then A=g2(2g)2(−g)6m for some m∈N whence L(A)={m+1,m+2}. If vg(A)=4, then A=g2(2g)2(−g)6m+2 for some m∈N,
[TABLE]
whence L(A)={2+m,3+m,5+m} is an AMP with period {0,1,3,4}. If vg(A)=6, then A=g6(2g)2(−g)6m+4 for some m∈N0,
[TABLE]
where the last equations holds only in case m≥1. Thus L(A)={3,4,5} or L(A)={3+m,4+m,5+m,7+m} if m∈N.
Now we suppose that v−g(A)≥4 and vg(A)≥8 whence A=(2g)2gv+8(−g)w+4 with v,w∈N0 even. Then
[TABLE]
whence
[TABLE]
where the last equation holds because 1+L(A1)⊂L(g6A1) and g6A1=A2. The sets L(A2),L(A3) and L(A4) are APs with difference 4. Thus in order to show that L(A) is an AMP with difference 4, we study the minima and the lengths of −1+L(A2),L(A3) and L(A4). We distinguish three cases depending on the congruence class of v modulo 6 (recall that v is even).
Suppose that v≡0mod6. The set −1+L(A2) has minimum a0=(v+w+4)/6 amd length ℓ0=min{v+6,w+4}/6. The set L(A3) has minimum a0+2 and length min{v+6,w−2}/6∈{ℓ0,ℓ0−1}. Finally L(A4) has minimum a0+3 and length ℓ0−1. This implies that L(A) is an AMP with period {0,2,3,4}.
Suppose that v≡2mod6. Then L(A4) has minimum a2=(v+w+6)/6 and length ℓ2=min{v+4,w+2}/6. The set −1+L(A2) has minimum 1+a2 and length ℓ2. The set L(A3) has minimum a2+3 and length ℓ2 or ℓ2−1. This implies that L(A) is an AMP with period {0,1,3,4}.
Suppose that v≡4mod6. The set L(A3) has minimum a4=(v+w+8)/6 and length ℓ4=min{v+8,w}/6. The set L(A4) has minimum a4+1 and length ℓ4 or ℓ4−1. The set −1+L(A2) has minimum a4+2 and the same length as L(A4). This implies that L(A) is an AMP with period {0,1,2,4}.
CASE 3: v2g(A)≥3.
We assert that L(A) is an AP with difference 1.
We choose a factorization z∈Z(A) and we show that either ∣z∣=maxL(A) or that ∣z∣+1∈L(A). Since V2U5=V13, we may suppose that min{vV2(z),vU5(z)}=0.
Suppose that V1∣z. If Ui∣z for some i∈[1,3], then ∣z∣+1∈L(A). If vU5(z)=0, then ∣z∣=maxL(A). Suppose that vV2(z)=0. Then z=U4k4U5k5V1ℓ1 with k4,k5,ℓ1∈N0, and we claim that then ∣z∣=maxL(A). By Lemma 2.5, it suffices to show that k5+ℓ1=maxL(U5k5V1ℓ1). Since U5k5V1ℓ1 is not divisible by an atom of length two, it follows that maxL(U5k5V1ℓ1)≤∣U5k5V1ℓ1∣/3=k5+ℓ1.
Suppose that V1∤z. If vV2(z)=0, then ∣z∣=maxL(A) because all remaining atoms have g-norm one. From now on we suppose that V2∣z.
This implies that U5∤z. Since v2g(A)≥3, then U5∣U2vU2(z)U3vU3(z) and we obtain a factorization z′∈Z(A) with ∣z′∣=∣z∣ and with U5∣z′ and we still have that V2∣z′. Since V2U5=V13, it follows that ∣z′∣+1∈L(A).
∎
Lemma 3.7**.**
Let G be a cyclic group of order ∣G∣=6, g∈G with ord(g)=6, and A∈B(G) with supp(A)={g,2g,4g,−g}. If v2g(A)+v4g(A)≥3, then L(A) is an AP with difference 1 and otherwise it is an AMP with period {0,1,2,4} or {0,1,3,4} or {0,2,3,4}.
Proof.
We set G0={g,2g,4g,−g} and list all atoms of B(G0):
- ∥⋅∥g=1: U0=g6, U1=g4(2g), U2=g2(2g)2, U3=(2g)3, V2=(2g)(4g),
∥⋅∥g=1: W=(4g)g2, V1=g(−g),
- ∥⋅∥g=2: −U3=(4g)3, −W=(2g)(−g)2,
- ∥⋅∥g=3: −U2=(4g)2(−g)2,
- ∥⋅∥g=4: −U1=(−g)4(4g),
- ∥⋅∥g=5: −U0=(−g)6
First, suppose that v2g(A)+v4g(A)≥3. We choose a factorization z∈Z(A) and we show that either ∣z∣=maxL(A) or that ∣z∣+1∈L(A). We write z in the form
[TABLE]
where z+ is the product of all atoms from B({g,2g}) (these are U0,U1,U2,U3), z− is the product of all atoms from B({−g,4g}), and z0 is the product of all remaining atoms. Note that the sets in L({g,2g}) and L({−g,4g}) are singletons. If U3∣z+ and z−=1, then ∣z∣+1∈L(A). Similarly, if −U3∣z− and z+=1, then ∣z∣+1∈L(A).
Suppose that z−=1. If −W∤z, then all atoms dividing z have g-norm equal to 1 whence ∣z∣=maxL(A). Suppose that −W∣z. If (−W)Y∣z with Y∈{U0,U1,U2,W}, then ∣z∣+1∈L(A). Otherwise, z is a product of the atoms −W,U3,V2, and V1 which implies that ∣z∣=maxL(A). The case z+=1 follows by symmetry.
Thus we may suppose that z+=1 and z+=1 and that U3∤z+ and that (−U3)∤z−. Let A+ resp. A− denote the zero-sum sequences corresponding to z+ resp. z−. If v2g(A+)≥3, then there is a factorization z′ of A+ with ∣z′∣=∣z+∣ and with U3∣z′ and we are back to an earlier case. Thus we may suppose that v2g(A+)≤2. By symmetry we may also suppose that v4g(A−)≤2.
Since (−U1)2=(−U0)(−U2), we may suppose that v−U1(z−)≤1. By symmetry we infer that vU1(z+)≤1. Now we distinguish two cases.
CASE 1: U2∣z+ or (−U2)∣z−.
By symmetry we may suppose that U2∣z+. If (−U2)∣z− or (−U1)∣z−, then ∣z∣+1∈L(A). Otherwise z− is a product of (−U0). Since v4g(A)≥1, it follows that V2∣z or W∣z. Since (−U0)V2=(−W)(−U1), we are back to a previous case. Since (−U0)W=V12(−U1), it follows that ∣z∣+1∈L(A).
CASE 2: U2∤z+ and (−U2)∤z−.
If (−W)∣z0, then ∣z∣+1∈L(A) because z+ is a nonempty product of U0 and U1. If W∣z0, then ∣z∣+1∈L(A) because z− is a nonempty product of −U0 and −U1. From now on we suppose that W∤z0 and −W∤z0. Since v2g(A)+v4g(A)≥3, it follows that V2∣z0. If U0∣z, then U0V2=WU1 leads back to the case just handled. If U1∣z, then U1V2=U2W and we are back to CASE 1.
Now suppose that v2g(A)=v4g(A)=1. Then vg(A)≡v−g(A)mod6, and we set vg(A)=v=6m+r and v−g(A)=w=6n+r with v,w∈N,r∈[0,5], and m,n∈N0. Then
[TABLE]
where negative exponents are interpreted in the quotient group of F(G).
Since each factorization of A is divisible by exactly one of the following
[TABLE]
we infer that L(A)=L1∪L2∪L3∪L4∪L5, where
[TABLE]
Note, if exponents in the above equations are negative, then the associated sets Li are indeed empty. More precisely, if
v<6, then m=0, [0,min{m−1,n}]=∅, and hence L2=∅;
w<6, then n=0 and L3=∅;
r∈[0,1] and min{m,n}=0, then L4=∅;
r∈[0,3] and min{m,n}=0, then L5=∅.
We observe that L2⊂L1 and L3⊂L1.
If r∈[4,5], then minL5=r−2+m+n, minL4=2+minL5, and minL1=3+minL5; since L5, L4, and L1 are APs with difference 4 and length min{m,n}, L(A) is an AMP with period {0,2,3,4}.
If r∈[2,3], then minL4=r+m+n, minL1=1+minL4, and minL5=2+minL4; since L4, L1, and L5 are APs with difference 4, L4 and L1 have length min{m,n}, and L5 has length min{m,n}−1, L(A) is an AMP with period {0,1,2,4}.
If r∈[0,1], then minL1=1+r+m+n, minL5=1+minL1, and minL4=3+minL1; since L1, L5, and L4 are APs with difference 4, L4 and L5 have length min{m,n}−1, and L1 has length min{m,n}, L(A) is an AMP with period {0,1,3,4}.
∎
Proposition 3.8**.**
Let G be a cyclic group of order ∣G∣=6. Then every L∈L(G) has one of the following forms :**
L* is an AP with difference in {1,2,4}.*
L* is an AMP with one of the following periods: {0,1,4}, {0,3,4}, {0,1,2,4}, {0,1,3,4} {0,2,3,4}.*
Each of the mentioned forms is actually attained by arbitrarily large sets of lengths.
Proof.
Let A′∈B(G). If A′=0mA with m∈N0 and A∈B(G∖{0}), then L(A′)=m+L(A). Thus it is sufficient to prove the assertion for L(A).
Let g∈G with ord(g)=6.
If supp(A)=G∖{0}, then L(A) is an AP with difference 1 by Proposition 2.2.4. Suppose that supp(A)⊂G∖{g,−g}={2g,3g,4g}=G0. Since (3g)2 is a prime element in B(G0) and {0,2g,4g} is a cyclic group of order three, it follows that L(A) is an AP with difference 1 by Proposition 3.1. Thus from now on we may suppose that g∈supp(A). We distinguish two cases.
CASE 1: −g∈/supp(A).
Then supp(A)⊂{g,2g,3g,4g} and we assert that L(A) is an AP with difference 1. Since all atoms in B({g,2g,3g} have g-norm one, the sets in L({g,2g,3g}) are singletons. Thus the claim holds if supp(A)⊂{g,2g,3g}. If supp(A)={g,2g,3g,4g}, then the claim follows from Lemma 3.5. Thus it remains to consider the cases where supp(A) equals one of the following three sets:
[TABLE]
The multiplicity of g in any zero-sum sequence B∈B({g,2g,4g} is even, whence L({g,2g,4g})=L({2g,4g}). Since {0,2g,4g} is a cyclic group of order three, all sets of lengths in L({0,2g,4g} are APs with difference 1 by Proposition 3.1. If supp(A)={g,3g,4g}, then the claim follows from Lemma 3.4.
CASE 2: −g∈supp(A).
Then {g,−g}⊂supp(A) and we distinguish four cases.
CASE 2.1: supp(A)⊂G0={g,3g,−g}.
Since minΔ(G0)=2 by [16, Lemma 6.8.5] and maxΔ(G0)=4, it follows that Δ(G0)={2,4}. If 4∈Δ(L(A)), then L(A) is an AP with difference 4 by [6, Theorem 3.2], and otherwise L(A) is an AP with difference 2.
CASE 2.2: supp(A)={g,2g,−g} or supp(A)={g,4g,−g}.
By symmetry it suffices to consider the first case. Lemma 3.6 shows that L(A) has one of the given forms.
CASE 2.3: supp(A)={g,2g,3g,−g} or supp(A)={g,3g,4g,−g}.
By symmetry it suffices to consider the first case. Lemma 3.3 shows that L(A) is an AP with difference 1.
CASE 2.4: supp(A)={g,2g,4g,−g}.
Lemma 3.7 shows that L(A) has one of the given forms.
Finally, we note that the preceding lemmas imply that each of the mentioned forms is actually attained by arbitrarily large sets of lengths.
∎
The next proposition is used substantially in [19, Subsection 4.1], where the system L(C5) is written down explicitly.
Proposition 3.9**.**
Let G be a cyclic group of order ∣G∣=5. Then every L∈L(G) has one of the following forms :**
L* is an AP with difference in {1,3}.*
L* is an AMP with period {0,2,3} or with period {0,1,3}.*
Each of the mentioned forms is actually attained by arbitrarily large sets of lengths.
Proof.
By Proposition 2.3 we obtain that Δ∗(G)={1,3}. Let A′∈B(G). If A′=0mA with m∈N0 and A∈B(G∖{0}), then L(A′)=m+L(A). Thus it is sufficient to prove the assertion for L(A). If ∣supp(A)∣=1, then ∣L(A)∣=1. If ∣supp(A)∣=4, then L(A) is an AP with difference 1 by Proposition 2.2.4. Suppose that ∣supp(A)∣=2. Then there is a nonzero g∈G such that supp(A)={g,2g} or supp(A)={g,4g}. If supp(A)={g,2g}, then L(A) is an AP with difference 1 (this can be checked directly by arguing with the g-norm). If supp(A)={g,4g}, then L(A) is an AP with difference 3.
Thus it remains to consider the case ∣supp(A)∣=3. We set G0=supp(A). Then there is an element g∈G0 such that −g∈G0. Thus either G0={g,2g,−g} or G0={g,3g,−g}. Since {g,3g,−g}={−g,2(−g),−(−g)}, we may suppose without restriction that G0={g,2g,−g}.
We list all atoms of B(G0):
- ∥⋅∥g=1: g5, g3(2g), g(2g)2, g(−g),
- ∥⋅∥g=2: (2g)5, (2g)3(−g), (2g)(−g)2,
- ∥⋅∥g=4: (−g)5.
If Δ(L(A))⊂{1}, then L(A) is an AP with difference 1. If 3∈Δ(L(A)), then Δ(L(A))={3} by [6, Theorem 3.2], which means that L(A) is an AP with difference 3. Thus it remains to consider the case where 2∈Δ(L(A))⊂[1,2].
We show that L(A) is an AMP with period {0,2,3} or with period {0,1,3}. Since 2∈Δ(L(A)), there exist k∈N, A1,…,Ak,B1,…,Bk+2∈A(G0) such that
[TABLE]
We distinguish two cases.
CASE 1: (−g)5∈/{A1,…,Ak}.
Then {A1,…,Ak} must contain atoms with g-norm 2. These are the atoms (2g)5,(2g)(−g)2,(2g)3(−g). If g5 or g3(2g) occurs in {A1,…,Ak}, then k+1∈L(A), a contradiction. Thus none of the elements (−g)5,g5, and g3(2g) lies in {A1,…,Ak}, and hence
[TABLE]
Now we set h=2g and obtain that
[TABLE]
Since the h-norm of all these elements equals 1, it follows that maxL(A)=k, a contradiction.
CASE 2: (−g)5∈{A1,…,Ak}.
If (2g)5, or g(2g)2, or (2g)3(−g) occurs in {A1,…,Ak}, then k+1∈L(A), a contradiction. Since Δ({−g,g})={3}, it follows that
[TABLE]
Since \Big{(}g^{3}(2g)\Big{)}\Big{(}(2g)(-g)^{2}\Big{)}=\Big{(}(-g)g\Big{)}^{2}\Big{(}g(2g)^{2}\Big{)} and k+1∈/L(A), it follows that ∣Ω∣=1. We distinguish two cases.
CASE 2.1: {A1,…,Ak}⊂{g5,(−g)5,g(−g),(2g)(−g)2}.
We set h=−g, and observe that
[TABLE]
Since (−h)5 is the only element with h-norm greater than 1, it follows that (−h)5∈{A1,…,Ak}. Since Δ({h,−h})={3}, it follows that h2(3h)∈{A1,…,Ak}. Since \Big{(}(-h)^{5}\Big{)}\Big{(}h^{2}(3h)\Big{)}=\Big{(}h(-h)\Big{)}^{2}\Big{(}(3h)(-h)^{3}\Big{)}, we obtain that k+1∈L(A), a contradiction.
CASE 2.2: {A1,…,Ak}⊂{g5,(−g)5,g(−g),g3(2g)}.
Since \Big{(}g^{3}(2g)\Big{)}^{2}\Big{(}(-g)^{5}\Big{)}=\Big{(}g^{5}\Big{)}\Big{(}g(-g)\Big{)}\Big{(}(2g)(-g)^{2}\Big{)}^{2} and k+1∈/L(A), it follows that
[TABLE]
and hence v2g(A)=1. Thus every factorization z of A has the form
[TABLE]
where z1,z2 are factorizations of elements B1,B2∈B({−g,g}). Since L(B1) and L(B2) are APs of difference 3, L(A) is a union of two shifted APs of difference 3. We set
[TABLE]
where m1∈N0, m2∈N, and m3∈[0,4]. Suppose that m1≥1. Note that
[TABLE]
and hence L(A′)={3,5,6}. We set A=A′A′′ with A′′∈B({g,−g}). The above argument on the structure of the factorizations of A implies that L(A) is the sumset of L(A′) and L(A′′) whence
[TABLE]
Since L(A′′) is an AP with difference 3, L(A) is an AMP with period {0,2,3}. Suppose that m1=0. If m3∈[2,4], then L(A)={m2+m3,m2+m3+1,m2+m3+3} is an AMP with period {0,1,3}. If m3=1, then L(A)={m2+2,m2+4}. If m3=0, then L(A)={m2+1,m2+3}.
∎
Proposition 3.10**.**
Let G be a finite abelian group, e1,e2∈G∖{0} with ⟨e1⟩∩⟨e2⟩={0}, ord(e2)=n≥4, and U=(e1+e2)(−e1)e2n−1. Then, for every k∈N, we have
[TABLE]
Proof.
Let k∈N and A_{k}=U(-U)\big{(}e_{2}(-e_{2})\big{)}^{kn}. If X∈A(G) with X∣Ak, then
[TABLE]
Thus
[TABLE]
and we obtain the claim by using (3.1).
∎
Proposition 3.11**.**
Let G=C24, (e1,e2,e3,e4) be a basis of G, e0=e1+…+e4, U4=e0⋅…⋅e4, U3=e1e2e3(e1+e2+e3), and U2=e1e2(e1+e2).
-
For each k∈N, \mathsf{L}\big{(}(U_{3}U_{4})^{2k}\big{)}=\{4k\}\cup[4k+2,9k].
2. 2.
For each k∈N, L(U42kU2)=(2k+1)+{0,1,3}+3⋅[0,k−1].
Proof.
- Let k∈N and Ak=(U3U4)2k. Then
[TABLE]
Since maxL(Ak)≤∣Ak∣/2=9k, it follows that maxL(Ak)=9k. We set z=U32kU42k∈Z(Ak). Since U4 is the only atom of length D(G)=5 dividing Ak and since 2k=ve0(Ak)=vU4(z)=max{vU4(z′)∣z′∈Z(Ak)}, it follows that minL(Ak)=∣z∣=4k.
Next we assert that 4k+1∈/L(Ak). For ν∈[0,4], we set Vν=eν2 and V5=(e1+e2+e3)2. Since Z(U32)={U32,V1V2V3V5}, Z(U42)={U42,V1V2V3V4V0}, and Z(U3U4)={U3U4,V1V2V3W} where W=(e1+e2+e3)e0e4, it follows that min(L(Ak)∖{4k})=4k+2.
Since Ak has precisely one factorization z of length ∣z∣=maxL(Ak)=9k, and z is a product of atoms of length two with V0V4V5∣z. Since V0V4V5=W2, it follows that Ak has a factorization of length 9k−1.
- Setting W=(e1+e2)e3e4e0 we infer that U42U2=U4(e12)(e22)W=U2(e02)⋅…⋅(e42) and hence L(U42U2)={3,4,6}. Thus for each k∈N we obtain that
[TABLE]
Proposition 3.12**.**
Let G=C3r with r∈[3,4], (e1,…,er) a basis of G, e0=e1+…+er, and U=(e1⋅…⋅er)2e0.
-
If r=3, then for each k∈N we have
[TABLE]
2. 2.
If r=4 and V1=e12e22(e1+e2), then for each k∈N we have
[TABLE]
Proof.
- Let r=3 and k∈N. We set Ak=U6k+1(−U) and Lk=L(Ak). For ν∈[0,3], we set Uν=eν3, Vν=(−eν)eν, and we define X=e02e1e2e3.
First, consider L(U6k).
We observe that Z(U2)={U2,U1U2U3X} and Z(U3)={U3,UU1U2U3X, U0U12U22U32}. Furthermore, minL(U6k)=6k, maxL(U6k)=14k, Δ({e0,…,e3})={2}, and hence
[TABLE]
Next, consider \mathsf{L}\big{(}(-U)U\big{)}. For subsets I,J⊂[1,3] with [1,3]=I⊎J, we set
[TABLE]
Since
[TABLE]
it follows that
[TABLE]
which implies that
[TABLE]
It remains to show that 14k+6∈/Lk. For this, we consider the unique factorization z∈Z(Ak) of length ∣z∣=14k+7 which has the form
[TABLE]
Assume to the contrary that there is a factorization z′∈Z(Ak) of length ∣z′∣=14k+6. If V0∣z′, then V0V12V22V32∣z′ and z′=V0V12V22V32x with x∈Z(U6k). Whence ∣x∣∈L(U6k) and ∣z′∣∈7+L(U6k), a contradiction. Suppose that V0∤z′. Then there are I,J⊂[1,3] with [1,3]=I⊎J such that WI(−WI)∏j∈JVj∣z′ and hence z^{\prime}=W_{I}(-W_{I})\big{(}\prod_{j\in J}V_{j}\big{)}x with x∈Z(U6k). Thus ∣z′∣∈[2,5]+L(U6k), a contradiction.
- Let r=4 and k∈N. We have L(U2)={2,5} and L(U3k)=3k+3⋅[0,2k]. We define
[TABLE]
and observe that
[TABLE]
whence L(U3V1)={4,5,7,8}. Clearly, each factorization of U3kV1 contains exactly one of the atoms V1,V2,V3, and it contains it exactly once. Therefore we obtain that
[TABLE]
Proof of Theorem 1.1.
- (a) ⇒ (b) This implication is obvious.
(b) ⇒ (d) Suppose that exp(G)=n, and that
G is not isomorphic to any of the groups listed in (d). We have to show that there is
an L∈L(G) which is not an AP.
We distinguish four cases.
(d) ⇒ (a) Proposition 3.1 shows that, for all groups mentioned, all sets of lengths are APs. Proposition 2.3 shows that all differences lie in Δ∗(G).
(c) ⇔ (d) This is the special case for finite groups of [18, Theorem 1.1] (see Remark 3.13.1).
CASE 1: n≥5.
Then [17, Proposition 3.6.1] provides examples of sets of lengths which are not APs.
CASE 2: n=4.
Since G is not cyclic, it has a subgroup isomorphic to C2⊕C4. Then [16, Theorem 6.6.5] shows that {2,4,5}∈L(C2⊕C4)⊂L(G).
CASE 3: n=3.
Then G is isomorphic to C3r with r≥3, and Proposition 3.12.1 provides examples of sets of lengths which are not APs.
CASE 4: n=2.
Then G is isomorphic to C2r with r≥4, and Proposition 3.11.1 provides examples of sets of lengths which are not APs.
- (b) ⇒ (a) Suppose that G is a subgroup of C43 or a subgroup of C33. Then Proposition 2.3.2 implies that Δ∗(G)⊂{1,2}, and hence Proposition 2.2.1 implies the assertion.
(a) ⇒ (b) Suppose that (b) does not hold. Then G has a subgroup isomorphic to a cyclic group of order n≥5, or isomorphic to C24, or isomorphic to C34.
We show that in none of these cases (a) holds.
If G has a subgroup isomorphic to Cn for some n≥5, then [17, Proposition 3.6.1] shows that (a) does not hold. If G has a subgroup isomorphic to C24, then Proposition 3.11.2 shows that (a) does not hold. If G has a subgroup isomorphic to C34, then Proposition 3.12.2 shows that (a) does not hold.
- Let Δ be finite with Δ∗(G)⊂Δ⊂N. If G is cyclic with ∣G∣≤6, then all sets of lengths are AMPs with difference in Δ∗(G) by Propositions 3.1, 3.8, and 3.9. If exp(G)≥7, then Proposition 3.2 shows that there are arbitrarily large sets of lengths that are not AMPs with difference d∈Δ.
Suppose that G has rank r≥2 and exp(G)=n∈[2,6]. If n≥4, then Proposition 3.10 shows that there are arbitrarily large sets of lengths that are not AMPs with difference d∈Δ.
Thus it suffices to consider elementary 2-groups and elementary 3-groups.
Suppose that G=C2r. If r≤3, then the assertion follows from 1. If r≥4, then the assertion follows from Proposition 3.11.1.
Suppose that G=C3r. If r≤2, then the assertion follows from 1. If r≥3, then the assertion follows from Proposition 3.12.1.
∎
Proof of Corollary 1.2.
Let G′ be an abelian group such that L(G)=L(G′). Then G′ is finite by Proposition 2.2 and by [16, Theorem 7.4.1]. By Proposition 2.4, we have D(G)=ρ2(G)=ρ2(G′)=D(G′), and L(G) satisfies one of the properties given in Theorem 1.1 if and only if the same is true for L(G′). We distinguish three cases.
CASE 1: L(G) satisfies the property in Theorem 1.1.1.
Then G is cyclic of order ∣G∣≤4 or isomorphic to a subgroup of C23 or isomorphic to a subgroup of C32. Moreover, the same is true for G′.
Since D(G)≥4, the assertion follows from Proposition 3.1.
CASE 2: L(G) satisfies the property in Theorem 1.1.2.
By CASE 1, we may suppose that L(G) and L(G′) do not satisfy the property in Theorem 1.1.1.
Thus G and G′, are isomorphic to one of the following groups: C33, C2⊕C4, C22⊕C4, C2⊕C42, C42, or C43. Since C33 and C42 are the only non-isomorphic groups having the same Davenport constant, it remains to show that L(C33)=L(C42). Since maxΔ(C42)=3 (by [21, Lemma 3.3]) and maxΔ(C33)=2 (by [14, Proposition 5.5]), the assertion follows.
CASE 3: L(G) satisfies the property in Theorem 1.1.3.
By CASE 1, we may suppose that G and G′ do not satisfy the property in Theorem 1.1.1. Thus G and G′ are cyclic of order five or six. Since D(C5)=5 and D(C6)=6, the claim follows.
∎
Remark 3.13**.**
-
Let H be an atomic monoid. The system of sets of lengths L(H) is said to be additively closed if the sumset L1+L2∈L(H) for all L1,L2∈L(H). Thus L(H) is additively closed if and only if (L(H),+) is a commutative reduced semigroup with respect to set addition. If this holds, then L(H) is an acyclic semigroup in the sense of Cilleruelo, Hamidoune, and Serra ([7]). L(H) is additively closed in certain Krull monoids stemming from module theory ([1, Section 6.C]). Examples in a non-cancellative setting can be found in [20, Theorem 4.5] and a more detailed discussion of the property of being additively closed is given in [18].
-
Several properties occurring in Theorem 1.1 can be characterized by further arithmetical invariants such as the catenary degree c(G) and the tame degree t(G) (for background see [16, Sections 6.4 and 6.5]). For example, the properties (a) - (d) given in Theorem 1.1.1. are equivalent to each of the following properties (e) and (f):
c(G)≤3orc(G)=4 and {2,4}∈L(G).
c(G)≤3ort(G)=4.
(use [21, Theorem A], [11, Theorem 4.12], and [16, Theorem 6.6.3]).