Page 1

Displaying 1 – 5 of 5

Showing per page

Packings of pairs with a minimum known number of quadruples

Jiří Novák (1995)

Mathematica Bohemica

Let E be an n -set. The problem of packing of pairs on E with a minimum number of quadruples on E is settled for n < 15 and also for n = 36 t + i , i = 3 , 6 , 9 , 12 , where t is any positive integer. In the other cases of n methods have been presented for constructing the packings having a minimum known number of quadruples.

Parallel Class Intersection Matrices of Orthogonal Resolutions

Zhelezova, Stela (2008)

Serdica Journal of Computing

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, BulgariaParallel 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 in [19] for designs...

Currently displaying 1 – 5 of 5

Page 1