相关论文: Engel-like Identities Characterizing Finite Solvab…

We are looking for the smallest integer k>1 providing the following characterization of the solvable radical R(G) of any finite group G: R(G) coincides with the collection of all g such that for any k elements a_1,a_2,...,a_k the subgroup…

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 $G$ is said to have restricted centralizers if for every $x\in G$ the centralizer $C_G(x)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. Here we…

We characterize some classes of finite soluble groups. In particular, we prove that: a finite group $G$ is supersoluble if and only if $G$ has a normal subgroup $D$ such that $G/D$ is supersoluble and $D$ avoids every chief factor of $G$…

We consider decidability problems associated with Engel's identity ($[\cdots[[x,y],y],\dots,y]=1$ for a long enough commutator sequence) in groups generated by an automaton. We give a partial algorithm that decides, given $x,y$, whether an…

For an element $g$ of a group $G$, a right Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[g ,x],x],\dots ,x]$ for all $x\in G$. A left Engel sink of $g$ is a subset of $G$ containing all…

It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

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…

Let x be an element of a group G. For a positive integer n let E_n(x) be the subgroup generated by all commutators [...[[y,x],x],...,x] over y in G, where x is repeated n times. There are several recent results showing that certain…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

Goldmann and Russell (2002) initiated the study of the complexity of the equation satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it is NP-complete for non-solvable groups. Since then, several…

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

In the paper we consider the following conjecture: if a finite group $G$ possesses a solvable $\pi$-Hall subgroup $H$, then there exist elements $x,y,z,t\in G$ such that the identity $H\cap H^x\cap H^y\cap H^z\cap H^t=O_\pi(G)$ holds. The…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the proper subgroups of $G$ and in which two vertices $H$ and $K$ are joined by an edge if and only if $G=\langle H,K\rangle.$ We prove that if there exists a…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…

Let $g$ be an element of a finite group $G$ and let $R_{n}(g)$ be the subgroup generated by all the right Engel values $[g,{}_{n}x]$ over $x\in G$. In the case when $G$ is soluble we prove that if, for some $n$, the Fitting height of…