Two new symmetric inseparable double squares
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\).
- A construction method of a class of SIDS\((n)\)
- A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
- scientific article; zbMATH DE number 874556
- The fine structures of three symmetric Latin squares with even orders
- A method for constructing symmetric Hamiltonian double Latin squares
This page was built for publication: Two new symmetric inseparable double squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894776)
