In this paper we investigate the intersections of classes of covering arrays (CAs) and packing arrays (PAs). The arrays appearing in these intersections obey to upper and lower bounds regarding the appearance of tuples in sub-matrices—we call these arrays balanced covering arrays. We formulate and formalize first observations for which upper and lower bounds on the appearance of tuples it is of interest to consider these intersections of CAs and PAs. Outside of these bounds the intersections will be either empty, for the case of too restrictive constraints, or equal to the maximum element in the emerging lattices, for the case of too weak constraints. We present a column extension algorithm for classification of nonequivalent balanced CAs that uses a SAT solver or a pseudo-Boolean (PB) solver to compute the columns suitable for array extension together with a lex-leader ordering to identify unique representatives for each equivalence class of balanced CAs. These computations bring to light a dissection of classes of CAs that is partially nested due to the nature of the considered intersections. These dissections can be trivial, containing only a single type of balanced CAs, or can also appear as highly structured containing multiple nested types of balanced CAs. Our results indicate that balanced CAs are an interesting class of designs that is rich of structure.
We show that the maximum number of columns in -optimal supersaturated designs (SSDs) with 16 rows and is 60 by showing that there exists no resolvable 2-(16, 8, 35) design such that any two blocks from different parallel classes intersect in 3, 5, or 4 points. This is accomplished by an exhaustive computer search that uses the parallel class intersection pattern method to reduce the search space. We also classify all nonisomorphic -optimal 5-circulant SSDs with 16 rows and .
Coherent configurations are a generalization of association schemes. Motivated by the recent study of Q-polynomial coherent configurations, in this paper, we study the spherical embedding of a Q-polynomial coherent configuration into some eigenspace by a primitive idempotent. We present a necessary and sufficient condition when the embedding becomes a Euclidean -design (on two concentric spheres) in terms of the Krein numbers for . In addition, we obtain some Euclidean 2- or 3-designs from spherical embedding of coherent configurations including tight relative 4- or 5-designs in binary Hamming schemes and the union of derived designs of a tight 4-design in Hamming schemes.
In this paper, we prove that there are no projective planes of order 12 admitting a collineation group of order 4. This yields that the order of any collineation group of a projective plane of order 12 is 1, 2, or 3.
In this paper, we give an alternative construction of the Hermitian unital 2-(28, 4, 1) design in such a way that it is constructed on the isotropic vectors in a unitary geometry of dimension 3 over the field . As a corollary, we can construct a unique 3-(10, 4, 1) design (namely, the Witt system ).
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：