Triangles in the graph of conjugacy classes of normal subgroups

Let G be a finite group and N a normal subgroup of G. We determine the structure of N when the graph \(\Gamma _{G}(N)\), which is the graph associated to the conjugacy classes of G contained in N, has no triangles and when the graph consists in exactly one triangle.     

Multiplication of conjugacy classes,colligations, and characteristic functions of matrix argument

We extend the classical construction of operator colligations and characteristic functions. Consider the group G of finitary block unitary matrices of order α+∞+···+∞ (m times) and its subgroup K ? U(∞), which consists of block diagonal unitary matrices with the identity block of order α and a matrix u ∈ U(∞) repeated m times. It turns out that there is a natural multiplication on the space G//K of conjugacy classes. We construct “spectral data” of conjugacy classes, which visualize the multiplication and are sufficient for reconstructing a conjugacy class.     

Conjugacy classes of derangements in finite transitive groups

Let G be a permutation group acting transitively on a finite set Ω. We classify all such (G, Ω) when G contains a single conjugacy class of derangements. This was done under the assumption that G acts primitively by Burness and Tong-Viet. It turns out that there are no imprimitive examples. We also discuss some results on the proportion of conjugacy classes which consist of derangements.     

On decomposability of finite groups

Let G be a finite group. A normal subgroup N of G is a union of several G-conjugacy classes, and it is called n-decomposable in G if it is a union of n distinct G-conjugacy classes. In this paper, we first classify finite non-perfect groups satisfying the condition that the numbers of conjugacy classes contained in its non-trivial normal subgroups are two consecutive positive integers, and we later prove that there is no non-perfect group such that the numbers of conjugacy classes contained in its non-trivial normal subgroups are 2, 3, 4 and 5.     

Variations of Landau’s theorem for p-regular and p-singular conjugacy classes

The well-known Landau’s theorem states that, for any positive integer k, there are finitely many isomorphism classes of finite groups with exactly k (conjugacy) classes. We study variations of this theorem for p-regular classes as well as p-singular classes. We prove several results showing that the structure of a finite group is strongly restricted by the number of p-regular classes or the number of p-singular classes of the group. In particular, if G is a finite group with O_p(G) = 1 then |G/F(G)|_p' is bounded in terms of the number of p-regular classes of G. However, it is not possible to prove that there are finitely many groups with no nontrivial normal p-subgroup and kp-regular classes without solving some extremely difficult number-theoretic problems (for instance, we would need to show that the number of Fermat primes is finite).     

The power graph on the conjugacy classes of a finite group

A digraph \({\overrightarrow{\mathcal{Pc}}(G)}\) is said to be the directed power graph on the conjugacy classes of a group G, if its vertices are the non-trivial conjugacy classes of G, and there is an arc from vertex C to C′ if and only if \({C \neq C'}\) and \({C \subseteqq {C'}^{m}}\) for some positive integer \({m > 0}\). Moreover, the simple graph \({\mathcal{Pc}(G)}\) is said to be the (undirected) power graph on the conjugacy classes of a group G if its vertices are the conjugacy classes of G and two distinct vertices C and C′ are adjacent in \({\mathcal{Pc}(G)}\) if one is a subset of a power of the other. In this paper, we find some connections between algebraic properties of some groups and properties of the associated graph.     

On finite groups for which the lattice of <Emphasis Type="Italic">S</Emphasis>-permutable subgroups is distributive

Let p be a prime and let P be a Sylow p-subgroup of a finite nonabelian group G. Let bcl(G) be the size of the largest conjugacy classes of the group G. We show that if p is an odd prime but not a Mersenne prime or if P does not involve a section isomorphic to the wreath product \({Z_p \wr Z_p}\), then \({|P/O_p(G)| \leq bcl(G)}\).     

Equalities on the number of conjugacy classes of the Sylow p-subgroups of GL(n,q)

We denote by Gn the group of the upper unitriangular matrices over F_q, the finite field with q = p^t elements, and r(G_n) the number of conjugacy classes of G_n. In this paper, we obtain the value of r(G_n) modulo (q² -1)(q -1). We prove the following equalities     

Finite groups with some non-Abelian subgroups of non-prime-power order

Let G be a finite group and NA(G) denote the number of conjugacy classes of all nonabelian subgroups of non-prime-power order of G. The Symbol π(G) denote the set of the prime divisors of |G|. In this paper we establish lower bounds on NA(G). In fact, we show that if G is a finite solvable group, then NA(G) = 0 or NA(G) ≥ 2^|π(G)|?2, and if G is non-solvable, then NA(G) ≥ |π(G)| + 1. Both lower bounds are best possible.     

Multiplying a conjugacy class by its inverse in a finite group

Suppose that G is a finite group and K is a non-trivial conjugacy class of G such that KK^?1 = 1 ∪ D ∪ D^?1 with D a conjugacy class of G. We prove that G is not a non-abelian simple group and we give arithmetical conditions on the class sizes determining the solvability and the structure of 〈K〉 and 〈D〉.     

