Search

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of $v$ and $k$ modulo $6$ we have $2 \leq \bar{v} < \bar{k} \leq 5$. The proof is constructive and consists of two parts. First, we give a computer construction for an $\operatorname{LS}_2[3](2,4,8)$, which is a partition of the set of all $4$-dimensional subspaces of an $8$-dimensional vector space over the binary field into three disjoint $2$-$(8, 4, 217)_2$ subspace designs. Together with the already known $\operatorname{LS}_2[3](2,3,8)$, the application of a recursion method based on a decomposition of the Gra{\ss}mannian into joins yields a construction for the claimed large sets.

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 $v\geq 6$, $v\equiv 2\mod 4$ and $3\leq k\leq v-3$, $k\equiv 3\mod 4$. 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$.

A generalization of forming derived and residual designs from $t$-designs to subspace designs is proposed. A $q$-analog of a theorem by Van Trung, van Leijenhorst and Driessen is proven, stating that if for some (not necessarily realizable) parameter set the derived and residual parameter set are realizable, the same is true for the reduced parameter set. As a result, we get the existence of several previously unknown subspace designs. Some consequences are derived for the existence of large sets of subspace designs. Furthermore, it is shown that there is no $q$-analog of the large Witt design.

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space diagonals of integer lengths, remains open. More generally an integral point set $\mathcal{P}$ is a set of $n$ points in the $m$-dimensional Euclidean space $\mathbb{E}^m$ with pairwise integral distances where the largest occurring distance is called its diameter. From the combinatorial point of view there is a natural interest in the determination of the smallest possible diameter $d(m,n)$ for given parameters $m$ and $n$. We give some new upper bounds for the minimum diameter $d(m,n)$ and some exact values., Comment: 8 pages, 7 figures; typos corrected