Conjugacy classes in finite groups
Antonio Vera López
Abstract
Antonio Vera López
Abstract
Synopsis In this paper, the number of conjugacy classes in a finite group G is analysed in terms of the number of ordered pairs that generate it. Using this relation, we give a new elementary proof of one of A. Mann's results for finite groups, namely: |G| ≡ r(G) (mod. d|G|. δ|G|), where , prime and pi ≠ Pj for every i≠j, r(G) denotes the number of conjugacy classes of elements of G, d|G| = g.c.d. (p1 − 1, … pt − 1) and δ|G| = g.c.d. . The above congruence is obtained without using character theory. We also obtain new local congruences that slightly improve Mann's congruence.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Synopsis In this paper, the number of conjugacy classes in a finite group G is analysed in terms of the number of ordered pairs that generate it. Using this relation, we give a new elementary proof of one of A. Mann's results for finite groups, namely: |G| ≡ r(G) (mod. d|G|. δ|G|), where , prime and pi ≠ Pj for every i≠j, r(G) denotes the number of conjugacy classes of elements of G, d|G| = g.c.d. (p1 − 1, … pt − 1) and δ|G| = g.c.d. . The above congruence is obtained without using character theory. We also obtain new local congruences that slightly improve Mann's congruence.
Key concepts: Conjugacy class, Congruence relation, Mathematics, Finite group, Combinatorics, Congruence (geometry), Character table, Prime (order theory)