Large sets of t-designs over finite fields exist for all t

DOI10.1007/S10623-022-01061-ZMaRDI QIDQ2153752zbMATH OpenOpenAlexWikidataFDO

Authors Jingjun Bao, Lijun Ji

Publication date 13 July 2022

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-022-01061-z

zbMATH Keywords

\(q\)-analogscombinatorial designsdesigns over finite fieldsKLP theoremlarge sets

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Review text

A \(t\)-\((n, k, \lambda)_q\) design is a set of \(k\)-dimensional subspaces, called blocks, of an \(n\)-dimensional vector space \(V\) over the finite field \(\mathbb{F}_q\) with \(q\) elements such that each \(t\)-dimensional subspace is contained in exactly \(\lambda\) blocks. A partition of the complete set of \(k\)-dimensional subspaces of \(V\) into \(\ell\) disjoint \(t\)-\((n, k, \lambda)_q\) designs is called a large set of \(t\)-designs over \(\mathbb{F}_q\) and denoted by \(LS_q [\ell](t, k, n)\). In this article, the authors use a powerful probabilistic method given by \textit{G. Kuperberg} et al. [Geom. Funct. Anal. 27, No. 4, 919--972 (2017; Zbl 1369.05024)] (the KLP theorem) to prove that an \(LS_q [\ell](t, k, n)\) exists for all \(t\) and \(q\), provided that \(k > 6.1(t + 1)\), \(n\) is sufficiently large and the \(q\)-binomial coefficient with parameters \(n-s\) and \(k-s\) is congruent to 0 (mod \(\ell\)) for \(0 \leq s \leq t\).

Recommendations

• Large sets of \(t\)-designs over finite fields
• Nontrivial t-designs over finite fields exist for all t
• Some infinite families of large sets of \(t\)-designs
• Extending large sets of t-designs
• q-analogues of t-designs and their existence

Cites work

• 2-designs over GF(2^ m)
• 2-designs over GF(q)
• A new series of large sets of subspace designs over the binary field
• 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
• Discrete \(q\)-distributions
• Existence of q-analogs of Steiner systems
• scientific article; zbMATH DE number 3467122 (Why is no real title available?)
• Large sets of \(t\)-designs over finite fields
• Large sets of subspace designs
• Locally symmetric designs
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Nontrivial t-designs over finite fields exist for all t
• On a class of small 2‐designs over gf(q)
• On the inequalities of t-designs over a finite field
• Probabilistic existence of regular combinatorial structures
• q-analogues of t-designs and their existence
• Some new designs over finite fields
• Some new distance-4 constant weight codes
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• The CRC handbook of combinatorial designs

Cited in

(5)

• A new series of large sets of subspace designs over the binary field
• q-analogues of t-designs and their existence
• Large sets of \(t\)-designs over finite fields
• Nontrivial t-designs over finite fields exist for all t
• An explicit construction for large sets of infinite dimensional \(q\)-Steiner systems

This page was built for publication: Large sets of \(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 Q2153752)