No label defined (Q3749062)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3985232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3985232 |
Statements
1986
0 references
Latin squares
0 references
orthogonal
0 references
0.8399932384490967
0 references
0.8191016316413879
0 references
0.8132868409156799
0 references
If N(n) denotes the number of Latin squares in the longest orthogonal set of Latin squares of order n then it is known that N(n)\(\leq n-1\) if \(n>1\) and N(n)\(\geq 2\) when \(n\neq 2\) or 6. The present author produced a proof of the following theorem. N(n)\(\geq 3\) holds for every n except when \(n=2,3\) or 6 and possibly \(n=10\) or 14. The aim of the author was to produce a short, concise, reasonably complete proof of scattered known results. \{Reviewer's remark: Recently \(N(14)\geq 3\) has been proved [see \textit{D. T. Todorov}, Ars Comb. 20, 45-47 (1985; Zbl 0596.05009)]. Todorov's result seems to be unknown to the author.\}
0 references