Large sets of subspace designs

DOI10.1016/J.JCTA.2016.11.004zbMATH Open1352.05042arXiv1411.7181OpenAlexW2963529046MaRDI QIDQ501693FDOQ501693

Authors: Michael Kiermaier, Axel Kohnert, Reinhard Laue, Michael Braun 

Publication date: 9 January 2017

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

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 $operatorname{LS}_5[2](2,3,6)$. The application of the new recursion method to this halving and an already known $operatorname{LS}_3[2](2,3,6)$ yields two infinite two-parameter series of halvings $operatorname{LS}_3[2](2,k,v)$ and $operatorname{LS}_5[2](2,k,v)$ with integers $vgeq6$, $vequiv2mod4$ and $3leqkleqv-3$, $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$.

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

Recommendations

• A new series of large sets of subspace designs over the binary field
• Explicit subspace designs
• A large set of designs on vector spaces
• scientific article
• Classification of some large sets and designs
• scientific article
• Extending large sets of \(t\)-designs
• scientific article; zbMATH DE number 776263
• On combinatorial designs with subdesigns
• New large sets of \(t\)-designs

zbMATH Keywords

large setsubspace design\(q\)-analogcombinatorial designhalving

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Grassmannians, Schubert varieties, flag manifolds (14M15) Other designs, configurations (05B30)

Cites Work

• Endliche Gruppen I
• Title not available (Why is that?)
• Designs over finite fields
• Association schemes and t-designs in regular semilattices
• t-designs on hypergraphs
• Large sets of \(t\)-designs over finite fields
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• On a class of small 2‐designs over gf(q)
• Intersection Numbers For Subspace Designs
• Title not available (Why is that?)
• 2-designs over \(GF(q)\)
• A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• On the inequalities of \(t\)-designs over a finite field
• Derived and residual subspace designs
• 2-designs over \(GF(2^ m)\)
• Some new designs over finite fields
• Pre-Frattini groups.
• The power of a prime that divides a generalized binomial coefficient.
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• Locally trivial t-designs and t-designs without repeated blocks
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• Combining \(t\)-designs
• All block designs with \(b={v\choose k}/2\) exist
• Title not available (Why is that?)
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Geometry of Binomial Coefficients
• More on halving the complete designs
• Extending large sets of \(t\)-designs
• The minimum volume of subspace trades
• Congruence properties of ordinary and q-binomial coefficients
• A generalized q-binomial Vandermonde convolution
• Title not available (Why is that?)
• Trades and \(t\)-designs
• Title not available (Why is that?)
• To the theory of \(q\)-ary Steiner and other-type trades

Cited In (18)

• Search for combinatorial objects using lattice algorithms -- revisited
• An explicit construction for large sets of infinite dimensional \(q\)-Steiner systems
• Disjoint \(q\)-Steiner systems in dimension 13
• The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two
• The minimum volume of subspace trades
• On the automorphism group of a binary \(q\)-analog of the Fano plane
• New constructions of Sidon spaces
• New infinite series of 2-designs over the binary and ternary field
• New lower bounds for partial k‐parallelisms
• Large sets of \(t\)-designs over finite fields exist for all \(t\)
• Galois geometries and coding theory
• A new series of large sets of subspace designs over the binary field
• On \(\alpha \)-points of \(q\)-analogs of the Fano plane
• New 2-designs over finite fields from derived and residual designs
• An Assmus--Mattson Theorem for Rank Metric Codes
• Subspace packings: constructions and bounds
• To the theory of \(q\)-ary Steiner and other-type trades
• Constructions of new matroids and designs over \(\mathbb{F}_q\)

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)