Large sets of subspace designs

DOI10.1016/j.jcta.2016.11.004zbMath1352.05042arXiv1411.7181OpenAlexW2963529046MaRDI QIDQ501693

Reinhard Laue, Axel Kohnert, Michael Kiermaier, Michael Braun

Publication date: 9 January 2017

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

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

zbMATH Keywords

combinatorial designlarge set\(q\)-analogsubspace designhalving

Mathematics Subject Classification ID

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

Related Items (17)

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

Cites Work

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

This page was built for publication: Large sets of subspace designs