Abstract
In this paper we introduce and study a family of abelian subgroups of $\GL_n(q)$ covering every element of $\GL_n(q)$. We show that contains all the centralisers of cyclic matrices and equality holds if . Also, for , we prove a simple closed formula for the size of and give an upper bound if . A subset of a finite group is said to be pairwise non-commuting if , for distinct elements in . As an application of our results on , 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 , we give an explicit formula for the maximum size of a pairwise non-commuting set.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.