Intersection theorems for finite general linear groups

TL;DR

This paper establishes intersection theorems for subsets of finite general linear groups, extending classical combinatorial results to a $q$-analog setting using eigenvalue and representation theory techniques.

Contribution

It introduces new bounds and characterizations for $t$-intersecting subsets of $ ext{GL}(n,q)$, generalizing Erdős-Ko-Rado type theorems to finite linear groups.

Findings

Maximum size of $t$-intersecting sets matches stabilizers of $t$-dimensional subspaces.

Characterization of equality cases via linear combinations of stabilizer cosets.

Results extend to non-pointwise and cross-intersecting subsets of $ ext{GL}(n,q)$.

Abstract

A subset $Y$ of the general linear group $\operatorname{GL}(n,q)$ is called $t$-intersecting if $\operatorname{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 $\operatorname{GL}(n,q)$ that intersect not necessarily pointwise in $t$-dimensional subspaces of $\mathbb{F}_q^n$ and for cross-intersecting subsets of $\operatorname{GL}(n,q)$. These results may be viewed as variants of the classical Erd\H{o}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 $\operatorname{GL}(n,q)$.