Non-trivial $t$-intersecting families for vector spaces
Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou

TL;DR
This paper characterizes the structure and maximum size of non-trivial t-intersecting families of k-dimensional subspaces in an n-dimensional vector space over a finite field, extending known results for the case t=1.
Contribution
It provides a detailed description of maximal non-trivial t-intersecting families and identifies those with the largest size, generalizing the Hilton-Milner Theorem for vector spaces.
Findings
Characterization of maximal non-trivial t-intersecting families.
Identification of the largest such families.
Extension of Hilton-Milner Theorem to vector spaces.
Abstract
Let be an -dimensional vector space over a finite field . In this paper we describe the structure of maximal non-trivial -intersecting families of -dimensional subspaces of with large size. We also determine the non-trivial -intersecting families with maximum size. In the special case when our result gives rise to the well-known Hilton-Milner Theorem for vector spaces.
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
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · Coding theory and cryptography
