اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCoherent presentations of Artin monoids
271
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We compute coherent presentations of Artin monoids, that is presentations by generators, relations, and relations between the relations. For that, we use methods of higher-dimensional rewriting that extend Squiers and Knuth-Bendixs completions into a homotopical completion-reduction, applied to Artins and Garsides presentations. The main result of the paper states that the so-called Tits-Zamolodchikov 3-cells extend Artins presentation into a coherent presentation. As a byproduct, we give a new constructive proof of a theorem of Deligne on the actions of an Artin monoid on a category.
قيم البحث
اقرأ أيضاً
This paper shows how to construct coherent presentations of a class of monoids, including left-cancellative noetherian monoids containing no nontrivial invertible element and admitting a Garside family. Thereby, it resolves the question of finding a
unifying generalisation of the following two distinct extensions of Delignes original construction of coherent presentations for spherical Artin-Tits monoids: to general Artin-Tits monoids, and to Garside monoids. The result is applied to a dual braid monoid, and to some monoids which are neither Artin-Tits nor Garside. For the Artin-Tits monoid of type $widetilde{A}_{2}$, a finite coherent presentation is given, having a finite Garside family as a generating set.
We give a characterisation of functors whose induced functor on the level of localisations is an equivalence and where the isomorphism inverse is induced by some kind of replacements such as projective resolutions or cofibrant replacements.
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 introduce acyclic polygraphs, a notion of complete categorical cellular model for (small) categories, containing generators, relations and higher-dimensional globular syzygies. We give a rewriting method to construct explicit acyclic polygraphs fr
om convergent presentations. For that, we introduce higher-dimensional normalisation strategies, defined as homotopically coherent ways to relate each cell of a polygraph to its normal form, then we prove that acyclicity is equivalent to the existence of a normalisation strategy. Using acyclic polygraphs, we define a higher-dimensional homotopical finiteness condition for higher categories which extends Squiers finite derivation type for monoids. We relate this homotopical property to a new homological finiteness condition that we introduce here.
We study convergent (terminating and confluent) presentations of n-categories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for n-categories, generalizing the one introduced by Squier fo
r word rewriting systems. We characterize this property by using the notion of critical branching. In particular, we define sufficient conditions for an n-category to have finite derivation type. Through examples, we present several techniques based on derivations of 2-categories to study convergent presentations by 3-polygraphs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
