On the number of orthogonal systems in vector spaces over finite fields.
On the Reconstruction of Latin Squares
On the spectrum of resolvable orthogonal arrays invariant under the Klein group K4.
On the sprectra of certain classes of Room frames.
On the structure and classification of SOMAs: Generalizations of mutually orthogonal Latin squares.
On the volume of the polytope of doubly stochastic matrices.
On two- and three-element subsets of groups.
On π-Groupoids
Optimal mixed Factorial Resolution III designs
Orthogonal arrays with parameters OA and 3-dimensional projective geometries.
Orthogonal colorings of graphs.
Orthogonal partitions and covering of graphs
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 systems.
Orthogonal systems in vector spaces over finite fields.
Orthogonal systems of n-ary operations and codes
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...