Related papers: Identities of the stylic monoid
In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.
Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…
Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…
In this paper we describe the quotients of several plactic-like monoids by the least congruences containing the relations $a^{\sigma(a)} = a$ with $\sigma(a)\ge 2$ for every generator $a$. The starting point for this description is the…
Jackson and Lee proved that certain six-element monoid generates a hereditarily finitely based variety $\mathbb E^1$ whose lattice of subvarieties contains an infinite ascending chain. We identify syntactic monoids which generate finitely…
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…
After a review of the concept of "monad with arities" we show that the category of algebras for such a monad has a canonical dense generator. This is used to extend the correspondence between finitary monads on sets and Lawvere's algebraic…
A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. We present a new pair of limit varieties of monoids and show that together with the five limit varieties of monoids…
We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…
We investigate complement-finite submonoids of the monoid of nonnegative integer points of a unipotent linear algebraic group $G$. These monoids are in general noncommutative but they specialize to the generalized numerical monoids of…
We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…
The class of finitely presented algebras over a field K with a set of generators a_1,...,a_n and defined by homogeneous relations of the form a_1a_2...a_n = a_{sigma(1)}a_{sigma(2)}...a_{sigma(n)}, where sigma runs through an abelian…
We introduce a monoid corresponding to knotted surfaces in four space, from its hyperbolic splitting represented by marked diagram in braid like form. It has four types of generators: two standard braid generators and two of singular type.…
For each positive $n$, let $u_n = v_n$ denote the identity obtained from the Adjan identity $(xy) (yx) (xy) (xy) (yx) = (xy) (yx) (yx) (xy) (yx)$ by substituting $(xy) \rightarrow (x_1 x_2 \dots x_n)$ and $(yx) \rightarrow (x_n \dots x_2…
The surface singular braid monoid corresponds to marked graph diagrams of knotted surfaces in braid form. In a quest to resolve linearity problem for this monoid, we will show that if it is defined on at least two or at least three strands,…
This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…
We exhibit a faithful representation of the plactic monoid of every finite rank as a monoid of upper triangular matrices over the tropical semiring. This answers a question first posed by Izhakian and subsequently studied by several…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…