$r$-cross $t$-intersecting families for vector spaces
Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang

TL;DR
This paper characterizes the structure of maximum product size for $r$-cross $t$-intersecting families of vector spaces, partially proves a conjecture, and explores stability of such families under specific conditions.
Contribution
It determines the structure of maximum product $r$-cross $t$-intersecting families and proves stability results, advancing understanding of intersecting families in vector spaces.
Findings
Characterization of maximum product $r$-cross $t$-intersecting families.
Partial proof of Frankl and Tokushige's conjecture for $r$-cross $1$-intersecting families.
Stability results for non-trivial $r$-wise $t$-intersecting families.
Abstract
Let be an -dimensional vector space over the finite field , and denote the family of all -dimensional subspaces of . The families are said to be -cross -intersecting if for all The -cross -intersecting families , are said to be non-trivial if . In this paper, we first determine the structure of -cross -intersecting families with maximum product of their sizes. As a consequence, we partially prove one of Frankl and Tokushige's conjectures about -cross -intersecting families for vector spaces. Then we describe the structure…
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 · Finite Group Theory Research · Cooperative Communication and Network Coding
