发表机构
Université Paris Cité; CNRS; IRIF（巴黎西岱大学; 法国国家科学研究中心; IRIF实验室）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
研究偏序集流的链替换，通过考虑严格递增链偏序集的单纯神经按细化排序得到。它能将有限偏序集映射到q-余纤流等，利用其组合性质证明相关推出保持执行路径空间，引入特定模型结构后对q-余纤替换也有相同结论。
AI 中文摘要
我们引入偏序集流的链替换：通过考虑给定偏序集中严格递增链的偏序集的单纯神经，并按细化排序得到。它将有限偏序集映射到q-余纤流，将有限偏序集的包含映射到q-余纤。利用链替换的组合性质，证明沿有限偏序集的序反映包含的链替换的推出保持执行路径空间。通过引入流上的胡瑞维茨模型结构，我们推断对于有限偏序集的序反映包含的任何q-余纤替换也有相同性质。
英文摘要
We introduce the chain replacement of a poset flow: it is obtained by considering the simplicial nerves of the posets of strictly increasing chains in the given poset, ordered by refinement. It maps posets to q-cofibrant flows and inclusions of posets to q-cofibrations. Using the combinatorial properties of the chain replacement, we prove that pushouts along the chain replacement of an order-reflecting inclusion of posets preserve spaces of execution paths. By introducing the Hurewicz model structure on flows (or H-model structure), we deduce the same property for any q-cofibrant replacement of an order-reflecting inclusion of posets.
Comments26 pages; v2: finiteness hypothesis removed thanks to a final topology argument; many proofs were too compressed
