2017
DOI: 10.1016/j.jcta.2016.11.004
|View full text |Cite
|
Sign up to set email alerts
|

Large sets of subspace designs

Abstract: Abstract. In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Graß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 LS 5 [2](2, 3, 6). The application of the new recursion method to this halving and an already known LS 3 [2](2, 3, 6) yields two infinite two-parameter series of halvings… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
37
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(37 citation statements)
references
References 32 publications
0
37
0
Order By: Relevance
“…Various q-analogs of designs were considered, t-designs (see [11] and references therein), Steiner systems [9,23] and in particular the Fano plane [24,58], transversal designs [27], group divisible designs [14], large sets [12,13], etc. But, one very natural modification of the design property was not thoroughly studied -the family of packings.…”
Section: Introductionmentioning
confidence: 99%
“…Various q-analogs of designs were considered, t-designs (see [11] and references therein), Steiner systems [9,23] and in particular the Fano plane [24,58], transversal designs [27], group divisible designs [14], large sets [12,13], etc. But, one very natural modification of the design property was not thoroughly studied -the family of packings.…”
Section: Introductionmentioning
confidence: 99%
“…We list in Table 1 the known algebraic constructions of infinite families of t-(n, r, λ) subspace designs that do not rely on the existence of other subspace designs. This list is still rather short, although many specific numerical parameter sets are known to be realizable [8,9,10]. In most cases a computer search is combined with an assumed automorphism group, often in fact the normalizer of a Singer cycle group.…”
Section: Introductionmentioning
confidence: 99%
“…As an example, one of Suzuki's 2-n, 3, 3 1 q designs over F q yields a 2-n, 3, q 3 n − 5 1 q subspace design, whose Table 5]. Finally, in [8], the authors show how to construct new large sets of designs from existing ones. An LS q [N ](t, r, n) large set is a partition of the set of n r q r-dimensional…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Since then, more subspace designs have been constructed, see [3,4,5,11,12,16,17,18]. In [2] the first q-Steiner systems for t = 2 were constructed.…”
Section: Introductionmentioning
confidence: 99%