A cyclic set is a presheaf on a particular category defined by Connes (which is usually called Connes' cyclic category though it is cocyclic, with the usual contravariant confusion), which is intermediate between a symmetric set and a simplicial set.
The shape category for simplicial sets (the simplex category) can be identified with the full subcategory of on the finite nonempty ordinals . Likewise, the shape category for symmetric sets (FinSet) can be identified with the full subcategory of on their localizations . The shape category is the full subcategory of whose objects are the categories which are freely generated by the graph . If the overall composition is set equal to identity we obtain symmetric sets again.
Mike: I copied (and attempted to clarify) the above from symmetric set, but I don’t think I believe it. If you invert the composite in , then the objects and become isomorphic and are both a retract of . This localization has exactly one nondegenerate, nonidentity self-map, which exchanges and . But shouldn’t the object ”” in have a worth of self-maps?
Zoran Škoda: Thanks, Mike, I corrected the cyclic part, the symmetric was OK before. But even has an object with infinity worth of self-maps. If the new map is taken into account, then all objects of cyclic will be on the same footing: from point one has identity, going forward one step, 2 steps, 3 steps, and so on, and one is allowed to cross the boundary , doing more than steps, even step coming all through to your predecessor .
We can also explain cyclic sets and more general objects in terms of standard generators.
A -cyclic (synonym: paracyclic object) object in category is a simplicial object in together with a sequence of isomorphisms , , such that
where are boundaries, are degeneracies. A -cocyclic (paracocyclic) object in is a -cyclic object in . -(co)cyclic object is (co)cyclic if, in addition,