Related papers: The word problem for some classes of Adian inverse…

It is well known that the problem solving equations in virtually free groups can be reduced to the problem of solving twisted word equations with regular constraints over free monoids with involution. In this paper we prove that the set of…

Given a set-theoretical solution of the pentagon equation $s:S\times S\to S\times S$ on a set $S$ and writing $s(a, b)=(a\cdot b,\, \theta_a(b))$, with $\cdot$ a binary operation on $S$ and $\theta_a$ a map from $S$ into itself, for every…

Two finite words $u$ and $v$ are called abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of an infinite word $\mathbf{x}$ is the set of infinite words…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…

An amalgam of inverse semigroups [S,T,U] is full if U contains all of the idempotents of S and T. We show that for a full amalgam [S,T,U], the C*-algebra of the inverse semigroup amaglam of S and T over U is the C*-algebraic amalgam of…

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. The problem whether every word is concise in the…

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite.…

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

In this paper, we prove that all finite solvable groups satisfy the Isaacs-Seitz conjecture namely the derived lenght of a finite solvable group G is less than or equal to the number of distinct irreducible complex character degrees of G.

A group G has restricted centralizers if for each g in G the centralizer C_G(g) either is finite or has finite index in G. A theorem of Shalev states that a profinite group with restricted centralizers is abelian-by-finite. In the present…

We prove a variant of the well-known Reidemeister-Schreier theorem for finitely $L$-presented groups. More precisely, we prove that each finite index subgroup of a finitely $L$-presented group is itself finitely $L$-presented. Our proof is…

We define a class $\mathcal{U}$ of solvable groups of finite abelian section rank which includes all such groups that are virtually torsion-free as well as those that are finitely generated. Assume that $G$ is a group in $\mathcal{U}$ and…

For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…

We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first…

This work delves into the {\it quotient of an affine semigroup by a positive integer}, exploring its intricate properties and broader implications. We unveil an {\it associated tree} that serves as a valuable tool for further analysis.…