An Erd\H{o}s-Ko-Rado theorem in general linear groups
Jun Guo, Kaishun Wang

TL;DR
This paper extends the Erd ext{o}s-Ko-Rado theorem to the general linear group over finite fields, establishing an upper bound on the size of intersecting sets in this algebraic context.
Contribution
It introduces a q-analogue of the Erd ext{o}s-Ko-Rado theorem for general linear groups, providing a new bound on intersecting sets over finite fields.
Findings
Established an upper bound for intersecting sets in $GL_n(F_q)$.
Generalized classical combinatorial results to algebraic structures.
Contributed to the understanding of intersecting families in finite groups.
Abstract
Let be the symmetric group on 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 is an intersecting set in then . In this paper we consider the -analogue version of this result. Let be the -dimensional row vector space over a finite field and the general linear group of degree . A set is {\it intersecting} if for any there exists a non-zero vector such that . Let be an intersecting set in . We show that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Limits and Structures in Graph Theory · Finite Group Theory Research
