Rank-generating realization conjecture for finite-type graded upho posets
Rank-generating realization conjecture for finite-type graded upho posets
Let be a finite-type -graded upho poset, and let denote the set of elements of rank . A monoid is LCH if it is left-cancellative and homogeneous; for an LCH monoid , let denote the set of elements of length .
Rank-generating realization conjecture. There exists a finitely generated LCH monoid such that
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Ryunosuke Matsuoka, “A Non-Multiplicable Upho Poset Constructed from the Petersen Graph”, arXiv:2606.17549 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.