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

preprint2010arXivOpen access

Abstract

In this paper we introduce and study a family An(q)\mathcal{A}_n(q) of abelian subgroups of $\GL_n(q)$ covering every element of $\GL_n(q)$. We show that An(q)\mathcal{A}_n(q) contains all the centralisers of cyclic matrices and equality holds if q>nq>n. Also, for q>2q>2, we prove a simple closed formula for the size of An(q)\mathcal{A}_n(q) and give an upper bound if q=2q=2. A subset XX of a finite group GG is said to be pairwise non-commuting if xy≠yxxy\not=yx, for distinct elements x,yx, y in XX. As an application of our results on An(q)\mathcal{A}_n(q), we prove lower and upper bounds for the maximum size of a pairwise non-commuting subset of $\GL_n(q)$. (This is the clique number of the non-commuting graph.) Moreover, in the case where q>nq>n, we give an explicit formula for the maximum size of a pairwise non-commuting set.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.