Nontrivial t-designs over finite fields exist for all t

DOI10.1016/J.JCTA.2014.06.001zbMATH Open1297.05046arXiv1306.2088OpenAlexW1980888721MaRDI QIDQ406567FDOQ406567

Alexander Vardy, Arman Fazeli, Shachar Lovett

Publication date: 8 September 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: A $t$-$(n,k,lambda)$ design over $F_q$ is a collection of $k$-dimensional subspaces of $F_q^n$, called blocks, such that each $t$-dimensional subspace of $F_q^n$ is contained in exactly $lambda$ blocks. Such $t$-designs over $F_q$ are the $q$-analogs of conventional combinatorial designs. Nontrivial $t$-$(n,k,lambda)$ designs over $F_q$ are currently known to exist only for $tleq3$. Herein, we prove that simple (meaning, without repeated blocks) nontrivial $t$-$(n,k,lambda)$ designs over $F_q$ 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.

Full work available at URL: https://arxiv.org/abs/1306.2088

zbMATH Keywords

combinatorial designs\(q\)-analogsdesigns over fieldsKLP theoremTeirlinck theorem

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cites Work

• Designs over finite fields
• Designs and partial geometries over finite fields
• Association schemes and t-designs in regular semilattices
• On \(q\)-analogs of Steiner systems and covering designs
• Coding for Errors and Erasures in Random Network Coding
• On a class of small 2‐designs over gf(q)
• Error-Correcting Codes in Projective Space
• Title not available (Why is that?)
• 2-designs over \(GF(q)\)
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• 2-designs over \(GF(2^ m)\)
• Probabilistic existence of rigid combinatorial structures
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• q-analogues of t-designs and their existence
• Locally symmetric designs
• Quotient sets and subset-subspace analogy
• Title not available (Why is that?)
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)

Cited In (20)

• Transitivity in finite general linear groups
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Title not available (Why is that?)
• Intersection Numbers For Subspace Designs
• 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
• Large sets of subspace designs
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• New lower bounds for partial k‐parallelisms
• Title not available (Why is that?)
• Large sets of \(t\)-designs over finite fields exist for all \(t\)
• Degree 2 Boolean functions on Grassmann graphs
• Galois geometries and coding theory
• Derived and residual subspace designs
• An Assmus--Mattson Theorem for Rank Metric Codes
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• To the theory of \(q\)-ary Steiner and other-type trades
• \(q\)-analogs of \(t\)-wise balanced designs from Borel subgroups

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)