Cubes of symmetric designs

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized so that the resulting $n$-cubes may have inequivalent slices. For suitable parameters, they can be transformed into $n$-dimensional Hadamard matrices with this property. In contrast, previously known constructions of $n$-dimensional designs all give examples with equivalent slices.Comment: 18 page

Balanced generalized weighing matrices and their applications

Balanced generalized weighing matrices include well-known classical combinatorial objects such as Hadamard matrices and conference matrices; moreover, particular classes of BGW -matrices are equivalent to certain relative difference sets. BGW -matrices admit an interesting geometrical interpretation, and in this context they generalize notions like projective planes admitting a full elation or homology group. After surveying these basic connections, we will focus attention on proper BGW -matrices; thus we will not give any systematic treatment of generalized Hadamard matrices, which are the subject of a large area of research in their own right. In particular, we will discuss what might be called the classical parameter series. Here the nicest examples are closely related to perfect codes and to some classical relative difference sets associated with affine geometries; moreover, the matrices in question can be characterized as the unique (up to equivalence) BGW -matrices for the given parameters with minimum q-rank.One can also obtain a wealth of monomially inequivalent examples and deter  mine the q-ranks of all these matrices by exploiting a connection with linear shift register sequences

A family of symmetric designs

An embedding theorem for certain quasi-residual designs is proved and is used to construct a series of symmetric designs with upsilon a = (1 + 16 + ... + 16(m))9 + 16(m+1), k = (1 + 16 + ... + 16(m))9, and lambda =(1 + 16 + + 16(m-1))9 + 16(m) . 3, for a non-negative integer m