The N-regularity conjecture for mutable lattices

Let LL be a mutable lattice, and let Hasse(L)\operatorname{Hasse}(L) denote its Hasse diagram. Consider the underlying undirected graph of this diagram, and let NN be a constant.

N-regularity conjecture. Every vertex of the underlying undirected graph of Hasse(L)\operatorname{Hasse}(L) has degree NN; equivalently, the graph is NN-regular.

The paper states that the converse is false, so NN-regularity does not characterize mutable lattices. The conjecture itself is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Kan Nagano, “Flip of lattices”, arXiv:2605.09601 (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.