Let \(S\) be a set of \(v\) elements. A golf design of order \(v\) is a set of \(v-2\) latin squares \(L_0,\dots, L_{v-3}\) for which for \(0\leq i\leq v-3\): (1) \(L_i\) is a \(v\times v\) latin square with symbol set \(S\), and rows and columns indexed by \(S\). (2) \(L_i(x,y)=L_i(y,x)\) for \(x,y\in S\). (3) \(L_i(x,x)=x\) for \(x\in S\). (4) \(L_i (x,y) \neq L_j(x,y)\) for \(i<j\leq v-3\) and \(x,y\in S\) with \(x\neq y\). The authors construct a golf design of order 11, and as a consequence, a golf design of order \(v\) exists whenever \(v\) is odd, except when \(v=5\) and possibly when \(v=41\).
- Pooling, lattice square, and union jack designs
- On large set plus of disjoint incomplete Latin squares
- The existence spectrum of golf designs
- scientific article; zbMATH DE number 733856 (Why is no real title available?)
- Investigating the existence of orthogonal golf designs via satisfiability testing
- On a pair of orthogonal golf designs
- The existence of r‐golf designs
- Further results on large sets of partitioned incomplete Latin squares
- The existence of large set of symmetric partitioned incomplete latin squares
This page was built for publication: A golf design of order 11
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361655)
