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

Eraser morphisms and membership problem in groups and monoids

112   0   0.0 ( 0 )
 نشر من قبل Alexander Zakharov
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English




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

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.



قيم البحث

اقرأ أيضاً

The aim of this short note is to provide a proof of the decidability of the generalized membership problem for relatively quasi-convex subgroups of finitely presented relatively hyperbolic groups, under some reasonably mild conditions on the peripher al structure of these groups. These hypotheses are satisfied, in particular, by toral relatively hyperbolic groups.
We consider finite sums of counting functions on the free group $F_n$ and the free monoid $M_n$ for $n geq 2$. Two such sums are considered equivalent if they differ by a bounded function. We find the complete set of linear relations between equivale nce classes of sums of counting functions and apply this result to construct an explicit basis for the vector space of such equivalence classes. Moreover, we provide a graphical algorithm to determine whether two given sums of counting functions are equivalent. In particular, this yields an algorithm to decide whether two sums of Brooks quasimorphisms on $F_n$ represent the same class in bounded cohomology.
We prove that an inverse-free equation is valid in the variety LG of lattice-ordered groups (l-groups) if and only if it is valid in the variety DLM of distributive lattice-ordered monoids (distributive l-monoids). This contrasts with the fact that, as proved by Repnitskii, there exist inverse-free equations that are valid in all Abelian l-groups but not in all commutative distributive l-monoids, and, as we prove here, there exist inverse-free equations that hold in all totally ordered groups but not in all totally ordered monoids. We also prove that DLM has the finite model property and a decidable equational theory, establish a correspondence between the validity of equations in DLM and the existence of certain right orders on free monoids, and provide an effective method for reducing the validity of equations in LG to the validity of equations in DLM.
200 - Karl Auinger , Yuzhu Chen , Xun Hu 2014
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.
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 con sequence, 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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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