Nontrivial t-designs over finite fields exist for all t

From MaRDI portal
(Redirected from Publication:406567)
Nontrivial \(t\)-designs over finite fields exist for all \(t\)




Abstract: A t-(n,k,lambda) design over Fq is a collection of k-dimensional subspaces of Fqn, called blocks, such that each t-dimensional subspace of Fqn is contained in exactly lambda blocks. Such t-designs over Fq are the q-analogs of conventional combinatorial designs. Nontrivial t-(n,k,lambda) designs over Fq are currently known to exist only for tleq3. Herein, we prove that simple (meaning, without repeated blocks) nontrivial t-(n,k,lambda) designs over Fq exist for all t and q, provided that k>12t and n is sufficiently large. This may be regarded as a q-analog of the celebrated Teirlinck theorem for combinatorial designs.









This page was built for publication: Nontrivial \(t\)-designs over finite fields exist for all \(t\)

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