Intersecting theorems for finite general linear groups

Abstract

A subset Y of the general linear group GLpn, qq is called t-intersecting if rkpx ´yq ď n ´t for all x, y P Y , or equivalently x and y agree pointwise on a t-dimensional subspace of F n q for all x, y P Y . We show that, if n is sufficiently large compared to t, the size of every such t-intersecting set is at most that of the stabiliser of a basis of a t-dimensional subspace of F n q . In case of equality, the characteristic vector of Y or that of Y T is a linear combination of the characteristic vectors of the cosets of these stabilisers. We also give a similar result for t-cross-intersecting subsets of GLpn, qq. These results may be viewed as variants of the classical Erdős-Ko-Rado Theorem in extremal set theory and are q-analogs of corresponding results known for the symmetric group. Our methods are based on eigenvalue techniques to estimate the size of the largest independent sets in graphs and crucially involve the representation theory of GLpn, qq.