Related papers: Landau's theorem, fields of values for characters,…

Let $G$ be a finite simple group. By a theorem of Guralnick and Kantor, $G$ contains a conjugacy class $C$ such that for each non-identity element $x \in G$, there exists $y \in C$ with $G = \langle x,y\rangle$. Building on this deep…

Let $G$ be a finite group, let $x \in G$, and let $p$ be a prime. We prove that the commutator $[x,g]$ is a $p$-element for every $g \in G$ if and only if $x$ is central modulo $\mathbf{O}_p(G)$, where $\mathbf{O}_p(G)$ denotes the largest…

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…

Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor. Then every nonunit $a \in H$ can be written as a finite product of irreducible elements. If $a=u\_1 \cdot \ldots \cdot u\_k$, with irreducibles…

We study the finite solvable groups $G$ in which every real element has prime power order. We divide our examination into two parts: the case $\textbf{O}_2(G)>1$ and the case $\textbf{O}_2(G)=1$. Specifically we proved that if…

Let $\bfG$ be a connected reductive algebraic group defined over $\F_q$, where $q$ is a power of a prime $p$ that is good for $\bfG$. Let $F$ be the Frobenius morphism associated with the $\FF_q$-structure on $\bfG$ and set $G = \bfG^F$,…

We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma$ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma$. As an…

Let $G$ be a finite nilpotent group, $\chi$ and $\psi$ be irreducible complex characters of $G$ of prime degree. Assume that $\chi(1)=p$. Then either the product $\chi\psi$ is a multiple of an irreducible character or $\chi\psi$ is the…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

A character of a finite group having degree $n$ takes values which may be expressed as sums of $n$ or fewer roots of unity. In this note, we prove a result which describes the irreducible constituents of generalized characters on abelian…

Let $G$ be an almost simple group. We prove that if $x \in G$ has prime order $p \ge 5$, then there exists an involution $y$ such that $<x,y>$ is not solvable. Also, if $x$ is an involution then there exist three conjugates of $x$ that…

Much work has been done to study groups with few rational conjugacy classes or few rational irreducible characters. In this paper we look at the opposite extreme. Let $G$ be a finite group. Given a conjugacy class $K$ of $G$, we say it is…

We prove that there exists a universal constant $D$ such that if $p$ is a prime divisor of the index of the Fitting subgroup of a finite group $G$, then the number of conjugacy classes of G is at least $Dp/log_2 p$. We conjecture that we…

Let G be a connected, reductive group over an algebraically closed field of good characteristic. For u in G unipotent, we describe the conjugacy classes in the component group A(u) of the centralizer of u. Our results extend work of the…

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…

We prove that for any prime $\ell$, any finite group has as many irreducible complex characters of degree prime to $\ell$ as the normalizers of its Sylow $\ell$-subgroups. This equality was conjectured by John McKay. The conjecture was…

We construct two finite groups of size $2^{365}\cdot 3^{105}\cdot 7^{104}$: a solvable group $G$ and a non-solvable group $H$, such that for every integer $n$ the groups have the same number of elements of order $n$. This answers a question…

We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.

For a finite group $G$, let $\omega(G)$ be the set of element orders of $G$ and let $h(G)$ be the number of pairwise nonisomorphic finite groups $H$ with $\omega(H)=\omega(G)$. We say that the recognition problem is solved for $G$ if the…

We show that if G is a finite group then no chain of modular elements in its subgroup lattice L(G) is longer than a chief series. Also, we show that if G is a nonsolvable finite group then every maximal chain in L(G) has length at least two…