Combinatory Design

We investigate methods of exhaustive enumeration of resolvable designs. In the computational aspect, for the construction of designs, we investigate reverse algorithms with intermediate-level, isomorphism-based rejection. The designs are used in various areas of mathematics, for example in statistical inference, coding theory, finite geometry, and recreational mathematics. They also have important applications in communications, cryptography and design of experiments in areas such as agriculture, biology, medicine and industrial engineering.

Project listing:

Enumeration of Solvable Designs

Enumeration of Solvable Designs