D-Dimensional Hypercubes and the Euler and MacNeish Conjectures.
Decomposition of complete graphs into -prisms
R. Frucht and J. Gallian (1988) proved that bipartite prisms of order have an -labeling, thus they decompose the complete graph for any positive integer . We use a technique called the -labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order called generalized prisms decompose the complete graph for any positive integer .
Der Darstellungssatz der Allgemeinen Differenzenmethode.
Designs, groups and lattices
The notion of designs in Grassmannian spaces was introduced by the author and R. Coulangeon, G. Nebe, in [3]. After having recalled some basic properties of these objects and the connections with the theory of lattices, we prove that the sequence of Barnes-Wall lattices hold -Grassmannian designs. We also discuss the connections between the notion of Grassmannian design and the notion of design associated with the symmetric space of the totally isotropic subspaces in a binary quadratic space, which...
Disegni divisibili e loro automorfismi
Double Resolvability of Some Complete 3-Designs.