On A Combinatorial Problem Connected withFactorizations
Let M be a commutative cancellative monoid. The set Δ(M), which consists of all positive integers which are distances between consecutive factorization lengths of elements in M, is a widely studied object in the theory of nonunique factorizations. If M is a Krull monoid with cyclic class group of order n ≥ 3, then it is well-known that Δ(M) ⊆ {1,..., n-2}. Moreover, equality holds for this containment when each class contains a prime divisor from M. In this note, we consider the question of determining...
First, we give a complete description of the indecomposable prime modules over a Dedekind domain. Second, if is the pullback, in the sense of [9], of two local Dedekind domains then we classify indecomposable prime -modules and establish a connection between the prime modules and the pure-injective modules (also representable modules) over such rings.