Non-trivial $t$-intersecting families for symplectic polar spaces
Tian Yao, Benjian Lv, Kaishun Wang

TL;DR
This paper characterizes the structure of the largest non-trivial $t$-intersecting families of $m$-dimensional subspaces in symplectic polar spaces over finite fields, extending understanding beyond trivial intersecting families.
Contribution
It determines the structure of maximum-sized non-trivial $t$-intersecting subfamilies in symplectic polar spaces, a significant extension of intersecting family theory.
Findings
Identifies the structure of maximum non-trivial $t$-intersecting families.
Distinguishes between trivial and non-trivial intersecting families.
Provides a classification for maximum non-trivial intersecting families.
Abstract
Let be a symplectic polar space over a finite field , and denote the set of all -dimensional subspaces in . We say a -intersecting subfamily of is trivial if there exists a -dimensional subspace contained in each member of this family. In this paper, we determine the structure of maximum sized non-trivial -intersecting subfamilies of .
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
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
