✦ LIBER ✦

A short proof of the nonexistence of a pair of orthogonal latin squares of order six

✍ Scribed by D.R Stinson

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 219 KB
Volume: 36
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(84)90044-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Six mutually orthogonal Latin squares of

Six mutually orthogonal Latin squares of order 48

✍ Mieczyslaw Wojtas 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB 👁 1 views

A direct construction of six mutually orthogonal Latin squares of order 48 is given.

Embedding a latin square in a pair of or

Embedding a latin square in a pair of orthogonal latin squares

✍ Peter Jenkins 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

## Abstract In this paper, it is shown that a latin square of order __n__ with __n__ ≥ 3 and __n__ ≠ 6 can be embedded in a latin square of order __n__^2^ which has an orthogonal mate. A similar result for idempotent latin squares is also presented. © 2005 Wiley Periodicals, Inc. J Combin Designs 1

Embedding cyclic latin squares of order

Embedding cyclic latin squares of order 2n in a complete set of orthogonal F-squares

✍ S.J. Schwager; W.T. Federer; J.P. Mandeli 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 739 KB

An application of sum composition: A sel

An application of sum composition: A self orthogonal latin square of order ten

✍ A Hedayat 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 212 KB

An extension of mann's theorem to a trip

An extension of mann's theorem to a triple of mutually orthogonal latin squares of order 10

✍ John Wesley Brown 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 131 KB

On the maximum number of different order

On the maximum number of different ordered pairs of symbols in sets of latin squares

✍ Jeffrey H. Dinitz; Douglas R. Stinson 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 1 views

## Abstract In this paper, we study the problem of constructing sets of __s__ latin squares of order __m__ such that the average number of different ordered pairs obtained by superimposing two of the __s__ squares in the set is as large as possible. We solve this problem (for all __s__) when __m__