Papers
Topics
Authors
Recent
Search
2000 character limit reached

On semisimplicial sets satisfying the Kan condition

Published 20 Oct 2012 in math.AT and math.GT | (1210.5650v1)

Abstract: A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof of this fact and a generalization to multisemisimplicial sets.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.