Acyclicity conditions on pasting diagrams

Abstract

We study various acyclicity conditions on higher-categorical pasting diagrams in the combinatorial framework of regular directed complexes. We present an apparently weakest acyclicity condition under which the $\omega$-category presented by a diagram shape is freely generated in the sense of polygraphs. We then consider stronger conditions under which this $\omega$-category is equivalent to one obtained from an augmented directed chain complex in the sense of Steiner, or consists only of subsets of cells in the diagram. Finally, we study the stability of these conditions under the operations of pasting, suspensions, Gray products, joins and duals.