A Characterization of class groups via sets of lengths II
Abstract
Let H be a Krull monoid with finite class group G and suppose that every class contains a prime divisor. If an element a ∈ H has a factorization a=u1 · … · uk into irreducible elements u1, …, uk ∈ H, then k is called the length of the factorization and the set L (a) of all possible factorization lengths is the set of lengths of a. It is classical that the system L (H) = \ L (a) a ∈ H \ of all sets of lengths depends only on the class group G, and a standing conjecture states that conversely the system L (H) is characteristic for the class group. We verify the conjecture if the class group is isomorphic to Cnr with r,n 2 and r \2, (n+2)/6\. Indeed, let H' be a further Krull monoid with class group G' such that every class contains a prime divisor and suppose that L (H)= L (H'). We prove that, if one of the groups G and G' is isomorphic to Cnr with r,n as above, then G and G' are isomorphic (apart from two well-known pairings).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.