Composition closed premodel structures and the Kreweras lattice (Q6189686)

A \textit{premodel structure} consists of a category \(\mathcal{C}\) with all finite limits and colimits equipped with two weak factorization systems \((\mathcal{L},\mathcal{R})\) and \((\mathcal{L}',\mathcal{R}')\) such that \(\mathcal{R}\subset \mathcal{R}'\) (equivalently \(\mathcal{L}' \subset \mathcal{L}\)). The weak equivalences of a premodel structure is the class of maps \(\mathcal{W} := \mathcal{R}\circ \mathcal{L}'\). A premodel structure is \textit{composition closed} if \(\mathcal{W}\) is closed under composition. A \textit{Quillen model structure} is a premodel structure such that \(\mathcal{W}\) satisfies the two-out-of-three property. The paper delves into the intricate combinatorial structure of premodel structures on finite lattices. The authors establish that, on a finite lattice \(L\), there is a refinement of the ordering on weak factorization systems on \(L\) such that the intervals are exactly the composition closed premodel structures. Moreover, the set of weak factorization systems equipped with this ordering is a finite lattice. Then in the specific case of the lattice \([n]\) with \(n\geq 0\), they prove that the composition closed premodel structures are in bijection with intervals of the Kreweras lattice. Finally, the authors prove that there is an explicit bijection between certain tricolored trees and Kreweras pairs under which a tricolored tree represents a model structure if and only if it does not have a red branch descended from any non-red branch.