Finite forbidden-subdiagram conjecture for shellable Kohnert posets

Let DD be a diagram, let P(D)\mathcal{P}(D) be its Kohnert poset, and let F\mathcal{F} be a finite collection of families of subdiagrams. Finite forbidden-subdiagram conjecture. There exists a finite number of families of subdiagrams F\mathcal{F} such that, for every diagram DD, P(D)\mathcal{P}(D) is shellable if and only if there is no D~P(D)\widetilde{D}\in\mathcal{P}(D) containing a subdiagram from F\mathcal{F}. This conjecture proposes a finite forbidden-subdiagram characterization of shellability, whereas the paper states that a complete general characterization was not obtained.

Sources & referencesView supporting material

Primary source

Celia Kerr, Nicholas W. Mayers and Nicholas Russoniello, “Shellability of Kohnert posets”, arXiv:2404.17432 (2024).

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.