Characterization Problem for finite abelian groups by length sets
For finite abelian groups and with , does imply ? Here denotes the system of sets of factorization lengths associated with .
References
- Cross numbers and the characterization of finite abelian groups by length sets — arXiv — Qinghai Zhong
Source: arXiv
Progress summary
A new unrefereed preprint claims the length data determine every homocyclic finite abelian group, but the broader problem remains open.
The problem asks whether the sets of factorization lengths determine a finite abelian group, under the usual hypothesis . The unrestricted finite-abelian-group question is not settled by the available evidence.
Known results
- A 2017 preprint proves the characterization for when , or when and is a prime power.
- Earlier work covers elementary -groups, cyclic groups, rank-two groups, and some homocyclic cases.
- The conjecture fails without : .
October 2026 homocyclic claim
Qinghai Zhong’s preprint Cross numbers and the characterization of finite abelian groups by length sets claims a resolution for all homocyclic groups and derives new high-rank cross-number formulas. This is claimed progress, not an independently verified resolution, and the available record does not establish the general finite-abelian-group problem.
Current status (as of October 2026): The problem is settled only in previously known families and is claimed for all homocyclic groups by an unrefereed preprint; the general finite-abelian-group characterization remains open.
Solutions 0
No solutions have been posted yet.