Large sets of subspace designs

From MaRDI portal
Publication:501693




Abstract: In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to subspace designs. We construct a 2-(6,3,78)5 design by computer, which corresponds to a halving operatornameLS5[2](2,3,6). The application of the new recursion method to this halving and an already known operatornameLS3[2](2,3,6) yields two infinite two-parameter series of halvings operatornameLS3[2](2,k,v) and operatornameLS5[2](2,k,v) with integers vgeq6, vequiv2mod4 and 3leqkleqv3, kequiv3mod4. Thus in particular, two new infinite series of nontrivial subspace designs with t=2 are constructed. Furthermore as a corollary, we get the existence of infinitely many nontrivial large sets of subspace designs with t=2.



Cites work







This page was built for publication: Large sets of subspace designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501693)