On cover-free families of finite vector spaces
arXiv:2407.20614
Abstract
There is a large literature on cover-free families of finite sets, because of their many applications in combinatorial group testing, cryptographic and communications. This work studies the generalization of cover-free families from sets to finite vector spaces. Let be an -dimensional vector space over the finite field and let denote the family of all -dimensional subspaces of . A family is called cover-free if there are no three distinct subspaces such that . A family is called a -Steiner system if for every , there is exactly one such that . In this paper we investigate cover-free families in the vector space . Firstly, we determine the maximum size of a cover-free family in . Secondly, we characterize the structures of all maximum cover-free families which are closely related to -Steiner systems.
25 pages