English

$3$-cluster-free families of subspaces

Combinatorics 2024-03-11 v1

Abstract

Three kk-dimensional subspaces AA, BB, and CC of an nn-dimensional vector space VV over a finite field are called a 33-cluster if ABC={0V}A \cap B \cap C = \{\mathbf{0}_V\} and yet dim(A+B+C)2k\dim(A+B+C) \leq 2k. A special kind of 33-cluster, which we call a covering triple, consists of subspaces A,B,CA,B,C such that A=(AB)(AC)A = (A \cap B )\oplus (A \cap C). We prove that, for 2kn/22 \leq k \le n/2, the largest size of a covering triple-free family of kk-dimensional subspaces is the same as the size of the largest such star (a family of subspaces all containing a designated non-zero vector). Moreover, we show that if k<n/2k < n/2, then stars are the only families achieving this largest size. This in turn implies the same result for 33-clusters, which gives the vector space-analogue of a theorem of Mubayi for set systems.

Keywords

Cite

@article{arxiv.2403.04895,
  title  = {$3$-cluster-free families of subspaces},
  author = {Gabriel Currier and Shahriar Shahriari},
  journal= {arXiv preprint arXiv:2403.04895},
  year   = {2024}
}

Comments

11 pages, 2 figures, comments welcome!