Rank-generating realization conjecture for finite-type graded upho posets

Let PP be a finite-type N\mathbb{N}-graded upho poset, and let PnP_n denote the set of elements of rank nn. A monoid is LCH if it is left-cancellative and homogeneous; for an LCH monoid MM, let MnM_n denote the set of elements of length nn.

Rank-generating realization conjecture. There exists a finitely generated LCH monoid MM such that

∣Pn∣=∣Mn∣for all n∈N.|P_n|=|M_n|\quad\text{for all }n\in\mathbb{N}.

This weaker form of multiplicability remains plausible after the Petersen counterexample: the poset itself need not be multiplicable, while its rank-generating function may still be realized by a finitely generated LCH monoid. The paper gives such a realization for the Petersen example but does not establish the general statement.

References

Primary source

Ryunosuke Matsuoka, “A Non-Multiplicable Upho Poset Constructed from the Petersen Graph”, arXiv:2606.17549 (2026).

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.