اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComputing Critical Pairs in 2-Dimensional Rewriting Systems
37
0
0.0
(
0
)
تأليف
Samuel Mimram
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating, they provide one with a notion of canonical representative for the elements of the presented monoid. Polygraphs are a higher-dimensional generalization of this notion of presentation, from the setting of monoids to the much more general setting of n-categories. Here, we are interested in proving confluence for polygraphs presenting 2-categories, which can be seen as a generalization of term rewriting systems. For this purpose, we propose an adaptation of the usual algorithm for computing critical pairs. Interestingly, this framework is much richer than term rewriting systems and requires the elaboration of a new theoretical framework for representing critical pairs, based on contexts in compact 2-categories.
قيم البحث
اقرأ أيضاً
We develop the rewriting theory for monoidal supercategories and 2-supercategories. This extends the theory of higher-dimensional rewriting established for (linear) 2-categories to the super setting, providing a suite of tools for constructing bases
and normal forms for 2-supercategories given by generators and relations. We then employ this newly developed theory to prove the non-degeneracy conjecture for the odd categorification of quantum sl(2) from arXiv:1307.7816 and arXiv:1701.04133. As a corollary, this gives a classification of dg-structures on the odd 2-category conjectured in arXiv:1808.04924.
We generalize the notion of identities among relations, well known for presentations of groups, to presentations of n-categories by polygraphs. To each polygraph, we associate a track n-category, generalizing the notion of crossed module for groups,
in order to define the natural system of identities among relations. We relate the facts that this natural system is finitely generated and that the polygraph has finite derivation type.
We study a presentation of Khovanov - Lauda - Rouquiers candidate $2$-categorification of a quantum group using algebraic rewriting methods. We use a computational approach based on rewriting modulo the isotopy axioms of its pivotal structure to comp
ute a family of linear bases for all the vector spaces of $2$-cells in this $2$-category. We show that these bases correspond to Khovanov and Laudas conjectured generating sets, proving the non-degeneracy of their diagrammatic calculus. This implies that this $2$-category is a categorification of Lusztigs idempotent and integral quantum group $bf{U}_{q}(mathfrak{g})$ associated to a symmetrizable simply-laced Kac-Moody algebra $mathfrak{g}$.
We prove that the homotopy theory of Picard 2-categories is equivalent to that of stable 2-types.
Timed automata are a convenient mathematical model for modelling and reasoning about real-time systems. While they provide a powerful way of representing timing aspects of such systems, timed automata assume arbitrary precision and zero-delay actions
; in particular, a state might be declared reachable in a timed automaton, but impossible to reach in the physical system it models. In this paper, we consider permissive strategies as a way to overcome this problem: such strategies propose intervals of delays instead of single delays, and aim at reaching a target state whichever delay actually takes place. We develop an algorithm for computing the optimal permissiveness (and an associated maximally-permissive strategy) in acyclic timed automata and games.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
