اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComputads and Multitopic Sets
24
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We compare computads with multitopic sets. Both these kinds of structures have n-dimensional objects (called n-cells and n-pasting diagrams, respectively). The computads form a subclass of the more familiar class of omega-categories, while multitopic sets have been devised by Hermida, Makkai and Power as a vehicle for a definition of the concepts of weak omega-category. Our main result states that the category of multitopic sets is equivalent to that of many-to-one computads, a certain full subcategory of the category of all computads.
قيم البحث
اقرأ أيضاً
We define a general notion of centrally $Gamma$-graded sets and groups and of their graded products, and prove some basic results about the corresponding categories: most importantly, they form braided monoidal categories. Here, $Gamma$ is an arbitra
ry (generalized) ring. The case $Gamma$ = Z/2Z is studied in detail: it is related to Clifford algebras and their discrete Clifford groups (also called Salingaros Vee groups).
Many special classes of simplicial sets, such as the nerves of categories or groupoids, the 2-Segal sets of Dyckerhoff and Kapranov, and the (discrete) decomposition spaces of G{a}lvez, Kock, and Tonks, are characterized by the property of sending ce
rtain commuting squares in the simplex category $Delta$ to pullback squares of sets. We introduce weaker analogues of these properties called completeness conditions, which require squares in $Delta$ to be sent to weak pullbacks of sets, defined similarly to pullback squares but without the uniqueness property of induced maps. We show that some of these completeness conditions provide a simplicial set with lifts against certain subsets of simplices first introduced in the theory of database design. We also provide reduced criteria for checking these properties using factorization results for pushouts squares in $Delta$, which we characterize completely, along with several other classes of squares in $Delta$. Examples of simplicial sets with completeness conditions include quasicategories, Kan complexes, many of the compositories and gleaves of Flori and Fritz, and bar constructions for algebras of certain classes of monads. The latter is our motivating example which we discuss in a companion paper.
In The factorization of the Giry monad (arXiv:1707.00488v2) the author considers two $sigma$-algebras on convex spaces of functions to the unit interval. One of them is generated by the Boolean subobjects and the other is the $sigma$-algebra induced
by the evaluation maps. The author asserts that, under the assumptions given in the paper, the two $sigma$-algebras coincide. We give examples contradicting this statement.
We define a general concept of pseudo algebras over theories and 2-theories. A more restrictive such notion was introduced by Hu and Kriz, but as noticed by M. Gould, did not capture the desired examples. The approach taken in this paper corrects the
mistake by introducing a more general concept, allowing more flexibility in selecting coherence diagrams for pseudo algebras.
We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
