2018
DOI: 10.1080/00927872.2018.1430811
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Let H be a transfer Krull monoid over a finite abelian group G (for example, rings of integers, holomorphy rings in algebraic function fields, and regular congruence monoids in these domains). Then each nonunit a∈H can be written as a product of irreducible elements, say , and the number of factors k is called the length of the factorization. The set L(a) of all possible factorization lengths is the set of lengths of a. It is classical that the system ℒ(H) = {L(a)∣a∈H} of all sets of lengths depends only on th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 29 publications
0
6
0
Order By: Relevance
“…The set of distances ∆(H) is an interval with min ∆(H) = 1 ([21]) whose maximum is unknown in general ( [22]) (this is in contrast to the fact that in finitely generated Krull monoids any finite set ∆ with min ∆ = gcd ∆ may occur as set of distances [18]). The standing conjecture is that the system of sets of lengths is characteristic for the group (see [15] for a survey, and [17,23,32,31] for recent progress). This means that L(H) = L(H ′ ) for all Krull monoids H ′ having prime divisors in all classes and class group G ′ not being isomorphic to G (here we need |G| ≥ 4).…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…The set of distances ∆(H) is an interval with min ∆(H) = 1 ([21]) whose maximum is unknown in general ( [22]) (this is in contrast to the fact that in finitely generated Krull monoids any finite set ∆ with min ∆ = gcd ∆ may occur as set of distances [18]). The standing conjecture is that the system of sets of lengths is characteristic for the group (see [15] for a survey, and [17,23,32,31] for recent progress). This means that L(H) = L(H ′ ) for all Krull monoids H ′ having prime divisors in all classes and class group G ′ not being isomorphic to G (here we need |G| ≥ 4).…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…(b) G is cyclic of order |G| ≤ 6 or isomorphic to a subgroup of C 3 2 or isomorphic to a subgroup of C 2 3 . 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:…”
Section: The Following Statements Are Equivalentmentioning
confidence: 99%
“…It asks whether for each two transfer Krull monoids H and H ′ over groups G and G ′ their system of sets of lengths coincide if and only if G and G ′ are isomorphic. The standing conjecture is that this holds true for all finite abelian groups G (apart from two trivial exceptional pairings) and we refer to [20,24,36,35] for recent progress in this direction.…”
Section: Arithmetic Of the Monoid Of Product-one Sequencesmentioning
confidence: 99%