Abelian coverings of finite general linear groups and an application to their non-commuting graphs.

Abstract: In this paper we introduce and study a family

m a t h c a l A_{n} (q)

of abelian subgroups of

G L_{n} (q)

covering every element of

G L_{n} (q)

. We show that

m a t h c a l A_{n} (q)

contains all the centralisers of cyclic matrices and equality holds if

q > n

. Also, for

q > 2

, we prove a simple closed formula for the size of

m a t h c a l A_{n} (q)

and give an upper bound if

q = 2

. A subset

X

of a finite group

G

is said to be pairwise non-commuting if

x y o t = y x

, for distinct elements

x, y

in

X

. As an application of our results on

m a t h c a l A_{n} (q)

, we prove lower and upper bounds for the maximum size of a pairwise non-commuting subset of

G L_{n} (q)

. (This is the clique number of the non-commuting graph.) Moreover, in the case where

q > n

, we give an explicit formula for the maximum size of a pairwise non-commuting set.

Recommendations

Cites Work

Cited In (8)

Uses Software

This page was built for publication: Abelian coverings of finite general linear groups and an application to their non-commuting graphs.