English

Simplices in $t$-intersecting families for vector spaces

Combinatorics 2025-03-11 v1

Abstract

Let VV be an nn-dimensional vector space over the finite field Fq\mathbb{F}_q and [Vk]{V\brack k} denote the family of all kk-dimensional subspaces of VV. A family F[Vk]\mathcal{F}\subseteq {V\brack k} is called kk-uniform rr-wise tt-intersecting if for any F1,F2,,FrFF_1, F_2, \dots, F_r \in \mathcal{F}, we have dim(i=1rFi)t\dim\left(\bigcap_{i=1}^r F_i \right) \geq t. An rr-wise tt-intersecting family {X1,X2,,Xr+1}\{X_1, X_2, \dots, X_{r+1}\} is called a (r+1,t)(r+1,t)-simplex if dim(i=1r+1Xi)<t\dim\left(\bigcap_{i=1}^{r+1} X_i \right) < t, denoted by Δr+1,t\Delta_{r+1,t}. Notice that it is usually called triangle when r=2r=2 and t=1t=1. For kt1k \geq t \geq 1, r2r \geq 2 and n3kr2+3krtn \geq 3kr^2 + 3krt, we prove that the maximal number of Δr+1,t\Delta_{r+1,t} in a kk-uniform rr-wise tt-intersecting subspace family of VV is at most nt+r,kn_{t+r,k}, and we describe all the extreme families. Furthermore, we have the extremal structure of kk-uniform intersecting families maximizing the number of triangles for n2k+9n\geq 2k+9 as a corollary.

Keywords

Cite

@article{arxiv.2503.06498,
  title  = {Simplices in $t$-intersecting families for vector spaces},
  author = {Haixiang zhang and Mengyu Cao and Mei Lu and Jiaying Song},
  journal= {arXiv preprint arXiv:2503.06498},
  year   = {2025}
}

Comments

18 pages

R2 v1 2026-06-28T22:12:40.772Z