DOCSLIB.ORG

Latin Squares and Related Combinatorial Designs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Latin Squares and Related Combinatorial Designs Latin squares and related combinatorial designs Leonard Soicher Queen Mary University of London July 2014 Many of you are familiar with Sudoku puzzles. Here is “Sudoku #043 (Medium)” from Livewire Puzzles (http://www.puzzles.ca/sudoku.html): The aim is to complete the Sudoku, that is, to fill in the empty cells with numbers from 1 to 9 so that each number occurs once in each row and once in each column and once in each of the highlighted 3 by 3 subsquares. And here is the completed Sudoku solving the above puzzle (again from Livewire Puzzles (http://www.puzzles.ca/sudoku.html)): Solving a Sudoku puzzle requires you to think mathematically. The problem is stated precisely and has a precisely defined solution. You need to think logically and apply appropriate algorithms precisely. However, solving a Sudoku puzzle is different from research mathematics! A Sudoku puzzle is designed to have a unique solution. Often in research you don’t know if there is going to be even one solution to a problem or many solutions. Sudoku puzzles are limited to small sizes (usually 9 by 9) and use limited shapes of subregions (usually subsquares), but mathematicians usually want to study a problem in greater generality, and obtain proved truths (theorems). A completed Sudoku is an example of a combinatorial design, in which objects from a finite set are placed in a given structure so that given properties are satisfied. Combinatorial designs include mathematical objects called block designs, Latin squares, gerechte designs, mutually orthogonal Latin squares, SOMAs, orthogonal arrays, generalised t-designs, and many more. We will encounter some of these beasts in this lecture. Combinatorial designs are studied by statisticians for their use in the design of comparative experiments, and by pure mathematicians for their often beautiful structure and connections to finite geometry, graph theory (the study of connections and networks) and group theory (the abstract study of symmetry). First, a completed Sudoku is an example of a Latin square of order n, which is an n by n array, with each cell of the array containing just one element from a given set of n symbols, such that each of the n symbols occurs once in each row and once in each column of the array. Next, a completed Sudoku is a special case of a gerechte design, which is a Latin square of order n whose cells are partitioned into n regions, each containing n cells, such that each symbol occurs once in each region. (Gerechte designs were introduced in 1956 by W.U. Behrens for the statistical design of agricultural experiments.) Examples On the left is a Latin square of order 4. 1 2 3 4 5 6 7 8 2 1 4 3 7 8 5 6 3 4 1 2 8 7 6 5 4 3 2 1 6 5 8 7 On the right is a gerechte design. The regions are indicated by the colours, and are defined by the positions of the symbols in the Latin square on the left (so the white region consists of the cells where 1 occurs, the yellow region where 2 occurs, and so on). When an n by n gerechte design can be made in this way, having regions defined by the positions of the symbols in a given Latin square of order n, we see that when we superimpose the Latin square of the gerechte design on the given Latin square, like so: 1 5 2 6 3 7 4 8 2 7 1 8 4 5 3 6 3 8 4 7 1 6 2 5 4 6 3 5 2 8 1 7 that the cells contain every possible pairing of a symbol from one square with a symbol from the other square (there are exactly n2 such pairings), and we say that our two Latin squares are orthogonal. A set of Latin squares of order n is called a set of mutually orthogonal Latin squares (or MOLS) when each pair of distinct squares in the set are orthogonal. For a given n, the maximum size that a set of MOLS of order n can attain is denoted by N(n). The example below illustrates a set of three MOLS of order 4, superimposed, and shows that N(4) is at least 3. 1 5 9 2 6 10 3 7 11 4 8 12 2 7 12 1 8 11 4 5 10 3 6 9 3 8 10 4 7 9 1 6 12 2 5 11 4 6 11 3 5 12 2 8 9 1 7 10 Some things known about N(n) For all n greater than 1, N(n) n1. (This is not difficult to prove.) Whenever n is a power of a prime number, we have N(n )=n1. (Thus N(2)=1, N(3)=2, N(22)=3, N(5)=4, N(7)=6, N(23)=7, N(32)=8, N(11)=10, and so on. This result is proved by an algebraic construction using “finite fields”, which can only have prime-power size.) There is no pair of orthogonal Latin squares of order 6, so N(6)=1. (This was believed to be true by Euler, who discussed this problem around 1780, and a proof of this was finally published by G.Tarry in 1900.) N(n) is at least 2 unless n=2 or n=6. (This was proved in 1960 by R.C. Bose, S.S. Shrikhande and E.T. Parker. Euler had conjectured that there were no pairs of orthogonal Latin squares of order n for n=2, 6, 10, 14, 18, and so on, but this turned out to be spectacularly wrong.) If n divided by 4 has remainder 1 or 2 and n is not the sum of two squares of integers, then N(n) n1. (This was proved by R.H. Bruck and H.J. Ryser in 1949. Thus, for example, N(14)<13.) Although 10=12+32, N(10)<9, so the converse of the above result is false. (This was shown by C.W.H. Lam et al. in 1989, featuring much mathematics and very heavy computation. This was checked in 2011, by D. Roy, an MSc student at Carleton University, Ottawa.) Further results give better upper or lower bounds on N(n) for specific n. For example: N(10) 6, 5 N(12), 4 N(14) 10. Some of the many things not known about N(n) The greatest unknown: Are there any n with n not a power of a prime, but with N(n)=n1? The first open case is n=12. Indeed, for each specific n greater than 6 such that n is not a power of a prime, the exact value of N(n) is not known! Is there a set of three MOLS of order 10? (The problem is “combinatorial explosion”. Up to permutations of rows and columns and the naming of symbols, there are just 22 Latin squares of order 6, but the corresponding number for Latin squares of order 10 is 208,904,371,354,363,006.) SOMAs: generalising sets of MOLS Let us return to the picture of three superimposed MOLS of order n=4: 1 5 9 2 6 10 3 7 11 4 8 12 2 7 12 1 8 11 4 5 10 3 6 9 3 8 10 4 7 9 1 6 12 2 5 11 4 6 11 3 5 12 2 8 9 1 7 10 Each cell contains the same number k=3 of symbols. Each of the kn=12 symbols occurs once in each row and once in each column, and each pair of distinct symbols occur together in a cell at most once (two symbols from the same Latin square never occur together and two symbols from different Latin squares occur together exactly once). This motivates the definition of a SOMA(k,n), which generalises the concept of a set of k MOLS of order n. (SOMA stands for simple orthogonal multiarray.) Why do this? Mathematicians like to generalise. Designers of experiments may need (and have needed) designs that are like sets of k MOLS of order n, but where such a set does not exist or is not known to exist. SOMA(k,n)s have also arisen in other contexts, such as tournament design and message authentication. SOMA(k,n)s turn out to have nice properties. Definition Let k>0, n>1. A SOMA(k,n) is an n by n array, whose cells each contain exactly k elements chosen from a given set of kn symbols, such that each of the kn symbols occurs once in each row and once in each column, and each pair of distinct symbols occur together in at most one cell. Note that a SOMA(1,n) is the same thing as a Latin square of order n and that a set of k superimposed MOLS of order n gives a SOMA(k,n) . A SOMA(k,n) is indecomposable if it is not the superimposition of two smaller n by n SOMAs. Example N(6)=1, but on the next page I show a SOMA(3,6), decomposed into a Latin square of order 6 and an indecomposable SOMA(2,6). (This particular design arose in a number of different contexts and was discovered or studied independently by a number of researchers, including R.A. Bailey, E.F. Brickell, N.C.K. Phillips and W.D. Wallis.) Decomposable SOMA(3,6) with symmetry group of size 120 1 2 3 5 4 6 7 9 11 13 10 15 8 17 12 18 14 16 2 1 6 4 3 5 12 14 8 10 7 18 9 16 11 17 13 15 6 3 2 1 5 4 8 15 9 18 16 17 12 13 10 14 7 11 4 5 1 2 6 3 10 17 7 16 11 14 15 18 9 13 8 12 3 4 5 6 2 1 13 16 14 15 9 12 10 11 7 8 17 18 5 6 4 3 1 2 11 18 12 17 8 13 7 14 15 16 9 10 Some things known about SOMA(k,n)s Each SOMA(k,n) has a unique unrefinable decomposition into n by n arrays which are themselves SOMAs (proved by J.
Load more

