Two new symmetric inseparable double squares (Q1894776)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two new symmetric inseparable double squares |
scientific article; zbMATH DE number 778541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two new symmetric inseparable double squares |
scientific article; zbMATH DE number 778541 |
Statements
Two new symmetric inseparable double squares (English)
0 references
31 March 1996
0 references
A symmetric double square of order \(n\) based on the \(n\)-set \(R\) is an \(n\times n\) array whose cells contain unordered pairs of symbols of \(R\), such that each symbol occurs precisely twice per row and twice per column, each pair of distinct elements occurs precisely twice in the array, each pair of identical elements occurs precisely once in the array, and the cells \((i, j)\) and \((j, i)\) contain the same pair. It is called an inseparable symmetric double square of order \(n\), \(\text{SIDS}(n)\), if it does not arise from the superposition of two Latin squares. The author shows the existence of an \(\text{SIDS}(18)\) and an \(\text{SIDS}(23)\). This completes earlier work of \textit{A.-F. Mouyart} [Ann. Discrete Math. 17, 483-496 (1983; Zbl 0521.05018)] and the author [Discrete Math. 98, No. 2, 141-145 (1991; Zbl 0753.05011)] to show the existence of \(\text{SIDS}(n)\) for all \(n\geq 6\).
0 references
symmetric double square
0 references
cells
0 references
Latin squares
0 references
0.9374939203262328
0 references
0.7425220608711243
0 references
0.7159759402275085
0 references
0.7159084677696228
0 references