We will continue on Thursday, January 9, in M5 at 1pm by the talk
S. Henry
Polygraphs and homotopy polygraphs
Abstract: Polygraphs (or computades) are the most general notion of diagram generating strict infinity categories. Some people have believed in the past that they were a presheaves category, but this was proved to be false by Makkai and Zawadowski. After a quick introduction to polygraphs and why they are not a presheaves category, I'll show that if one defines a homotopy theoretic (or infinity categorical) version of polygraphs then they form an infinity presheaves category. More generally I'll associate to any strongly cartesian monad acting on an infinity topos an infinity category of polygraphs which is itself an infinity topos.
