Partial geometric designs with prescribed automorphisms

摘要

Combinatorial designs have long been used to design efficient statistical experiments. More recently, connections to the theory of cryptographic communications have emerged. Combinatorial designs have provided solutions to problems coming from signal processing, radar, error-correcting codes, optical orthogonal codes, and image processing. Further, the most elegant solutions have come from designs with prescribed automorphisms. In this paper, we focus on partial geometric designs, a generalization of the classical 2-design. These designs have recently been shown to produce two directed strongly regular graphs. We generalize the well-known Kramer-Mesner Theorem for 2-designs to partial geometric designs. We also construct infinite families of partial geometric designs admitting a group of automorphisms which acts regularly on the point set and semi-regularly on the block set. The designs are obtained from new constructions of partial geometric difference families. These families were recently introduced a generalization of both the classical difference family and the partial geometric difference set.