Previous |  Up |  Next

Article

Keywords:
Polygraphs; computads; strict $\omega$-categories; Conduché functors
Summary:
We define a class of morphisms between strict $\omega$-categories called discrete Conduché $\omega$-functors that generalize discrete Conduché functors between categories and we study their properties related to polygraphs. The main result we prove is that for every discrete Conduché $\omega$-functor $f:C\rightarrow D$, if $D$ is a free strict $\omega$-category on a polygraph then so is $C$.
References:
[1] Burroni, Albert: Higher-dimensional word problems with applications to equational logic. Theoretical Computer Science, 115(1):43–62
[2] Conduché, François: Au sujet de l’existence d’adjoints à droite aux foncteurs “image réciproque” dans la catégorie des catégories. C. R. Acad. Sci. Paris, 275:A891–894
[3] Giraud, Jean: Méthode de la descente. Société Mathématique de France
[4] Guetta, Léonard: Homology of categories via polygraphic resolutions, 2020. arxiv:arXiv:2003.10734 http://arxiv.org/pdf/arXiv:2003.10734
[5] Hopcroft, John E, Ullman, : Introduction to automata theory, languages, and computation. Addison-Wesley
[6] Lafont, Yves, Métayer, François: Polygraphic resolutions and homology of monoids. Journal of Pure and Applied Algebra, 213(6):947–968
[7] Lafont, Yves, Métayer, François, Worytkiewicz, Krzysztof: A folk model structure on omega-cat. Advances in Mathematics, 224(3):1183–1231
[8] Makkai, Michael: The word problem for computads. Available on the author’s web page http://www.math.mcgill.ca/makkai
[9] Métayer, François: Resolutions by polygraphs. Theory and Applications of Categories, 11(7):148–184
[10] Métayer, François: Cofibrant objects among higher-dimensional categories. Homology, Homotopy and Applications, 10(1):181–203
[11] Street, Ross: Limits indexed by category-valued 2-functors. Journal of Pure and Applied Algebra, 8(2):149–181
[12] Street, Ross: Categorical structures. Handbook of algebra, 1:529–577
Partner of
EuDML logo