In this paper, we consider finite groups with precisely one nonlinear nonfaithful irreducible character. We show that the groups of order 16 with nilpotency class 3 are the only -groups with this property. Moreover we completely characterize the nilpotent groups with this property. Also we show that if is a group with a nontrivial center which possesses precisely one nonlinear nonfaithful irreducible character then is solvable.
The order of every finite group can be expressed as a product of coprime positive integers such that is a connected component of the prime graph of . The integers are called the order components of . Some non-abelian simple groups are known to be uniquely determined by their order components. As the main result of this paper, we show that the projective symplectic groups where are also uniquely determined by their order components. As corollaries of this result, the validities of a...
Let be a finite group. Let be the first column of the ordinary character table of . We will show that if , then . As a consequence, we show that the projective general unitary groups are uniquely determined by the structure of their complex group algebras.
Let be a finite group and let denote the set of conjugacy class sizes of . Thompson’s conjecture states that if is a centerless group and is a non-abelian simple group satisfying , then . In this paper, we investigate a variation of this conjecture for some symmetric groups under a weaker assumption. In particular, it is shown that if and only if and has a special conjugacy class of size , where is a prime number. Consequently, if is a centerless group with , then .
Let be a finite group and be the set of element orders of . Let and be the number of elements of order in . Set . In fact is the set of sizes of elements with the same order in . In this paper, by and order, we give a new characterization of finite projective special linear groups over a field with elements, where is prime. We prove the following theorem: If is a group such that and consists of , , and some numbers divisible by , where is a prime greater than...
In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge-transitive and H is edgeless. If the first factor of G ∘ H is non-trivial and complete, then G ∘ H is edge-transitive if and only if H is the lexicographic product of a complete graph by an edgeless graph. This fixes an error of Li, Wang, Xu, and Zhao...
Download Results (CSV)