Related papers: Words and characters in finite p-groups

Assume G is a nilpotent group of class > 3 in which every proper subgroup has class at most 3. In this note, we give the exact upper bound of class of G.

Many properties of groups can be defined by the existence of a particular normal series. The classic examples being solvability, supersolvability and nilpotence. Among the nilpotent groups are the so-called nested GVZ-groups --- groups…

Consider the Macdonald group $G(\alpha,\beta)=\langle A,B\,|\, A^{[A,B]}=A^\alpha,\, B^{[B,A]}=B^\beta\rangle$, where $\alpha$ and $\beta$ are integers different from one. We fill a gap in Macdonald's original proof that $G(\alpha,\beta)$…

We study finite groups $G$ with elements $g$ such that $\lvert \mathbf{C}_G(g)\rvert = \lvert G:G' \rvert$. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class…

Let $G$ be a finite group, and let $d$ be the degree of an irreducible character of $G$ such that $|G|=d(d+e)$ for some $e>1$. Consider the case when $G$ is solvable, $d$ is square-free, and $(d,d+e)=1$. We wish to explore an equivalent…

We reformulate several basic notions of notions in finite group theory in terms of iterations of the lifting property (orthogonality) with respect to particular morphisms. Our examples include the notions being nilpotent, solvable, perfect,…

We give an affrmative answer to the question whether a residually finite Engel group satisfying an identity is locally nilpotent. More generally, for a residually finite group G with an identity, we prove that the set of right Engel…

Let $P$ be a Sylow $p$-subgroup of a finite $p$-solvable group $G$, where $p$ is a prime. Using a normal $p$-series $\mathcal{N}$ of $G$, we introduce the notion of $(\mathcal{N},p)$-stable characters and prove that $G$ and ${\bf N}_G(P)$…

Let $G$ be a finite group admitting a coprime automorphism $\alpha$. Let $J_G(\alpha)$ denote the set of all commutators $[x,\alpha]$, where $x$ belongs to an $\alpha$-invariant Sylow subgroup of $G$. We show that $[G,\alpha]$ is soluble or…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

We consider the following two finiteness conditions on normalizers and centralizers in a group G: (i) |N_G(H):H| is finite for every non-normal subgroup H of G, and (ii) |C_G(x):<x>| is finite for every non-normal cyclic subgroup <x> of G.…

In Part I it was shown that if G is a p-group of class k, generated by elements of orders 1<p^{alpha_1} <= ... <= p^{alpha_r}, then a necessary condition for the capability of G is that r>1 and alpha_r <= alpha_{r-1} + [(k-1)/(p-1)]. It was…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

Let $p$ be a prime and $G$ a finite group. We propose a strong bound for the number of $p'$-degree irreducible characters of $G$ in terms of the commutator factor group of a Sylow $p$-subgroup of $G$. The bound arises from a recent…

When $G$ is solvable group, we prove that the number of conjugacy classes of elements of prime power order is less than or equal to the number of irreducible characters with values in fields where $\mathbb {Q}$ is extended by prime power…

We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group $G$ is a simple undirected graph whose vertex…

An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…