اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Finite Basis Problem for Kiselman Monoids
191
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In an earlier paper, the second-named author has described the identities holding in the so-called Catalan monoids. Here we extend this description to a certain family of Hecke--Kiselman monoids including the Kiselman monoids $mathcal{K}_n$. As a consequence, we conclude that the identities of $mathcal{K}_n$ are nonfinitely based for every $nge 4$ and exhibit a finite identity basis for the identities of each of the monoids $mathcal{K}_2$ and $mathcal{K}_3$. In the third version a question left open in the initial submission has beed answered.
قيم البحث
اقرأ أيضاً
We prove a sufficient condition under which a semigroup admits no finite identity basis. As an application, it is shown that the identities of the Kauffman monoid $mathcal{K}_n$ are nonfinitely based for each $nge 3$. This result holds also for the c
ase when $mathcal{K}_n$ is considered as an involution semigroup under either of its natural involutions.
Stalactic, taiga, sylvester and Baxter monoids arise from the combinatorics of tableaux by identifying words over a fixed ordered alphabet whenever they produce the same tableau via some insertion algorithm. In this paper, three sufficient conditions
under which semigroups are finitely based are given. By applying these sufficient conditions, it is shown that all stalactic and taiga monoids of rank greater than or equal to $2$ are finitely based and satisfy the same identities, that all sylvester monoids of rank greater than or equal to $2$ are finitely based and satisfy the same identities and that all Baxter monoids of rank greater than or equal to $2$ are finitely based and satisfy the same identities.
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank $1$ is b
oth $2$-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank $1$ is context-free; and that the word problem of a free inverse monoid of rank greater than $1$ is not poly-context-free.
In this paper, we give a characterization of digraphs $Q, |Q|leq 4$ such that the associated Hecke-Kiselman monoid $H_Q$ is finite. In general, a necessary condition for $H_Q$ to be a finite monoid is that $Q$ is acyclic and its Coxeter components ar
e Dynkin diagram. We show, by constructing examples, that such conditions are not sufficient.
We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case, and show
that it has decidable membership problem. We establish several algorithmic properties of the class of finite-${cal{J}}$-above (inverse) monoids. We prove that the image of the eraser morphism in the free inverse monoid case (and more generally, in the finite-${cal{J}}$-above case) has decidable membership problem, and relate its kernel to the free group fragile words.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
