Combinatorics in (2,1)-categories
Abstract
Groupoid cardinality is an invariant of locally finite groupoids which has many of the properties of the cardinality of finite sets, but which takes values in all non-negative real numbers, and accounts for the morphisms of a groupoid. Several results on groupoid cardinality are proved, analogous to the relationship between cardinality of finite sets and i.e. injective or surjective functions. We also generalize to a broad class of (2,1)-categories a famous theorem of Lov\'asz which characterizes the isomorphism type of relational structures by counting the number of homomorphisms into them.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.