An Erdos-Ko-Rado theorem in general linear groups
Abstract
Let Sn be the symmetric group on n points. Deza and Frankl [M. Deza and P. Frankl, On the maximum number of permutations with given maximal or minimal distance, J. Combin. Theory Ser. A 22 (1977) 352--360] proved that if F is an intersecting set in Sn then | F|≤(n-1)!. In this paper we consider the q-analogue version of this result. Let Fqn be the n-dimensional row vector space over a finite field Fq and GLn(Fq) the general linear group of degree n. A set Fq⊂eq GLn(Fq) is intersecting if for any T,S∈ Fq there exists a non-zero vector α∈ Fqn such that α T=α S. Let Fq be an intersecting set in GLn(Fq). We show that | Fq|≤ q(n-1)n/2Πi=1n-1(qi-1).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.