اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSemiring identities of the Brandt monoid
120
0
0.0
(
0
)
تأليف
Mikhail Volkov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The 6-element Brandt monoid $B_2^1$ admits a unique addition under which it becomes an additively idempotent semiring. We show that this addition is a term operation of $B_2^1$ as an inverse semigroup. As a consequence, we exhibit an easy proof that the semiring identities of $B_2^1$ are not finitely based.
قيم البحث
اقرأ أيضاً
This paper presents new results on the identities satisfied by the hypoplactic monoid. We show how to embed the hypoplactic monoid of any rank strictly greater than 2 (including infinite rank) into a direct product of copies of the hypoplactic monoid
of rank 2. This confirms that all hypoplactic monoids of rank greater than or equal to 2 satisfy exactly the same identities. We then give a complete characterization of those identities, and prove that the variety generated by the hypoplactic monoid has finite axiomatic rank, by giving a finite basis for it.
The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or partial in
jective functions. The monoids M_{k,1} have connections with circuit complexity (studied in another paper). Here we prove that M_{k,1} and Inv_{k,1} are congruence-simple for all k. Their Green relations J and D are characterized: M_{k,1} and Inv_{k,1} are J-0-simple, and they have k-1 non-zero D-classes. They are submonoids of the multiplicative part of the Cuntz algebra O_k. They are finitely generated, and their word problem over any finite generating set is in P. Their word problem is coNP-complete over certain infinite generating sets. Changes in this version: Section 4 has been thoroughly revised, and errors have been corrected; however, the main results of Section 4 do not change. Sections 1, 2, and 3 are unchanged, except for the proof of Theorem 2.3, which was incomplete; a complete proof was published in the Appendix of reference [6], and is also given here.
The set of all cancellable elements of the lattice of semigroup varieties has recently been shown to be countably infinite. But the description of all cancellable elements of the lattice $mathbb{MON}$ of monoid varieties remains unknown. This problem
is addressed in the present article. The first example of a monoid variety with modular but non-distributive subvariety lattice is first exhibited. Then a necessary condition of the modularity of an element in $mathbb{MON}$ is established. These results play a crucial role in the complete description of all cancellable elements of the lattice $mathbb{MON}$. It turns out that there are precisely five such elements.
In this paper, a Groebner-Shirshov basis for the Chinese monoid is obtained and an algorithm for the normal form of the Chinese monoid is given.
We establish necessary and sufficient conditions for a semigroup identity to hold in the monoid of $ntimes n$ upper triangular tropical matrices, in terms of equivalence of certain tropical polynomials. This leads to an algorithm for checking whether
such an identity holds, in time polynomial in the length of the identity and size of the alphabet. It also allows us to answer a question of Izhakian and Margolis, by showing that the identities which hold in the monoid of $2times 2$ upper triangular tropical matrices are exactly the same as those which hold in the bicyclic monoid. Our results extend to a broader class of chain structured tropical matrix semigroups; we exhibit a faithful representation of the free monogenic inverse semigroup within such a semigroup, which leads also to a representation by $3times 3$ upper triangular matrix semigroups, and a new proof of the fact that this semigroup satisfies the same identities as the bicyclic monoid.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
