Submitted:
18 September 2026
Posted:
21 September 2026
You are already at the latest version
Abstract
Martínez Alberga and Roitzheim [6] classified model structures on the five-point pentagon and proved their Bousfield reachability. We describe every model on \( H(p,q) \) by two weak-block partitions and two acyclic-fibration threshold vectors. Two endpoint conditions complete the classification and give explicit counts. We extend the classification to every nonempty finite horizontal sum \( H(p_1,...,p_k) \) by imposing the endpoint conditions on each pair of branches. Every classified model is reachable. Two cuts remove the interactions at the shared endpoints. The remaining model is constructed branch by branch; at most two further set-localizations restore the target. Classification and reachability therefore give complementary descriptions: which models exist, and how to construct them.
Keywords:
model structures
; Bousfield localization
; finite lattices
; horizontal sums
; transfer systems
; formal verification
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.