On \(q\)-covering designs
The electronic journal of combinatorics, Tome 27 (2020) no. 1
A $q$-covering design $\mathbb{C}_q (n, k, r)$, $k \ge r$, is a collection $\mathcal{X}$ of $(k-1)$-spaces of $PG(n-1, q)$ such that every $(r-1)$-space of $PG(n-1,q)$ is contained in at least one element of $\mathcal{X}$ . Let $\mathcal{C}_q(n, k, r)$ denote the minimum number of $(k-1)$-spaces in a $q$-covering design $\mathbb{C}_q (n, k, r)$. In this paper improved upper bounds on $\mathcal{C}_q(2n, 3, 2)$, $n \ge 4$, $\mathcal{C}_q(3n + 8, 4, 2)$, $n \ge 0$, and $\mathcal{C}_q(2n,4,3)$, $n \ge 4$, are presented. The results are achieved by constructing the related $q$-covering designs.
DOI :
10.37236/8718
Classification :
51E20, 05B40, 05B25, 51A05
Mots-clés : \(q\)-covering designs
Mots-clés : \(q\)-covering designs
Affiliations des auteurs :
Francesco Pavese  1
@article{10_37236_8718,
author = {Francesco Pavese},
title = {On \(q\)-covering designs},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {1},
doi = {10.37236/8718},
zbl = {1433.51005},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8718/}
}
Francesco Pavese. On \(q\)-covering designs. The electronic journal of combinatorics, Tome 27 (2020) no. 1. doi: 10.37236/8718
Cité par Sources :