Hom-counting functions, combinatorial categories and related problems
Abstract
Combinatorial categories satisfy a stronger form of Yoneda Lemma, namely, the isomorphism type of an object can be recovered by counting the number of homomorphisms from all other objects into it. In this work, we show that this property holds for sufficiently small categories by studying the algebra of homomorphism-counting functions. We present applications of the results to the isomorphism problem in group, graph and ring theory.
0
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.