Forbidden-subgraph characterization of distributive Cambrian lattices

From papers

Let WW be a finite Coxeter group, let γW\gamma\in W be a Coxeter element, and let Γγ(W)\Gamma_{\gamma}(W) be the orientation of the Coxeter diagram of WW induced by γ\gamma. Assume that Γγ(W)\Gamma_{\gamma}(W) does not contain any of the induced subgraphs listed in Proposition 1.6 of the source. Let Bγ\mathcal{B}_{\gamma} denote the corresponding γ\gamma-Cambrian lattice.

Forbidden-subgraph conjecture. The list in Proposition 1.6 is exhaustive: if Γγ(W)\Gamma_{\gamma}(W) contains none of the listed induced subgraphs, then Bγ\mathcal{B}_{\gamma} is distributive.

This conjecture proposes a complete combinatorial criterion for distributivity of the relevant Cambrian lattices in finite Coxeter groups. The notation for Bγ\mathcal{B}_{\gamma} and the exact forbidden-subgraph list are given in the cited proposition.

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

Henri Mühle, “SB-Labelings, Distributivity, and Bruhat Order on Sortable Elements”, arXiv:1407.7507 (2015).

Solutions 0

No solutions have been posted yet.