Enumeration of balanced ternary designs. (Q1428560)

A \((V,B; \rho_1,\rho_2, R; K,\Lambda)\) balanced ternary design consists of a pair \(({\mathcal V}, {\mathcal B})\), where \({\mathcal V}\) is a \(V\)-set of points and \({\mathcal B}\) is a collection of \(B\) \(K\)-multisubsets of \({\mathcal V}\), called blocks, such that each point appears a total of \(R\) times in the blocks with no block containing a point with multiplicity greater than two, each point appears in \(\rho_i\) blocks with multiplicity \(i\) for \(1\leq i\leq 2\), and every pair of distinct points appears \(\Lambda\) times in the blocks. In addition, \(b_2\) denotes the number of blocks with repeated points, so \(b_1= B- b_2\) blocks contain no repeated points, and a design is called simple if it contains no duplicate blocks. The authors employ a backtrack search algorithm with isomorph rejection, that they describe, to enumerate all but 12 of the 155 possible design classes with \(V\leq 10\), \(B\leq 30\), and \(R\leq 15\). For each enumerated class they provide the number of nonisomorphic designs, the number of simple designs, the size range of the automorphism groups, and the values of \(b_2\). All enumerated designs with \(V= B\) were discovered to be self-dual. Lower bounds on the number of nonisomorphic designs are provided for the 12 partially enumerated (due to insufficient computational resources) classes.