Orthogonal permutation arrays and related structures
Orthogonal Resolutions and Latin Squares
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 Contract No...
Orthogonal Steiner Systems.
Orthogonal systems.
Orthogonal systems in vector spaces over finite fields.
Orthogonal systems of n-ary operations and codes
Ovals and non-ovoidal Laguerre planes.
Overlapping latin subsquares and full products
We derive necessary and sufficient conditions for there to exist a latin square of order containing two subsquares of order and that intersect in a subsquare of order . We also solve the case of two disjoint subsquares. We use these results to show that: (a) A latin square of order cannot have more than subsquares of order , where . Indeed, the number of subsquares of order is bounded by a polynomial of degree at most in . (b) For all there exists a loop of order in which every...
Overlapping Pfaffians.