| 1. |
- Bailey, Rosemary A., et al.
(author)
-
Sesqui-arrays, a generalisation of triple arrays
- 2018
-
In: The Australasian Journal of Combinatorics. - 1034-4942. ; 71:3, s. 427-451
-
Journal article (peer-reviewed)abstract
- A triple array is a rectangular array containing letters, each letter occurring equally often with no repeats in rows or columns, such that the number of letters common to two rows, two columns, or a row and a column are (possibly different) non-zero constants. Deleting the condition on the letters common to a row and a column gives a double array. We propose the term sesqui-array for such an array when only the condition on pairs of columns is deleted. Thus all triple arrays are sesqui-arrays.In this paper we give three constructions for sesqui-arrays. The first gives (n+1) x n(2) arrays on n(n+1) letters for n >= 2. (Such an array for n = 2 was found by Bagchi.) This construction uses Latin squares. The second uses the Sylvester graph, a subgraph of the Hoffman-Singleton graph, to build a good block design for 36 treatments in 42 blocks of size 6, and then uses this in a 7 x 36 sesqui-array for 42 letters.We also give a construction for K x (K - 1)(K - 2)/2 sesqui-arrays on K(K - 1)/2 letters. This construction uses biplanes. It starts with a block of a biplane and produces an array which satisfies the requirements for a sesqui-array except possibly that of having no repeated letters in a row or column. We show that this condition holds if and only if the Hussain chains for the selected block contain no 4-cycles. A sufficient condition for the construction to give a triple array is that each Hussain chain is a union of 3-cycles; but this condition is not necessary, and we give a few further examples.We also discuss the question of which of these arrays provide good designs for experiments.
|
|
| 2. |
- Nilson, Tomas, et al.
(author)
-
Inner balance of symmetric designs
- 2014
-
In: Designs, Codes and Cryptography. - : Springer. - 0925-1022 .- 1573-7586. ; 71:2, s. 247-260
-
Journal article (peer-reviewed)abstract
- A triple array is a row-column design which carries two balanced incomplete block designs (BIBDs) as substructures. McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005), Section 8, gave one example of a triple array that also carries a third BIBD, formed by its row-column intersections. This triple array was said to be balanced for intersection, and they made a search for more such triple arrays among all potential parameter sets up to some limit. No more examples were found, but some candidates with suitable parameters were suggested. We define the notion of an inner design with respect to a block for a symmetric BIBD and present criteria for when this inner design can be balanced. As triple arrays in the canonical case correspond to SBIBDs, this in turn yields new existence criteria for triple arrays balanced for intersection. In particular, we prove that the residual design of the related SBIBD with respect to the defining block must be quasi-symmetric, and give necessary and sufficient conditions on the intersection numbers. This, together with our parameter bounds enable us to exclude the suggested triple array candidates in McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005) and many others in a wide search. Further we investigate the existence of SBIBDs whose inner designs are balanced with respect to every block. We show as a key result that such SBIBDs must possess the quasi-3 property, and we answer the existence question for all known classes of these designs.
|
|
| 3. |
- Nilson, Tomas, 1956-
(author)
-
Intercalates in double and triple arrays
- 2022
-
In: Journal of combinatorial designs (Print). - : Wiley. - 1063-8539 .- 1520-6610. ; 30:3, s. 135-151
-
Journal article (peer-reviewed)abstract
- This paper addresses the question of how intercalates occur in the two known infinite families of triple arrays, the Paley triple arrays constructed in 2005 by Preece et al., and the Triple arrays from difference sets in 2017 by Nilson and Cameron. The main reason for doing this is that the number of such embedded Latin squares is often used when checking whether two arrays are isotopic or not. We determine sharp bounds for the number and density of intercalates for the main subclasses of these families respectively. We also prove the existence of an infinite family of triple arrays in which every two occurrences of an entry lie in an intercalate.
|
|
| 4. |
- Nilson, Tomas, 1956-
(author)
-
Pseudo-Youden designs balanced for intersection
- 2011
-
In: Journal of Statistical Planning and Inference. - : Elsevier BV. - 0378-3758 .- 1873-1171. ; 141:6, s. 2030-2034
-
Journal article (peer-reviewed)abstract
- If the row-column intersections of a row-column design A form a balanced incomplete block design, then A is said to be balanced for intersection. This property was originally defined for triple arrays by McSorley et al. (2005a), Section 8, where an example was presented and questions of existence were raised and discussed. We give sufficient conditions for the class of balanced grids in order to be balanced for intersection, and prove that a family of binary pseudo-Youden designs has this property.
|
|
| 5. |
- Nilson, Tomas, et al.
(author)
-
Triple arrays and Youden squares
- 2015
-
In: Designs, Codes and Cryptography. - : Springer. - 0925-1022 .- 1573-7586. ; 75:3, s. 429-451
-
Journal article (peer-reviewed)abstract
- This paper addresses the question of when triple arrays can be constructed from Youden squares by removing a column together with the symbols therein, and then exchanging the role of columns and symbols. The scope of the investigation is limited to the standard case of triple arrays with $v=r+c-1$. For triple arrays with $\lambda_{cc}=1$ it is proven that they can never be constructed in this way, and for triple arrays with $\lambda_{cc}=2$ it is proven that there always exists a suitable Youden square and a suitable column for this construction. Further, it is proven that Youden square constructed from a certain family of difference sets never give rise to triple arrays in this way but always gives rise to double arrays. Finally, it is proven that all triple arrays in the single known infinite family, the Paley triple arrays, can all be constructed in this way for some suitable choice of Youden square and column.
|
|
| 6. |
- Nilson, Tomas, 1956-, et al.
(author)
-
Triple arrays from difference sets
- 2017
-
In: Journal of combinatorial designs (Print). - : Wiley. - 1063-8539 .- 1520-6610. ; 25:11, s. 494-506
-
Journal article (peer-reviewed)abstract
- This paper addresses the question whether triple arrays can be constructed from Youden squares developed from difference sets. We prove that if the difference set is abelian, then having -1 as multiplier is both a necessary and sufficient condition for the construction to work. Using this, we are able to give a new infinite family of triple arrays. We also give an alternative and more direct version of the construction, leaving out the intermediate step via Youden squares. This is used when we analyse the case of non-abelian difference sets, for which we prove a sufficient condition for giving triple arrays. We do a computer search for such non-abelian difference sets, but have not found any examples satisfying the given condition.
|
|
