English

Extremal cross $t$-intersecting families under $t$-covering number constraints for vector spaces

Combinatorics 2026-08-01 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. The families F[Vk]\mathcal{F}\subseteq {V\brack k} and G[V]\mathcal{G}\subseteq {V\brack \ell} are said to be cross tt-intersecting if dim(FG)t\dim(F\cap G)\geq t for all FFF\in\mathcal{F} and GGG\in \mathcal{G}. In this paper, we determine the extremal structures when FG|\mathcal{F}||\mathcal{G}| attains the maximum value under the conditions dim(FFF)<t\dim\left(\cap_{F\in \mathcal{F}}F\right)<t and dim(GGG)<t\dim\left(\cap_{G\in \mathcal{G}}G\right)<t.

Keywords

Cite

@article{arxiv.2608.00505,
  title  = {Extremal cross $t$-intersecting families under $t$-covering number constraints for vector spaces},
  author = {Yu Zhu and Benjian Lv and Kaishun Wang},
  journal= {arXiv preprint arXiv:2608.00505},
  year   = {2026}
}