On semisimplicial sets satisfying the Kan condition (Q1945809)

If one takes the definition of simplicial set and omits the parts involving the degeneracy maps, one obtains the definition of a semisimplicial set. Let \(X\) be such an object, and further, for each \(n \geq 0\) suppose that for any subset \(\{x_0, x_1, \dots, x_{k-1}, x_{k+1}, x_{k+2}, \dots, x_{n+1}\} \subset X_n\) such that \(d_ix_j = d_{j-1}x_i\) for all \(i < j\), with \(i \neq k \neq j,\) there exists some \(x \in X_{n+1}\) with \(d_ix = x_i\) for all \(i \neq k\). Then \(X\) is a semisimplicial set that satisfies the Kan condition. If the output of a face map is referred to as a face, then the main idea behind the Kan condition is that any time there are \(n+1\) \(n\)-simplices that act like they are \(n+1\) of the \(n+2\) faces of some \((n+1)\)-simplex, then these \(n\)-simplices are indeed all but one of the faces of some \((n+1)\)-simplex \(x\). In [\textit{C. P. Rourke} and \textit{B. J. Sanderson}, Q. J. Math., Oxf. II. Ser. 22, 321--338 (1971; Zbl 0226.55019)], it was shown that a semisimplicial set satisfying the Kan condition can be equipped with the full structure of a simplicial set. The paper under review gives a combinatorial proof of this result that can be contrasted with the PL techniques used by Rourke and Sanderson. Additionally, the author generalizes the Kan condition to multisemisimplicial sets, and then extends his combinatorial techniques to show that a multisemisimplicial set satisfying this condition can be given the structure of a multisimplicial set. This paper is nicely written and the multisemisimplicial result described above was profitably used in the author's (not yet published) work with Gerd Laures on putting \(E_\infty\)-structures on Quinn spectra. Though this joint work is not yet published, it is briefly discussed in [\textit{G. Laures} and \textit{J. E. McClure}, ``Multiplicative properties of Quinn spectra'', Forum Math., doi:10.1515/forum-2011-0086 (March 2012)] (this paper is published, but not yet in print).