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\)
Nontrivial \(t\)-designs over finite fields exist for all \(t\)
Abstract: A - design over is a collection of -dimensional subspaces of , called blocks, such that each -dimensional subspace of is contained in exactly blocks. Such -designs over are the -analogs of conventional combinatorial designs. Nontrivial - designs over are currently known to exist only for . Herein, we prove that simple (meaning, without repeated blocks) nontrivial - designs over exist for all and , provided that and is sufficiently large. This may be regarded as a -analog of the celebrated Teirlinck theorem for combinatorial designs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3137862 (Why is no real title available?)
- scientific article; zbMATH DE number 3467122 (Why is no real title available?)
- 2-designs over \(GF(2^ m)\)
- 2-designs over GF(q)
- Association schemes and t-designs in regular semilattices
- Coding for Errors and Erasures in Random Network Coding
- Designs and partial geometries over finite fields
- Designs over finite fields
- Error-Correcting Codes in Projective Space
- Locally symmetric designs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On \(q\)-analogs of Steiner systems and covering designs
- On a class of small 2‐designs over gf(q)
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- Probabilistic existence of rigid combinatorial structures
- Projective Geometry over 1 and the Gaussian Binomial Coefficients
- Quotient sets and subset-subspace analogy
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- q-analogues of t-designs and their existence
Cited in
(24)- \(q\)-analogs of \(t\)-wise balanced designs from Borel subgroups
- A note on the existence of non-simple designs over finite fields
- Transitivity in finite general linear groups
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- An Assmus-Mattson theorem for rank metric codes
- scientific article; zbMATH DE number 4116543 (Why is no real title available?)
- A construction of group divisible designs with block sizes 3 to 7
- Residual \(q\)-Fano planes and related structures
- New constructions of Sidon spaces
- Existence of small ordered orthogonal arrays
- q-analogues of t-designs and their existence
- Large sets of subspace designs
- New lower bounds for partial k‐parallelisms
- Large sets of \(t\)-designs over finite fields exist for all \(t\)
- scientific article; zbMATH DE number 7124291 (Why is no real title available?)
- Existence of \(q\)-analogs of Steiner systems
- Degree 2 Boolean functions on Grassmann graphs
- Intersection numbers for subspace designs
- Galois geometries and coding theory
- Some new designs over finite fields
- Large sets of \(t\)-designs over finite fields
- Derived and residual subspace designs
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- To the theory of \(q\)-ary Steiner and other-type trades
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)