On Thompson’s conjecture for alternating and symmetric groups of degree greater than 1361

Let G be a finite group G, and let N(G) be the set of sizes of its conjugacy classes. It is shown that, if N(G) equals N(Alt _n ) or N(Sym _n ), where n > 1361, then G has a composition factor isomorphic to an alternating group Altm with m ≤ n and the interval (m, n] contains no primes.     

On semi-rational finite simple groups

An element of a group G is called semi-rational if all generators of \(\langle x\rangle \) lie in the union of two conjugacy classes of G. If all elements of G are semi-rational, then G is called a semi-rational group. In this paper, we determine all semi-rational simple groups. Our study in this article generalises Feit and Seitz’s result (Ill J Math 33(1):103–131, 1989) to semi-rational groups.     

Quasi-permutation representations of 2-groups satisfying the Hasse principle

In Behravesh (J Lond Math Soc 55(2):251–260, 1997), c(G), q(G) and p(G) are defined for a finite group G. In this paper, we will calculate c(G), q(G) and p(G) for some 2-groups G satisfying the Hasse principle in Fuma and Ninomiya (Math J Okayama Univ 46:31–38, 2004). We will consider

$G=\langle x, y, z: x^{2^{m-2}}=y^{2}=z^2=1, [x, y]=[y, z]=1, x^{z}=xy \rangle$

where m ≥ 4. By comparing the character tables and Galois conjugacy classes of Irr(G) and Irr(Z(G)), we will show that

$c(G)=q(G)=p(G)= 2c(Z(G))=2^{m-2}+4.$

     

On the number of conjugacy classes of zeros of characters

Letm be a fixed non-negative integer. In this work we try to answer the following question: What can be said about a (finite) groupG if all of its irreducible (complex) characters vanish on at mostm conjugacy classes? The classical result of Burnside about zeros of characters says thatG is abelian ifm=0, so it is reasonable to expect that the structure ofG will somehow reflect the fact that the irreducible characters vanish on a bounded number of classes. The same question can also be posed under the weaker hypothesis thatsome irreducible character ofG hasm classes of zeros. For nilpotent groups we shall prove that the order is bounded by a function ofm in the first case but only the derived length can be bounded in general under the weaker condition. For solvable groups the situation is not so well understood although we shall prove that the Fitting height can be bounded by a double logarithmic function ofm, improving a recent result by G. Qian.     

Characterization of the alternating groups by their order and one conjugacy class length

Let G be a finite group, and let N(G) be the set of conjugacy class sizes of G. By Thompson’s conjecture, if L is a finite non-abelian simple group, G is a finite group with a trivial center, and N(G) = N(L), then L and G are isomorphic. Recently, Chen et al. contributed interestingly to Thompson’s conjecture under a weak condition. They only used the group order and one or two special conjugacy class sizes of simple groups and characterized successfully sporadic simple groups (see Li’s PhD dissertation). In this article, we investigate validity of Thompson’s conjecture under a weak condition for the alternating groups of degrees p+1 and p+2, where p is a prime number. This work implies that Thompson’s conjecture holds for the alternating groups of degree p + 1 and p + 2.     

Peixoto graph of Morse-Smale diffeomorphisms on manifolds of dimension greater than three

Let M ⁿ be a closed orientable manifold of dimension greater than three and G ₁(M ⁿ ) be the class of orientation-preserving Morse-Smale diffeomorphisms on M ⁿ such that the set of unstable separatrices of every f ∈ G ₁(M ⁿ ) is one-dimensional and does not contain heteroclinic orbits. We show that the Peixoto graph is a complete invariant of topological conjugacy in G ₁(M ⁿ ).     

Thompson’s conjecture for the alternating group of degree 2<Emphasis Type="Italic">p</Emphasis> and 2<Emphasis Type="Italic">p</Emphasis>+1

For a finite group G denote by N(G) the set of conjugacy class sizes of G. In 1980s, J.G.Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N(G) = N(L), then G ? L. We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z(G) = 1 and N(G) = N(A _i ) is necessarily isomorphic to A _i , where i ∈ {2p, 2p + 1}.     

Intersections of two nilpotent subgroups in finite groups with socle <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

Given a finite group G with socle isomorphic to L ₂(q), q ≥ 4, we describe, up to conjugacy, all pairs of nilpotent subgroups A and B of G such that A ∩ B ^g ≠ 1 for all g ∈ G.     

2-Connected factor-critical graphs <Emphasis Type="Italic">G</Emphasis> with exactly |<Emphasis Type="Italic">E</Emphasis>(<Emphasis Type="Italic">G</Emphasis>)| + 1 maximum matchings

A connected graph G is said to be a factor-critical graph if G ?v has a perfect matching for every vertex v of G. In this paper, the 2-connected factor-critical graph G which has exactly |E(G)| + 1 maximum matchings is characterized.