Cross numbers and the characterization of finite abelian groups by length sets
Abstract
The Characterization Problem asks whether a finite abelian group with Davenport constant at least four is determined, up to isomorphism, by its system of length sets. This is a central inverse problem in non-unique factorization theory: it asks whether the possible numbers of irreducible factors retain enough information to recover the underlying class group. For rings of integers of algebraic number fields, an affirmative answer means that the ideal class group can be recovered from these factorization lengths alone. We resolve this problem for all homocyclic groups Cnr: if G is a finite abelian group with D(G)≥4 and ℒ(G)=ℒ(Cnr), then G≅ Cnr. The cross number of a sequence is the sum of the reciprocals of the orders of its terms. This weighted measure of sequence length links zero-sum theory with half-factoriality, and determining its maximal value for minimal zero-sum sequences is a longstanding extremal problem. We also obtain an exact formula for the maximal cross number of minimal zero-sum sequences over subsets whose minimum distance is divisible by the rank of the ambient group minus one. For G≅ Cn1⊕⋯⊕ Cnr with 1<n1|⋯| nr and r≥max{2,nr−2}, we prove K(G,r−1)=1+(r−1)∑p| n1 (1−p−vp(n1)), which is a key ingredient in resolving the Characterization Problem for homocyclic groups.
Related
BibTeX
@misc{zhong2026cross,
title = {{Cross numbers and the characterization of finite abelian groups by length sets}},
author = {Qinghai Zhong},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.34288},
eprint = {2610.34288},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.34288},
}
RIS
TY - UNPB
TI - Cross numbers and the characterization of finite abelian groups by length sets
AU - Qinghai Zhong
PY - 2026
DA - 2026/10/25
PB - arXiv
DO - 10.48550/arxiv.2610.34288
UR - https://arxiv.org/abs/2610.34288
AB - The Characterization Problem asks whether a finite abelian group with Davenport constant at least four is determined, up to isomorphism, by its system of length sets. This is a central inverse problem in non-unique factorization theory: it asks whether the possible numbers of irreducible factors retain enough information to recover the underlying class group. For rings of integers of algebraic number fields, an affirmative answer means that the ideal class group can be recovered from these factorization lengths alone. We resolve this problem for all homocyclic groups C_n^r: if G is a finite abelian group with D(G)≥4 and ℒ(G)=ℒ(C_n^r), then G≅ C_n^r. The cross number of a sequence is the sum of the reciprocals of the orders of its terms. This weighted measure of sequence length links zero-sum theory with half-factoriality, and determining its maximal value for minimal zero-sum sequences is a longstanding extremal problem. We also obtain an exact formula for the maximal cross number of minimal zero-sum sequences over subsets whose minimum distance is divisible by the rank of the ambient group minus one. For G≅ C_n_1⊕⋯⊕ C_n_r with 1<n_1|⋯| n_r and r≥max{2,n_r−2}, we prove K(G,r−1)=1+(r−1)∑_p| n_1 (1−p^−v_p(n_1)), which is a key ingredient in resolving the Characterization Problem for homocyclic groups.
ER -