On morphisms between diagrams, and strictification of (β,n)-categories
- π€ Speaker: Amar Hadzihasanovic - Taltech
- π Date & Time: Tuesday 22 April 2025, 14:00 - 15:00
- π Venue: SS03, Computer Laboratory
Abstract
Regular directed complexes are an order-theoretic model of (shapes of) higher-categorical diagrams. There are two natural notions of morphism between regular directed complexes: they are called “maps” and “comaps” and are dual to each other. Roughly, a map can only collapse or rigidly identify cells, while a comap can only merge cells together.
A subclass of maps—called cartesian maps—-serves as a foundation for a model of (β,n)-categories with exceptionally nice properties. In this talk, I will present a conjecture on the existence of a certain factorisation of cartesian maps against comaps, which I strongly believe to be true. This conjecture implies a (semi)strictification theorem for (β,n)-categories in the same explicit, combinatorial style as Mac Lane’s celebrated strictification theorem for bicategories.
This talk is based on joint work with ClΓ©mence Chanavat, both past and in progress.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- SS03, Computer Laboratory
- tcw57βs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Tuesday 22 April 2025, 14:00-15:00