Related papers: A group-theoretical interpretation of the word pro…

We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…

The algebraic extension $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ of the extended bicyclic semigroup for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ is introduced. It is proven that…

Let $\mathcal{S}$ be a nonempty commutative semigroup written additively. An element $e$ of $\mathcal{S}$ is said to be idempotent if $e+e=e$. The Erd\H{o}s-Burgess constant of the semigroup $\mathcal{S}$ is defined as the smallest positive…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

It was proved by Oliveira and Silva (2005) that every finitely generated inverse subsemigroup of the monogenic free inverse semigroup $FI_1$ is finitely presented. The present paper continues this development, and gives generating sets and…

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…

Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually…

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

Let $F$ be a field with at least three elements and $G$ a locally finite group. This paper aims to show that if either $F$ is algebraically closed or the characteristic of $F$ is positive, then an element in the group algebra $FG$ is a…

Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…

We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We prove that if S is a commutative semigroup with well founded universal semilattice or a solvable inverse semigroup with well founded semilattice of idempotents, then every strongly productive ultrafilter on S is idempotent. Moreover we…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set $\Bbb{P}$ of all primes and $G$ a finite group. A chief factor $H/K$ of $G$ is said to be $\sigma$-central if the semidirect product $(H/K)\rtimes (G/C_{G}(H/K))$ is a…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms, assume that $G$ has a maximal $A$-invariant subgroup $M$ that is a direct product of some isomorphic simple groups, we prove that if $G$ has a…

Lee and Kwon [12] defined an ordered semigroup S to be completely regular if a 2 (a2Sa2] for every a 2 S. We characterize every completely regular ordered semigroup as a union of t-simple subsemigroups, and every Clifford ordered semigroup…