The inverse problem associated to the Davenport constant for \(C_2 \oplus C_2 \oplus C_{2n}\), and applications to the arithmetical characterization of class groups (Q625404)

Let \(G\) be an abelian group, and denote by \(D(G)\) the Davenport constant of \(G\), that is, the least integer \(n\), such that each sequence \(a_1, \dots, a_n\) of elements in \(G\) contains a subsequence \(a_{i_1},\dots, a_{i_k}\) adding up to 0. The inverse problem associated to \(D(G)\) is the question of classifying all sequences of length \(D(G)-1\) which do not contain a zero-sum subsequence. Apart from their intrinsic interest inverse problems for small groups appear naturally in the determination of \(D(G)\) for larger groups, and in the theory of non-unique factorization. In the present work it is first shown that a long zero-sum free sequence in an arbitrary group contains elements with high multiplicity. This general theorem is improved for groups containing a large 2-generated subgroup, a large cyclic subgroup, and finally for groups of the form \(C_2^{r-1}\oplus C_{2n}\). In the latter case the result is probably close to optimal. Finally the inverse problem for groups of the form \(C_2^2\oplus C_{2n}\) is completely solved. As application the Davenport constant for groups of the form \(C_4^2\oplus C_{4n}\) and \(C_6^2\oplus C_{6n}\) is computed. Further it is shown that for factorization domains with class groups isomorphic to one of \(C_2^2\oplus C_{2n}\), \(C_3\oplus C_{3n}\), or \(C_2^{r-1}\oplus C_4\) the class group is determined by the set of possible lengths of factorizations of elements of the domain.