Recommended publications
  • Latin Square Design and Incomplete Block Design Latin Square (LS) Design Latin Square (LS) Design
    Lecture 8 Latin Square Design and Incomplete Block Design Latin Square (LS) design Latin square (LS) design • It is a kind of complete block designs. • A class of experimental designs that allow for two sources of blocking. • Can be constructed for any number of treatments, but there is a cost. If there are t treatments, then t2 experimental units will be required. Latin square design • If you can block on two (perpendicular) sources of variation (rows x columns) you can reduce experimental error when compared to the RBD • More restrictive than the RBD • The total number of plots is the square of the number of treatments • Each treatment appears once and only once in each row and column A B C D B C D A C D A B D A B C Facts about the LS Design • With the Latin Square design you are able to control variation in two directions. • Treatments are arranged in rows and columns • Each row contains every treatment. • Each column contains every treatment. • The most common sizes of LS are 5x5 to 8x8 Advantages • You can control variation in two directions. • Hopefully you increase efficiency as compared to the RBD. Disadvantages • The number of treatments must equal the number of replicates. • The experimental error is likely to increase with the size of the square. • Small squares have very few degrees of freedom for experimental error. • You can’t evaluate interactions between: • Rows and columns • Rows and treatments • Columns and treatments. Examples of Uses of the Latin Square Design • 1. Field trials in which the experimental error has two fertility gradients running perpendicular each other or has a unidirectional fertility gradient but also has residual effects from previous trials.
    [Show full text]
  • Latin Squares in Experimental Design
    Latin Squares in Experimental Design Lei Gao Michigan State University December 10, 2005 Abstract: For the past three decades, Latin Squares techniques have been widely used in many statistical applications. Much effort has been devoted to Latin Square Design. In this paper, I introduce the mathematical properties of Latin squares and the application of Latin squares in experimental design. Some examples and SAS codes are provided that illustrates these methods. Work done in partial fulfillment of the requirements of Michigan State University MTH 880 advised by Professor J. Hall. 1 Index Index ............................................................................................................................... 2 1. Introduction................................................................................................................. 3 1.1 Latin square........................................................................................................... 3 1.2 Orthogonal array representation ........................................................................... 3 1.3 Equivalence classes of Latin squares.................................................................... 3 2. Latin Square Design.................................................................................................... 4 2.1 Latin square design ............................................................................................... 4 2.2 Pros and cons of Latin square design...................................................................
    [Show full text]
  • Chapter 30 Latin Square and Related Designs
    Chapter 30 Latin Square and Related Designs We look at latin square and related designs. 30.1 Basic Elements Exercise 30.1 (Basic Elements) 1. Di®erent arrangements of same data. Nine patients are subjected to three di®erent drugs (A, B, C). Two blocks, each with three levels, are used: age (1: below 25, 2: 25 to 35, 3: above 35) and health (1: poor, 2: fair, 3: good). The following two arrangements of drug responses for age/health/drugs, health, i: 1 2 3 age, j: 1 2 3 1 2 3 1 2 3 drugs, k = 1 (A): 69 92 44 k = 2 (B): 80 47 65 k = 3 (C): 40 91 63 health # age! j = 1 j = 2 j = 3 i = 1 69 (A) 80 (B) 40 (C) i = 2 91 (C) 92 (A) 47 (B) i = 3 65 (B) 63 (C) 44 (A) are (choose one) the same / di®erent data sets. This is a latin square design and is an example of an incomplete block design. Health and age are two blocks for the treatment, drug. 2. How is a latin square created? True / False Drug treatment A not only appears in all three columns (age block) and in all three rows (health block) but also only appears once in every row and column. This is also true of the other two treatments (B, C). 261 262 Chapter 30. Latin Square and Related Designs (ATTENDANCE 12) 3. Other latin squares. Which are latin squares? Choose none, one or more. (a) latin square candidate 1 health # age! j = 1 j = 2 j = 3 i = 1 69 (A) 80 (B) 40 (C) i = 2 91 (B) 92 (C) 47 (A) i = 3 65 (C) 63 (A) 44 (B) (b) latin square candidate 2 health # age! j = 1 j = 2 j = 3 i = 1 69 (A) 80 (C) 40 (B) i = 2 91 (B) 92 (A) 47 (C) i = 3 65 (C) 63 (B) 44 (A) (c) latin square candidate 3 health # age! j = 1 j = 2 j = 3 i = 1 69 (B) 80 (A) 40 (C) i = 2 91 (C) 92 (B) 47 (B) i = 3 65 (A) 63 (C) 44 (A) In fact, there are twelve (12) latin squares when r = 3.
    [Show full text]
  • Counting Latin Squares
    Counting Latin Squares Jeffrey Beyerl August 24, 2009 Jeffrey Beyerl Counting Latin Squares Write a program, which given n will enumerate all Latin Squares of order n. Does the structure of your program suggest a formula for the number of Latin Squares of size n? If it does, use the formula to calculate the number of Latin Squares for n = 6, 7, 8, and 9. Motivation On the Summer 2009 computational prelim there were the following questions: Jeffrey Beyerl Counting Latin Squares Does the structure of your program suggest a formula for the number of Latin Squares of size n? If it does, use the formula to calculate the number of Latin Squares for n = 6, 7, 8, and 9. Motivation On the Summer 2009 computational prelim there were the following questions: Write a program, which given n will enumerate all Latin Squares of order n. Jeffrey Beyerl Counting Latin Squares Motivation On the Summer 2009 computational prelim there were the following questions: Write a program, which given n will enumerate all Latin Squares of order n. Does the structure of your program suggest a formula for the number of Latin Squares of size n? If it does, use the formula to calculate the number of Latin Squares for n = 6, 7, 8, and 9. Jeffrey Beyerl Counting Latin Squares Latin Squares Definition A Latin Square is an n × n table with entries from the set f1; 2; 3; :::; ng such that no column nor row has a repeated value. Jeffrey Beyerl Counting Latin Squares Sudoku Puzzles are 9 × 9 Latin Squares with some additional constraints.
    [Show full text]
  • Geometry and Combinatorics 1 Permutations
    Geometry and combinatorics The theory of expander graphs gives us an idea of the impact combinatorics may have on the rest of mathematics in the future. Most existing combinatorics deals with one-dimensional objects. Understanding higher dimensional situations is important. In particular, random simplicial complexes. 1 Permutations In a hike, the most dangerous moment is the very beginning: you might take the wrong trail. So let us spend some time at the starting point of combinatorics, permutations. A permutation matrix is nothing but an n × n-array of 0's and 1's, with exactly one 1 in each row or column. This suggests the following d-dimensional generalization: Consider [n]d+1-arrays of 0's and 1's, with exactly one 1 in each row (all directions). How many such things are there ? For d = 2, this is related to counting latin squares. A latin square is an n × n-array of integers in [n] such that every k 2 [n] appears exactly once in each row or column. View a latin square as a topographical map: entry aij equals the height at which the nonzero entry of the n × n × n array sits. In van Lint and Wilson's book, one finds the following asymptotic formula for the number of latin squares. n 2 jS2j = ((1 + o(1)) )n : n e2 This was an illumination to me. It suggests the following asymptotic formula for the number of generalized permutations. Conjecture: n d jSdj = ((1 + o(1)) )n : n ed We can merely prove an upper bound. Theorem 1 (Linial-Zur Luria) n d jSdj ≤ ((1 + o(1)) )n : n ed This follows from the theory of the permanent 1 2 Permanent Definition 2 The permanent of a square matrix is the sum of all terms of the deter- minants, without signs.
    [Show full text]
  • Latin Puzzles
    Latin Puzzles Miguel G. Palomo Abstract Based on a previous generalization by the author of Latin squares to Latin boards, this paper generalizes partial Latin squares and related objects like partial Latin squares, completable partial Latin squares and Latin square puzzles. The latter challenge players to complete partial Latin squares, Sudoku being the most popular variant nowadays. The present generalization results in partial Latin boards, completable partial Latin boards and Latin puzzles. Provided examples of Latin puzzles illustrate how they differ from puzzles based on Latin squares. The exam- ples include Sudoku Ripeto and Custom Sudoku, two new Sudoku variants. This is followed by a discussion of methods to find Latin boards and Latin puzzles amenable to being solved by human players, with an emphasis on those based on constraint programming. The paper also includes an anal- ysis of objective and subjective ways to measure the difficulty of Latin puzzles. Keywords: asterism, board, completable partial Latin board, con- straint programming, Custom Sudoku, Free Latin square, Latin board, Latin hexagon, Latin polytope, Latin puzzle, Latin square, Latin square puzzle, Latin triangle, partial Latin board, Sudoku, Sudoku Ripeto. 1 Introduction Sudoku puzzles challenge players to complete a square board so that every row, column and 3 × 3 sub-square contains all numbers from 1 to 9 (see an example in Fig.1). The simplicity of the instructions coupled with the entailed combi- natorial properties have made Sudoku both a popular puzzle and an object of active mathematical research. arXiv:1602.06946v1 [math.HO] 22 Feb 2016 Figure 1. Sudoku 1 Figure 2.
    [Show full text]
  • Sets of Mutually Orthogonal Sudoku Latin Squares Author(S): Ryan M
    Sets of Mutually Orthogonal Sudoku Latin Squares Author(s): Ryan M. Pedersen and Timothy L. Vis Source: The College Mathematics Journal, Vol. 40, No. 3 (May 2009), pp. 174-180 Published by: Mathematical Association of America Stable URL: http://www.jstor.org/stable/25653714 . Accessed: 09/10/2013 20:38 Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp . JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to The College Mathematics Journal. http://www.jstor.org This content downloaded from 128.195.64.2 on Wed, 9 Oct 2013 20:38:10 PM All use subject to JSTOR Terms and Conditions Sets ofMutually Orthogonal Sudoku Latin Squares Ryan M. Pedersen and Timothy L Vis Ryan Pedersen ([email protected]) received his B.S. inmathematics and his B.A. inphysics from the University of the Pacific, and his M.S. inapplied mathematics from the University of Colorado Denver, where he is currently finishing his Ph.D. His research is in the field of finiteprojective geometry. He is currently teaching mathematics at Los Medanos College, inPittsburg California. When not participating insomething math related, he enjoys spending timewith his wife and 1.5 children, working outdoors with his chickens, and participating as an active member of his local church.
    [Show full text]
  • Lecture 20 Basics in Latin Square Design
    Analysis of Variance and Design of Experiments Experimental Designs and Their Analysis ::: Lecture 20 Basics in Latin Square Design Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Slides can be downloaded from http://home.iitk.ac.in/~shalab/sp1 Latin Square Design: The treatments in the RBD are randomly assigned to b blocks such that each treatment must occur in each block rather than assigning them at random over the entire set of experimental units as in the CRD. There are only two factors – block and treatment effects – which are taken into account and the total number of experimental units needed for complete replication are bv where b and v are the numbers of blocks and treatments respectively. 2 Latin Square Design: If there are three factors and suppose there are b, v and k levels of each factor, then the total number of experimental units needed for a complete replication are bvk. This increases the cost of experimentation and the required number of experimental units over RBD. In Latin square design (LSD), the experimental material is divided into rows and columns, each having the same number of experimental units which is equal to the number of treatments. 3 Latin Square Design: The treatments are allocated to the rows and the columns such that each treatment occurs once and only once in each row and in each column. In order to allocate the treatment to the experimental units in rows and columns, we take help from Latin squares. 4 Latin Square: A Latin square of order p is an arrangement of p2 symbols in cells arranged in p rows and p columns such that each symbol occurs once and only once in each row and in each column.
    [Show full text]
  • Lecture 7: Latin Square and Related Design Montgomery: Section 4.2-4.3
    Statistics 514: Latin Square and Related Design Lecture 7: Latin Square and Related Design Montgomery: Section 4.2-4.3 Fall, 2005 Page 1 Statistics 514: Latin Square and Related Design Automobile Emission Experiment Four cars and four drivers are employed in a study for possible differences between four gasoline additives(A, B, C, D). Even though cars can be identical models, slight systematic differences are likely to occur in their performance, and even though each driver may do his best to drive the car in the manner required by the test, slight systematic differences can occur from driver to driver. It would be desirable to eliminate both the car-to-car and driver-to-driver differences. cars drivers1234 1 A=24 B=26 D=20 C=25 2 D=23 C=26 A=20 B=27 3 B=15 D=13 C=16 A=16 4 C=17 A=15 B=20 D=20 Fall, 2005 Page 2 Statistics 514: Latin Square and Related Design Design Matrix and Orthogonality drivers cars additives 11A 12B 13D 14C 21D 22C 23A 24B 31B 32D 33C 34A 41C 42A 43B 44D Orthogonality: for any two columns, all possible combinations appear and appear only once. Fall, 2005 Page 3 Statistics 514: Latin Square and Related Design Latin Square Design • Design is represented in p × p grid, rows and columns are blocks and Latin letters are treatments. – Every row contains all the Latin letters and every column contains all the Latin letters. • Standard Latin Square: letters in first row and first column are in alphabetic order.
    [Show full text]
  • Classification of Small Class Association Schemes Coming from Certain Combinatorial Objects Joohyung Kim Iowa State University
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 2005 Classification of small class association schemes coming from certain combinatorial objects Joohyung Kim Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Mathematics Commons Recommended Citation Kim, Joohyung, "Classification of small class association schemes coming from certain combinatorial objects " (2005). Retrospective Theses and Dissertations. 1570. https://lib.dr.iastate.edu/rtd/1570 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. NOTE TO USERS This reproduction is the best copy available. ® UMI Classification of small class association schemes coming from certain combinatorial objects by Joohyung Kim A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Sung-Yell Song, Co-major Professor Ling Long, Co-major Professor Clifford Bergman Fritz Keinert Jonathan D. H. Smith Iowa State University Ames, Iowa 2005 Copyright © Joohyung Kim, 2005. All rights reserved. UMI Number: 3184628 INFORMATION TO USERS The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted.
    [Show full text]
  • STAT22200 Chapter 13 Complete Block Designs
    STAT22200 Chapter 13 Complete Block Designs Yibi Huang 13.1-13.2 Randomized Complete Block Design (RCBD) 13.3 Latin Square Designs 13.3.1 Crossover Designs 13.3.4 Replicated Latin Square Designs 13.4 Graeco-Latin Squares Chapter 13 - 1 Block Designs I A block is a set of experimental units that are homogeneous in some sense. Hopefully, units in the same block will have similar responses (if applied with the same treatment.) I Block designs: randomize the units within each block to the treatments. Chapter 13 - 2 Randomized Complete Block Design (RCBD) We want to test g treatments. There are b blocks of units available, each block contains k = rg units. I Within each block, the k = rg units are randomized to the g treatments, r units each. I \Complete" means each of the g treatments appears the same number of times (r) in every block. I Mostly, block size k = # of treatments g, i.e., r = 1. I Matched-Pair design is a special case of RCBD in which the block size k = 2: Block 1 Block 2 ··· Block b Treatment 1 y11 y12 ··· y1b Treatment 2 y21 y22 ··· y2b . ··· . Treatment g yg1 yg2 ··· ygb Normally, data are shown arranged by block and treatment. Cannot tell from the data what was/was not randomized. Chapter 13 - 3 Advantage of Blocking I Blocking is the second basic principle of experimental design after randomization. \Block what you can, randomize everything else." I If units are highly variable, grouping them into more similar blocks can lead to a large increase in efficiency (more power to detect difference in treatment effects).
    [Show full text]
  • 9 Latin Squares
    9 Latin Squares Latin Square: A Latin Square of order n is an n × n array where each cell is occupied by one of n colours with the property that each colour appears exactly once in each row and in each column. We say that such an array is an L(n). 2 3 α β γ δ 6 7 6 β α γ δ 7 6 7 6 7 6 γ δ β α 7 6 7 6 δ α β γ 7 4 5 γ δ α β Cayley Table: If G is a finite group, then the multiplication table for G, also called a Cayley table, yields a latin square. For instance, the Cayley table of Z4 is the following: 0 1 2 3 0 0 1 2 3 1 1 2 3 0 2 2 3 0 1 3 3 0 1 2 Quasigroup: A quasigroup is a set X equipped with a binary operation so that for every a; b 2 X the equations ax = b and xa = b have unique solutions. Equivalently, it is a latin square where the rows and columns are indexed by the set X which is also the set of colours. Edge-Colouring: Let Kn;n be the complete bipartite graph with bipartition (R; C) and consider an n × n array with rows indexed by R and columns indexed by C. This gives a correspondence between edges of Kn;n and cells in this array, and we find that an n-edge- colouring of the graph corresponds to a latin square in our array.
    [Show full text]