Related papers: Lee monoid $L_4^1$ is non-finitely based

An algebra that generates a variety with uncountably many subvarieties is said to be of type $2^{\aleph_0}$. We show that the Rees quotient monoid $M(aabb)$ of order ten is of type $2^{\aleph_0}$, thereby affirmatively answering a recent…

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…

We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…

Let $G$ be a finite group and $G'$ its commutator subgroup. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered…

An atomic monoid $M$ is called a length-factorial monoid (or an other-half-factorial monoid) if for each non-invertible element $x \in M$ no two distinct factorizations of $x$ have the same length. The notion of length-factoriality was…

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…

For every one-relator monoid $M = \langle A \mid u=v \rangle$ with $u, v \in A^*$ we construct a contractible $M$-CW complex and use it to build a projective resolution of the trivial module which is finitely generated in all dimensions.…

Right (and left) coherency and right (and left) weak coherency are natural finitary conditions for monoids. Determining whether or not a given monoid has any of these properties is historically a difficult problem. This paper has several…

In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…

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…

A new sufficient condition under which a semigroup admits no finite identity basis has been recently suggested in a joint paper by Karl Auinger, Yuzhu Chen, Xun Hu, Yanfeng Luo, and the author (see http://arxiv.org/abs/1405.0783). Here we…

The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…

Up to isomorphism, there exist two non-isomorphic two-element monoids. We show that the identities of the free product of every pair of such monoids admit no finite basis.

For every semilattice $\mathcal{S}=(S,+)$, the set $\mathrm{End}(\mathcal{S})$ of its endomorphisms forms a semiring under point-wise addition and composition. We prove that the semiring of all endomorphisms of the 3-element chain has no…

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

The problem of determining the representation type of the full transformation monoid was resolved by Ponizovskii, Putcha, and Ringel. In this paper, we present a similar result for the monoid of binary relations, a partial result for the…