Intersection theorems for finite general linear groups
arXiv:2205.08456 · doi:10.1017/S0305004123000075
Abstract
A subset of the general linear group is called -intersecting if for all , or equivalently and agree pointwise on a -dimensional subspace of for all . We show that, if is sufficiently large compared to , the size of every such -intersecting set is at most that of the stabiliser of a basis of a -dimensional subspace of . In case of equality, the characteristic vector of is a linear combination of the characteristic vectors of the cosets of these stabilisers. We also give similar results for subsets of that intersect not necessarily pointwise in -dimensional subspaces of and for cross-intersecting subsets of . These results may be viewed as variants of the classical Erdős-Ko-Rado Theorem in extremal set theory and are -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 .
34 pages, minor changes