Intersection theorems for finite general linear groups

Abstract

A subset Y of the general linear group $\text{GL}(n,q)$ is called t-intersecting if $\text{rk}(x-y)\le n-t$ for all $x,y\in Y$ , or equivalently x and y agree pointwise on a t-dimensional subspace of $\mathbb{F}_q^n$ for all $x,y\in 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 $\mathbb{F}_q^n$ . In case of equality, the characteristic vector of Y is a linear combination of the characteristic vectors of the cosets of these stabilisers. We also give similar results for subsets of $\text{GL}(n,q)$ that intersect not necessarily pointwise in t-dimensional subspaces of $\mathbb{F}_q^n$ and for cross-intersecting subsets of $\text{GL}(n,q)$ . 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 $\text{GL}(n,q)$ .

Approximately strongly regular graphs

“…In recent years, regular sets in graphs coming from finite geometries have received a significant amount of attention, for instance see [2,3,4,10,12,13,20,21,22,25,27,28,29,36,37,38]. Note that the investigation of regular sets in conjugacy class schemes is also of recent interest, for instance see [17,19]. Often these association schemes are distance-regular graphs.…”