Related papers: G. S. Tseytin's seven-relation semigroup with unde…
This is an English translation of G.N. Chebotarev's paper "On The Klein-Hilbert Resolvent Problem" which was originally written in Russian and published in Izvestiya Kazan. Fiz. Mat. Obshch., 6 (1932-1933), 5-22. In this article, Chebotarev…
We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…
Semitopological isomorphisms of topological groups were introduced by Arnautov, who posed several questions related to compositions of semitopological isomorphisms and the groups G (we call them Arnautov groups) such that for every group…
The concept of a $\Gamma$-semigroup has been introduced by Mridul Kanti Sen in the Int. Symp., New Delhi, 1981. It is well known that the Green's relations play an essential role in studying the structure of semigroups. In the present paper…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…
We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
The syntactic semigroup problem is to decide whether a given finite semigroup is syntactic or not. This work investigates the syntactic semigroup problem for both the semigroup reducts of $A^+(B_n)$, the affine near-semiring over a Brandt…
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…
Epigroups are semigroups equipped with an additional unary operation called pseudoinversion. Each finite semigroup can be considered as epigroup. We prove the following theorem announced by Zhil'tsov in 2000: the equational theory of the…
In this note, an alternative approach to establish observability for semigroups based on their smoothing properties is presented. The results discussed here are closely related to those recently obtained in [arXiv:2112.01788], but the…
The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…
The purpose of this paper is to revisit the proof of the Gearhart-Pr\"uss-Huang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on the…
This is an English translation of six articles, originally written in Ukrainian, by the semigroup theorist Anton Kazimirovich Sushkevich (1889-1961). The articles date between 1935 and 1939, and were all written in Kharkiv. A preface is…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
In several different settings, one comes across situations in which the objects of study are locally consistent but globally inconsistent. Earlier work about probability distributions by Vorob'ev (1962) and about database relations by…
One can observe that Coxeter groups and right-angled Artin groups share the same solution to the word problem. On the other hand, in his study of reflection subgroups of Coxeter groups Dyer introduces a family of groups, which we call Dyer…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…
Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality…