A Combinatorial Approach to Simplicial Sets


Notes of the talk

Simplicial Sets model weak homotopy types of topological spaces and ∞-groupoids, thanks to their particularly simple but powerful functorial definition. By their very nature, these models are very combinatorial. However, much of the combinatorics are hidden, and therefore, mostly forgotten in the above models. In this talk, we will delve into the details of the combinatorics of a simplicial set itself, working our way through the combinatorics of a simplicial complex and delta set, with their gluing data, thus motivating the need for a simplicial set in the first place. We will introduce terminology that lets us handle all this (infinite) data simultaneously, effectively bringing the combinatorics to the fore. Finally, time permitting, we will talk about the combinatorics of Kan complexes and simplicial homotopy.