ترغب بنشر مسار تعليمي؟ اضغط هنا

Limit varieties of monoids satisfying a certain identity

83   0   0.0 ( 0 )
 نشر من قبل Sergey Gusev
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

A variety is finitely based if it has a finite basis of identities. A minimal non-finitely based variety is called limit. A monoid is aperiodic if all its subgoups are trivial. Limit varieties of aperiodic monoids have been studied by Jackson, Lee, Zhang and Luo, Gusev and Sapir. In particular, Gusev and Sapir have recently reduced the problem of classifying all limit varieties of aperiodic monoids to the two tasks. One of them is to classify limit varieties of monoids satisfying $xsxt approx xsxtx$. In this paper, we completely solve this task. In particular, we exhibit the first example of a limit variety of monoids with countably infinitely many subvarieties. In view of the result by Jackson and Lee, the smallest known monoid generating a variety with continuum many subvarieties is of order six. It follows from the result by Edmunds et al. that if there exists a smaller example, then up to isomorphism and anti-isomorphism, it must be a unique monoid $P_2^1$ of order five. Our main result implies that the variety generated by $P_2^1$ contains only finitely based subvarieties and so has only countably many of them.



قيم البحث

اقرأ أيضاً

We survey results devoted to the lattice of varieties of monoids. Along with known results, some unpublished results are given with proofs. A number of open questions and problems are also formulated.
A limit variety is a variety that is minimal with respect to being non-finitely based. The two limit varieties of Marcel Jackson are the only known examples of limit varieties of aperiodic monoids. Our previous work had shown that there exists a limi t subvariety of aperiodic monoids that is different from Marcel Jacksons limit varieties. In this paper, we introduce a new limit variety of aperiodic monoids.
In this paper we introduce and study some geometric objects associated to Artin monoids. The Deligne complex for an Artin group is a cube complex that was introduced by the second author and Davis (1995) to study the K(pi,1) conjecture for these grou ps. Using a notion of Artin monoid cosets, we construct a version of the Deligne complex for Artin monoids. We show that for any Artin monoid this cube complex is contractible. Furthermore, we study the embedding of the monoid Deligne complex into the Deligne complex for the corresponding Artin group. We show that for any Artin group this is a locally isometric embedding. In the case of FC-type Artin groups this result can be strengthened to a globally isometric embedding, and it follows that the monoid Deligne complex is CAT(0) and its image in the Deligne complex is convex. We also consider the Cayley graph of an Artin group, and investigate properties of the subgraph spanned by elements of the Artin monoid. Our final results show that for a finite type Artin group, the monoid Cayley graph embeds isometrically, but not quasi-convexly, into the group Cayley graph.
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.
In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garsides greedy normal forms and quadratic convergent rewriting systems, in particular those associated with the plactic monoids, are typical examples. Having introduced a parameter, called the class and measuring the complexity of the normalisation of length-three words, we analyse the normalisation of longer words and describe a number of possible behaviours. We fully axiomatise normalisations of class (4, 3), show the convergence of the associated rewriting systems, and characterise those deriving from a Garside family.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا