Displaying 701 – 720 of 1356

Showing per page

On the number of solutions of equation x p k = 1 in a finite group

Yakov Berkovich (1995)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Theorem A yields the condition under which the number of solutions of equation x p k = 1 in a finite p -group is divisible by p n + k (here n is a fixed positive integer). Theorem B which is due to Avinoam Mann generalizes the counting part of the Sylow Theorem. We show in Theorems C and D that congruences for the number of cyclic subgroups of order p k which are true for abelian groups hold for more general finite groups (for example for groups with abelian Sylow p -subgroups).

On the recognizability of some projective general linear groups by the prime graph

Masoumeh Sajjadi (2022)

Commentationes Mathematicae Universitatis Carolinae

Let G be a finite group. The prime graph of G is a simple graph Γ ( G ) whose vertex set is π ( G ) and two distinct vertices p and q are joined by an edge if and only if G has an element of order p q . A group G is called k -recognizable by prime graph if there exist exactly k nonisomorphic groups H satisfying the condition Γ ( G ) = Γ ( H ) . A 1-recognizable group is usually called a recognizable group. In this problem, it was proved that PGL ( 2 , p α ) is recognizable, if p is an odd prime and α > 1 is odd. But for even α , only the recognizability...

Currently displaying 701 – 720 of 1356