Related papers: No iterated identities satisfied by all finite gro…

We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…

We study mixed identities for oligomorphic automorphism groups of countable relational structures. Our main result gives sufficient conditions for such a group to not admit a mixed identity without particular constants. We study numerous…

We provide an infinite family of sofic one-relator groups that are not residually solvable nor residually finite. The proof is essentially different from the one in [1], as it does not require just Magnus' decompositions.

In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a…

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

It was shown by Lubotzky in 2014 that automorphism invariant subsets of finite simple groups which contain identity are always word images. In this article, we study word maps on finite nilpotent groups and show that for arbitrary finite…

We call a finite group irrational if none of its elements is conjugate to a distinct power of itself. We prove that those groups are solvable and describe certain classes of these groups, where the above property is only required for…

Problem 20.21 of Mazurov and Khukhro (Unsolved Problems in Group Theory: The Kourovka Notebook, 20th Issue, 2022), contributed by M.~Conder and attributed to G.~Verret, asks whether there exists a finite group $G$ with two normal subgroups…

We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…

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.

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

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…

Finite groups with very few character values are characterized. The following is the main result of this article: a finite non-abelian group has precisely four character values if and only if it is the generalized dihedral group of a…

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…

It is shown that there is $N$ such that there is no algorithm to decide for identities in at most $N$ variables validity in the class of finite modular lattices. This is based on Slobodskoi's result that the Restricted Word Problem is…

We show that there is $n\in \mathbf N$, a finite system $\Sigma(\vec x,\vec y)$ of equations and inequations having a solution in some group, where $\vec x$ has length $n$, and $\epsilon>0$ such that: for any group $G$ and any $\vec a\in…

We construct an uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions. We also show that word growth rate is not a profinite property.