The set-of-length-sets conjecture for finite abelian groups

Let GG and GG' be finite abelian groups with G,G>3|G|,|G'|>3, and let B(G)\mathcal B(G) denote the block monoid over GG. For a monoid MM, write L(M)\mathcal L(M) for its set of length sets.

Set-of-length-sets conjecture. If

L(B(G))=L(B(G)),\mathcal L(\mathcal B(G))=\mathcal L(\mathcal B(G')),

then

B(G)B(G).\mathcal B(G)\cong\mathcal B(G').

This conjecture asks whether the set of length sets determines the block monoid, and hence the underlying finite abelian group, up to isomorphism. The source describes it as a famous conjecture and cites recent progress, but provides no resolution here.

Sources & referencesView supporting material

Primary source

Christopher O'Neill and Roberto Pelayo, “Factorization invariants in numerical monoids”, arXiv:1508.00128 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.