Skip to content

Research at St Andrews

Sesqui-arrays, a generalisation of triple arrays

Research output: Contribution to journalArticle

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 commonto 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 ofcolumns 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 n2 arrays on n(n+1) letters for n>1. (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 onK(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.
Close

Details

Original languageEnglish
Pages (from-to)427-451
JournalAustralasian Journal of Combinatorics
Volume71
Issue number3
Publication statusPublished - 1 Jun 2018

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Multi-part balanced incomplete-block designs

    Bailey, R. A. & Cameron, P. J., 18 Apr 2019, In : Statistical Papers. 60, 2, p. 55-76 22 p.

    Research output: Contribution to journalArticle

  2. Substitutes for the non-existent square lattice designs for 36 varieties (Extended Abstract)

    Bailey, R. A. & Cameron, P. J., 1 Apr 2019, Biuletyn Oceny Odmian. Gacek, E. (ed.). Słupia Wielka, Vol. 35. p. 11-13 3 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  3. Equitable partitions of Latin-square graphs

    Bailey, R. A., Cameron, P. J., Gavrilyuk, A. L. & Goryainov, S. V., 1 Mar 2019, In : Journal of Combinatorial Designs. 27, 3, p. 142-160

    Research output: Contribution to journalArticle

  4. On optimality and construction of circular repeated-measurements designs

    Bailey, R. A., Cameron, P. J., Filipiak, K., Kunert, J. & Markiewicz, A., Jan 2017, In : Statistica Sinica. 27, 1, p. 1-22 22 p.

    Research output: Contribution to journalArticle

  5. Using graphs to find the best block designs

    Bailey, R. A. & Cameron, P. J., 2013, Topics in Structural Graph Theory. Beineke, L. W. & Wilson, R. J. (eds.). Cambridge University Press, p. 282-317 (Encyclopaedia of Mathematics and its Applications; vol. 147).

    Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)

Related by journal

  1. Australasian Journal of Combinatorics (Journal)

    Rosemary Anne Bailey (Member of editorial board)
    2013 → …

    Activity: Publication peer-review and editorial work typesEditor of research journal

Related by journal

  1. Most switching classes with primitive automorphism groups contain graphs with trivial groups

    Cameron, P. J. & Spiga, P., Jun 2015, In : Australasian Journal of Combinatorics. 62, 1, p. 76-90 15 p.

    Research output: Contribution to journalArticle

  2. Groups with right-invariant multiorders

    Cameron, P. J., 2013, In : Australasian Journal of Combinatorics. 56, p. 187-193

    Research output: Contribution to journalArticle

  3. Perfect countably infinite Steiner triple systems

    Cameron, P. J. & Webb, B., 2012, In : Australasian Journal of Combinatorics. 54, p. 273-278

    Research output: Contribution to journalArticle

  4. A note on higher-dimensional magic matrices

    Cameron, P. J., Krattenthaler, C. & Müller, T. W., 2011, In : Australasian Journal of Combinatorics. 50, p. 207-217

    Research output: Contribution to journalArticle

ID: 252286083

Top