← All problems

Characterization Problem for finite abelian groups by length sets

For finite abelian groups GG and HH with D(G)≥4\mathsf D(G)\ge 4, does L(G)=L(H)\mathcal L(G)=\mathcal L(H) imply G≅HG\cong H? Here L(G)\mathcal L(G) denotes the system of sets of factorization lengths associated with GG.

References

Progress summary

Refreshed
Open · progress reported

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 D(G)≥4\mathsf{D}(G)\geq 4. The unrestricted finite-abelian-group question is not settled by the available evidence.

Known results

  • A 2017 preprint proves the characterization for G≅CnrG\cong C_n^r when r≤n−3r\leq n-3, or when r≥n−1≥2r\geq n-1\geq 2 and nn is a prime power.
  • Earlier work covers elementary 22-groups, cyclic groups, rank-two groups, and some homocyclic cases.
  • The conjecture fails without D(G)≥4\mathsf{D}(G)\geq 4: L(C3)=L(C2⊕C2)\mathcal{L}(C_3)=\mathcal{L}(C_2\oplus C_2).

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.

Sources

Solutions 0

No solutions have been posted yet.