Related papers: On regularity and the word problem for free idempo…

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…

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…

In this paper we define a congruence $\eta^{\ast}$ on semigroups. For the finite semigroups $S$, $\eta^{\ast}$ is the smallest congruence relation such that $S/\eta^{\ast}$ is a nilpotent semigroup (in the sense of Malcev). In order to…

A semigroup is called $E$-$separated$ if for any distinct idempotents $x,y\in X$ there exists a homomorphism $h:X\to Y$ to a semilattice $Y$ such that $h(x)\ne h(y)$. Developing results of Putcha and Weissglass, we characterize…

For a subgroup $S$ of a group $G$, let $I_G(S)$ denote the set of commutators $[g,s]=g^{-1}g^s$, where $g\in G$ and $s\in S$, so that $[G,S]$ is the subgroup generated by $I_G(S)$. We prove that if $G$ is a $p$-soluble finite group with a…

This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…

In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…

If $g\in G$ is a non-trivial element in a residually finite group, then there exists by definition a finite group $Q$ and a homomorphism $\varphi: G \to Q$ such that $\varphi(g) \neq e$. The residual finiteness growth $\text{RF}_G$ of a…

We investigate partial Equality and Word Problems for finitely generated groups. After introducing Upper Banach (UB) density on free groups, we prove that solvability of the Equality Problem on squares of UB-generic sets implies solvability…

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

The famous Tits' alternative states that a linear group either contains a nonabelian free group or is soluble-by-(locally finite). We study in this paper similar alternatives in pseudofinite groups. We show for instance that an…

We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…

Let $\mathcal{S}$ be a commutative semigroup endowed with a binary associative operation $+$. An element $e$ of $\mathcal{S}$ is said to be idempotent if $e+e=e$. The {\sl Erd\H{o}s-Burgess constant} of $\mathcal{S}$ is defined as the…

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…

We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To…