English

An Erd\H{o}s-Ko-Rado theorem in general linear groups

Combinatorics 2011-07-19 v1

Abstract

Let SnS_n be the symmetric group on nn 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{\cal F} is an intersecting set in SnS_n then F(n1)!|{\cal F}|\leq(n-1)!. In this paper we consider the qq-analogue version of this result. Let Fqn\mathbb{F}_q^n be the nn-dimensional row vector space over a finite field Fq\mathbb{F}_q and GLn(Fq)GL_n(\mathbb{F}_q) the general linear group of degree nn. A set FqGLn(Fq){\cal F}_q\subseteq GL_n(\mathbb{F}_q) is {\it intersecting} if for any T,SFqT,S\in{\cal F}_q there exists a non-zero vector αFqn\alpha\in \mathbb{F}_q^n such that αT=αS\alpha T=\alpha S. Let Fq{\cal F}_q be an intersecting set in GLn(Fq)GL_n(\mathbb{F}_q). We show that Fqq(n1)n/2i=1n1(qi1)|{\cal F}_q|\leq q^{(n-1)n/2}\prod_{i=1}^{n-1}(q^i-1).

Keywords

Cite

@article{arxiv.1107.3178,
  title  = {An Erd\H{o}s-Ko-Rado theorem in general linear groups},
  author = {Jun Guo and Kaishun Wang},
  journal= {arXiv preprint arXiv:1107.3178},
  year   = {2011}
}

Comments

3 pages

R2 v1 2026-06-21T18:37:42.486Z