Simplices in t-intersecting families for vector spaces

Abstract

Let V be an n-dimensional vector space over the finite field Fq and V k denote the family of all k-dimensional subspaces of V. A family F⊂eq V k is called k-uniform r-wise t-intersecting if for any F1, F2, …, Fr ∈ F, we have (i=1r Fi ) ≥ t. An r-wise t-intersecting family \X1, X2, …, Xr+1\ is called a (r+1,t)-simplex if (i=1r+1 Xi ) < t, denoted by r+1,t. Notice that it is usually called triangle when r=2 and t=1. For k ≥ t ≥ 1, r ≥ 2 and n ≥ 3kr2 + 3krt, we prove that the maximal number of r+1,t in a k-uniform r-wise t-intersecting subspace family of V is at most nt+r,k, and we describe all the extreme families. Furthermore, we have the extremal structure of k-uniform intersecting families maximizing the number of triangles for n≥ 2k+9 as a corollary.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…