Related papers: Characterizing finite solvable groups through the …

Let $G$ be a finite group. We let $\f{m}(G)$ and $\sig(G)$ denote the number of maximal subgroups of $G$ and the least positive integer $n$ such that $G$ is written as the union of $n$ proper subgroups, respectively. In this paper we…

For a non-empty class of groups $\cal L$, a finite group $G = AB$ is said to be an $\cal L$-connected product of the subgroups $A$ and $B$ if $\langle a, b\rangle \in \cal L$ for all $a \in A$ and $b \in B$. In a previous paper, we prove…

In this paper we study conjugacy and subgroup separability properties in the class of nilpotent $\mathbb{Q}[x]$-powered groups. Many of the techniques used to study these properties in the context of ordinary nilpotent groups carry over…

We prove that if $p$ is an odd prime, $G$ is a solvable group, and the average value of the irreducible characters of $G$ whose degrees are not divisible by $p$ is strictly less than $2(p+1)/(p+3)$, then $G$ is $p$-nilpotent. We show that…

A subset $S$ of a group $G$ is called an Engel set if, for all $x,y\in S$, there is a non-negative integer $n=n(x,y)$ such that $[x,\,_n y]=1$. In this paper we are interested in finding conditions for a group generated by a finite Engel…

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…

The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…

This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…

In this paper, we show that a locally graded group with a finite number m of non-(nilpotent of class at most n) subgroups is (soluble of class at most [log2(n)] + m + 3)-by-(finite of order $\le$ m!). Also we show that the derived length of…

We prove that the $k$th term of the lower central series of a finite group $G$ is nilpotent if and only if $|ab|=|a||b|$ for any $\gamma_k$-commutators $a,b\in G$ of coprime orders.

Let G be a finite solvable group, and let h(G) denote its Fitting height, namely the length of a shortest normal series in G with nilpotent factors. We show, that any law in G has length at least h(G). This result is then used to improve a…

We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.

The notion of bounded FC-nilpotent group is introduced and it is shown that any such group is nilpotent-by-finite, generalizing a result of Neumann on bounded FC-groups.

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…

Let $\mathfrak{F}$ be a class of finite groups and $G$ a finite group. Let ${\cal L}_{\mathfrak{F}}(G)$ be the set of all subgroups $A$ of $G$ with $A^{G}/A_{G}\in \mathfrak{F}$. A chief factor $H/K$ of $G$ is $\mathfrak{F}$-central in $G$…

Let K be a field of positive characteristic p and KG the group algebra of a group G. It is known that, if KG is Lie nilpotent, then its upper (or lower) Lie nilpotency index is at most |G'|+1, where |G'| is the order of the commutator…

We prove a result on the asymptotic proportion of randomly chosen pairs of permutations in the symmetric group $S_n$ which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same…

Suppose that a locally finite group $G$ has a $2$-element $g$ with Chernikov centralizer. It is proved that if the involution in $\langle g\rangle$ has nilpotent centralizer, then $G$ has a soluble subgroup of finite index.

Given a finitely generated residually finite group $G$, the residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ bounds the size of a finite group $Q$ needed to detect an element of norm at most $r$. More specifically, if…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…