This work was partially supported by the Bulgarian National Science Fund under Contract
No MM 1405. Part of the results were announced at the Fifth International Workshop on Optimal Codes
and Related Topics (OCRT), White Lagoon, June 2007, Bulgaria
Parallel class intersection matrices (PCIMs) have been defined
and used in [6], [14], [15] for the classification of resolvable designs with several
parameter sets. Resolutions which have orthogonal resolutions (RORs)
have been classified...
This article presents the principal results of the Ph.D. thesis Investigation and classification of doubly resolvable designs by Stela Zhelezova (Institute of Mathematics and Informatics, BAS), successfully defended at the Specialized Academic Council for Informatics and Mathematical
Modeling on 22 February 2010.
The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs
with an additional property -...
Resolutions which are orthogonal to at least one other resolution (RORs) and sets of m mutually orthogonal resolutions (m-MORs) of 2-(v, k, λ) designs are considered. A dependence of the number of nonisomorphic RORs and m-MORs of multiple designs on the number of inequivalent sets of v/k − 1 mutually orthogonal latin squares (MOLS) of size m is obtained. ACM Computing Classification System (1998): G.2.1.
∗ This work was partially supported by the Bulgarian National Science Fund under...
Download Results (CSV)