The monoid realization conjecture for pre-upho colored lattices

About 1 year old · traced to

Let LL be a finite graded lattice whose maximum element is the join of its atoms, and let cc be a pre-upho coloring of LL. Let s1,…,srs_1,\ldots,s_r be the atoms of LL, and define the monoid MM by the generators s1,…,srs_1,\ldots,s_r and the relations equating the color words along every pair of saturated chains from 0^\hat{0} to the join x1∨y1x_1\vee y_1 of two atoms x1,y1x_1,y_1:

M=⟨s1,…,sr∣c(0^=x0⋖x1)c(x1⋖x2)⋯c(xk−1⋖xk=x1∨y1)=c(0^=y0⋖y1)c(y1⋖y2)⋯c(yk−1⋖yk=x1∨y1)⟩.M = \left\langle s_1,\ldots,s_r\mid c(\hat{0}=x_0\lessdot x_1)c(x_1\lessdot x_2)\cdots c(x_{k-1}\lessdot x_k = x_1 \vee y_1) = c(\hat{0}=y_0\lessdot y_1)c(y_1\lessdot y_2)\cdots c(y_{k-1}\lessdot y_k = x_1 \vee y_1) \right\rangle.

Monoid realization conjecture. The monoid MM is left-cancellative, every pair of elements of MM has a greatest common left divisor, and therefore L≔(M,≤L)\mathcal{L} \coloneqq (M,\leq_L) is an upho meet semilattice containing a rank-preserving embedded copy of LL. This would establish the converse direction: every pre-upho coloring gives rise to a colored upho lattice having LL as its core. The source presents this as a speculation; no resolution is supplied.

References

Primary source

Sam Hopkins and Joel B. Lewis, “Upho lattices II: ways of realizing a core”, arXiv:2506.03343 (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.