DOCSLIB.ORG

Block-Intersection Graphs of Steiner Triple Systems by Sally

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Block-Intersection Graphs of Steiner Triple Systems by Sally Block-Intersection Graphs of Steiner Triple Systems by Sally Shaul Kazin (Under the Direction of E. Rodney Canfield) Abstract A Steiner triple system of order n is a collection of subsets of size three, taken from the n-element set f0; 1; :::; n − 1g; such that every pair is contained in exactly one of the subsets. The subsets are called triples, and a block-intersection graph is constructed by having each triple correspond to a vertex. If two triples have a non-empty intersection, an edge is inserted between their vertices. It is known that there are eighty Steiner triple systems of order 15 up to isomorphism. In this paper, we attempt to distinguish the eighty systems using their block-intersection graphs, as well as discuss general properties of block-intersection graphs of Steiner triple systems. Index words: Steiner triple system, Block-intersection graph, Isomorphism, Spectra Block-Intersection Graphs of Steiner Triple Systems by Sally Shaul Kazin B.S., The University of Georgia, 2005 A Thesis Submitted to the Graduate Faculty of The University of Georgia in Partial Fulfillment of the Requirements for the Degree Master of Arts Athens, Georgia 2012 c 2012 Sally Shaul Kazin All Rights Reserved Block-Intersection Graphs of Steiner Triple Systems by Sally Shaul Kazin Approved: Major Professor: E. Rodney Canfield Committee: Edward Azoff Leonard Chastkofsky Electronic Version Approved: Maureen Grasso Dean of the Graduate School The University of Georgia May 2012 Block-Intersection Graphs of Steiner Triple Systems Sally Shaul Kazin April 24, 2012 Acknowledgments I would like to thank Dr. Canfield for agreeing to be my advisor and for all of his time and effort in helping me research and write this thesis. I also want to thank my parents for everything, as I would not have made it here without them. Finally, thank you to MK, KSB, ZCS, and TH for helping me get through graduate school. You know who you are. iv Contents 1 Introduction 1 1.1 Combinatorial Definitions and Background . 2 1.2 Graph Theory Definitions . 3 1.3 Block-Intersection Graphs . 4 1.4 Properties of the Block-Intersection Graphs . 5 2 Methods of Construction 10 2.1 The Doubling Construction . 10 2.2 Lexicographically Least STS(n) . 11 2.3 Other Methods . 14 3 Cliques 17 3.1 Maximal Cliques in a BIG . 18 3.2 Maximum Cliques for n =15........................... 19 3.3 Clique Census . 21 3.4 System 1 for n =15................................ 23 4 Independent Sets 26 4.1 Independent Sets in a BIG . 26 4.2 Independent Set Census . 30 v 5 Spectra 33 5.1 Definitions and Background . 33 5.2 Spectra of the BIGs . 34 5.3 Graph Complements and Line Graphs . 35 5.4 Eigenspaces . 37 5.5 Distance-Regularity . 39 6 Differentiating Systems 41 6.1 Block-Intersection Graphs . 41 6.2 Cycle Structure . 43 6.3 Non-Graphical Methods . 44 6.4 Summary . 49 Appendix A Steiner Triple Systems of Order 13 50 Appendix B Code Used to Generate Block-Intersection Graphs 51 Bibliography 53 vi List of Tables 3.1 Clique Census for n =13............................. 21 3.2 Partial Clique Census for n = 15 . 22 4.1 Maximum Independent Sets in the BIG of STS(15) #61 . 29 4.2 Independent Set Census for n = 13 . 30 5.1 Spectra of the Block-Intersection Graphs . 35 6.1 Systems Differentiated Using Both Censuses . 42 6.2 Cycle Vectors for Select STS(15)s . 44 vii List of Figures 1.1 The BIG for STS(9) . 4 3.1 PG(3,2) . 24 3.2 The Fano Plane . 25 viii Chapter 1 Introduction In 1847, Reverend Thomas P. Kirkman published \On a Problem in Combinations" [11] that first answered questions on the existence of what would later be called Steiner triple systems. The problem he considered was to find a collection of subsets of size three, taken from the n-element set f0; 1; :::; n − 1g, with the property that every pair is contained in exactly one of the subsets. This problem was a specific case of a more general question on combinations posed by W.S.B. Woodhouse in 1844. Several years later, Jakob Steiner, apparently unaware of Kirkman's article, similarly asked about the existence of various designs, including the one solved by Kirkman. It was Steiner's name that was eventually used for the systems, although Steiner himself did not offer any solutions. Such systems were an early example of what are now known as balanced incomplete block designs in the field of combinatorial design. Kirkman's name did become associated with a related topic that originated with \Kirk- man's schoolgirl problem," in which he wanted to arrange fifteen girls into sets of three such that each girl was paired with every other girl once. This describes a Steiner triple system, but Kirkman added the condition that the thirty-five sets of three be expressible as seven partitions of f0; 1; :::; 14g. The triple system would then describe a week-long schedule for 1 daily walks where the fifteen girls were in different sets each day. In the same year his question was published, Kirkman offered a solution, as did Arthur Cayley [5]. Kirkman also asked about orders other than 15 for which an analogous problem could be solved. These designs are a subtype of Steiner triple systems often called Kirkman triple systems, and we will revisit this idea below. 1.1 Combinatorial Definitions and Background A Steiner triple system of order n is a pair (V; B) comprising the n-set V = f0; 1; :::; n − 1g and a set B of sets of size three, each a subset of V , such that any pair of elements of V appears in exactly one set of B. The sets in B are called triples or blocks. We will abbreviate \Steiner triple system of order n" as STS(n). A necessary and sufficient condition for the existence of a Steiner triple system of order n was proved by Kirkman in his 1847 paper, that n ≡ 1; 3 mod 6 [11]. As a balanced incomplete block design, an STS(n) is a (n; 3; 1)-design, where 3 is the size of a block and 1 is the number of blocks in which a pair of elements appears. In any n(n−1) n 3 STS(n), there are 6 triples. We obtain this total by computing 2 / 2 , as there are n 3 2 ways to select unordered pairs from the n-set and each triple contains 2 pairs. The replication number of an STS(n) is defined as the number r of triples in which each element of V appears. A theorem on block designs states that (n − 1) = r(3 − 1) for an STS(n), n−1 yielding the replication number equal to 2 . The subtype of STS(n)s known as Kirkman triple systems, as described above with Kirkman's schoolgirl problem, have the additional property of resolvability. First, we define a parallel class in an STS(n) as a set of pairwise disjoint triples that partitions the n-set; the union of the triples in a parallel class will contain each element once. An STS(n) is resolvable if the triples of B can be partitioned into parallel classes. In Kirkman's problem, each day 2 represents a parallel class. A necessary and sufficient condition on n for the existence of a resolvable STS(n) was not proved until 1965 [5], but it is quite simple: n ≡ 3 mod 6. Up to isomorphism, there is one STS each for orders 3, 7, and 9. There are two STS(13)s, eighty STS(15)s, over 11 billion STS(19)s, and the numbers grow exponentially from there (and are not completely determined for orders over 19) [10]. Richard Wilson showed that the number N of Steiner triple systems on a permissible order n is such that (e−5n)n2=6 ≤ N ≤ (e−1n)n2=6 [18]. In this paper we will focus on the Steiner triple systems of order 13 and 15, in particular on distinguishing among isomorphism types. The STS(15)s have been known for over half a century and have a standard numbering in the literature, which can be found in [5]. In addition, the two STS(13)s are included in Appendix A in the order by which they will be referenced. 1.2 Graph Theory Definitions A graph is an object made up of vertices and edges, where edges are links between vertices. If two vertices have an edge between them, they are adjacent. The number of edges leaving a vertex is called the degree of that vertex, and a simple graph contains no loops and at most one edge per pair of vertices; all graphs considered here will be simple. A graph with every vertex having equal degree is called regular. If for each pair of vertices, there is a sequence of edges starting from one vertex and ending at the other, the graph is connected. The complement G of a graph G is formed using the same vertex set as G with edges inserted between vertices that were not adjacent in G. For the following definitions, consider a graph on n vertices. If every pair of vertices is joined by an edge, the graph is complete and denoted by Kn. A graph can also be represented in the form of an adjacency matrix, which is an n × n matrix with entry aij equal to the 3 number of edges between the ith and jth vertices. In a simple graph, this matrix is composed entirely of 0's and 1's.
Load more

Recommended publications
  • COMBINATORICS, Volume
    http://dx.doi.org/10.1090/pspum/019 PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS Volume XIX COMBINATORICS AMERICAN MATHEMATICAL SOCIETY Providence, Rhode Island 1971 Proceedings of the Symposium in Pure Mathematics of the American Mathematical Society Held at the University of California Los Angeles, California March 21-22, 1968 Prepared by the American Mathematical Society under National Science Foundation Grant GP-8436 Edited by Theodore S. Motzkin AMS 1970 Subject Classifications Primary 05Axx, 05Bxx, 05Cxx, 10-XX, 15-XX, 50-XX Secondary 04A20, 05A05, 05A17, 05A20, 05B05, 05B15, 05B20, 05B25, 05B30, 05C15, 05C99, 06A05, 10A45, 10C05, 14-XX, 20Bxx, 20Fxx, 50A20, 55C05, 55J05, 94A20 International Standard Book Number 0-8218-1419-2 Library of Congress Catalog Number 74-153879 Copyright © 1971 by the American Mathematical Society Printed in the United States of America All rights reserved except those granted to the United States Government May not be produced in any form without permission of the publishers Leo Moser (1921-1970) was active and productive in various aspects of combin• atorics and of its applications to number theory. He was in close contact with those with whom he had common interests: we will remember his sparkling wit, the universality of his anecdotes, and his stimulating presence. This volume, much of whose content he had enjoyed and appreciated, and which contains the re• construction of a contribution by him, is dedicated to his memory. CONTENTS Preface vii Modular Forms on Noncongruence Subgroups BY A. O. L. ATKIN AND H. P. F. SWINNERTON-DYER 1 Selfconjugate Tetrahedra with Respect to the Hermitian Variety xl+xl + *l + ;cg = 0 in PG(3, 22) and a Representation of PG(3, 3) BY R.
    [Show full text]
  • Block Designs and Graph Theory*
    JOURNAL OF COMBINATORIAL qtIliORY 1, 132-148 (1966) Block Designs and Graph Theory* JANE W. DI PAOLA The City University of New York Comnumicated by R.C. Bose INTRODUCTION The purpose of this paper is to demonstrate the relation of balanced incomplete block designs to certain concepts of graph theory. The set of blocks of a balanced incomplete block design with Z -- 1 is shown to be related to a maximum internally stable set of vertices of a suitably defined graph. The development yields also an upper bound for the internal stability number of a large subclass of a class of graphs which we call "graphs on binomial coefficients." In a different but related context every balanced incomplete block design with 2 -- 1 is shown to be a solution of a suitably defined irreflexive relation. Some examples of relativizations and extensions of solutions of irreflexive relations (as developed by Richardson [13-15]) are generated as a result of the concepts derived. PRELIMINARY RESULTS A balanced incomplete block design (BIBD) is a set of v elements arranged in b blocks of k elements each in such a way that each element occurs r times and each unordered pair of distinct elements determines ,~ distinct blocks. The v, b, r, k, 2 are called the parameters of the design. * Research on which this paper is based supported by the U. S. Army Research Office-Durham under Contract No. DA-31-124-ARO-D-366. 132 BLOCK DESIGNS AND GRAPH THEORY 133 Following a suggestion implied by Berge [2] we introduce the DEHNmON. Agraph on the binomial coefficient (k)with edge pa- rameter 2, written G rr)k 4, is raphwhosevert ces ar t e (;).siDle k-tuples which can be formed from v elements and having as adjacent vertices those pairs of vertices which have more than 2 and less than k elements in common.
    [Show full text]
  • ON the POLYHEDRAL GEOMETRY of T–DESIGNS
    ON THE POLYHEDRAL GEOMETRY OF t{DESIGNS A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts In Mathematics by Steven Collazos San Francisco, California August 2013 Copyright by Steven Collazos 2013 CERTIFICATION OF APPROVAL I certify that I have read ON THE POLYHEDRAL GEOMETRY OF t{DESIGNS by Steven Collazos and that in my opinion this work meets the criteria for approving a thesis submitted in partial fulfillment of the requirements for the degree: Master of Arts in Mathematics at San Francisco State University. Matthias Beck Associate Professor of Mathematics Felix Breuer Federico Ardila Associate Professor of Mathematics ON THE POLYHEDRAL GEOMETRY OF t{DESIGNS Steven Collazos San Francisco State University 2013 Lisonek (2007) proved that the number of isomorphism types of t−(v; k; λ) designs, for fixed t, v, and k, is quasi{polynomial in λ. We attempt to describe a region in connection with this result. Specifically, we attempt to find a region F of Rd with d the following property: For every x 2 R , we have that jF \ Gxj = 1, where Gx denotes the G{orbit of x under the action of G. As an application, we argue that our construction could help lead to a new combinatorial reciprocity theorem for the quasi{polynomial counting isomorphism types of t − (v; k; λ) designs. I certify that the Abstract is a correct representation of the content of this thesis. Chair, Thesis Committee Date ACKNOWLEDGMENTS I thank my advisors, Dr. Matthias Beck and Dr.
    [Show full text]
  • On Doing Geometry in CAYLEY
    On doing geometry in CAYLEY PJC, November 1988 1 Introduction These notes were produced in response to a question from John Cannon: what issues are involved in adding facilities to CAYLEY for doing finite geometry? More specifically, what facilities would geometers want? At first sight, the idea of geometry in CAYLEY seems very natural. Groups and geometry have been intimately linked since long before the time of Klein. Many of the groups with which CAYLEY users deal act naturally on geometries. An important point which I’ll touch on briefly later is this: if we’re given a group which happens to be a classical group, many algorithmic questions (e.g. finding particular kinds of subgroups) become much easier once we’ve found and coordi- natised the geometry on which the group acts. With further thought, however, we see how opposed in spirit the two areas are. Everyone agrees on what a group is. Moreover, there are only a few ways in which a group is likely to be presented, and CAYLEY has facilities to deal with each of these. In each case, these are basic algorithms of such subtlety as to deter the casual user from implementing them – surely one of the facts that called CAYLEY into being in the first place. On the other hand, the sheer variety of finite geometries daunts the beginner, who meets projective, affine and polar spaces, buildings, generalised polygons, (semi) partial geometries, t-designs, Steiner systems, Latin squares, nets, codes, matroids, permutation geometries, to name just a few. The range of questions asked about them is even more bewildering.
    [Show full text]
  • Two-Sided Neighbours for Block Designs Through Projective Geometry
    Statistics and Applications Volume 12, Nos. 1&2, 2014 (New Series), pp. 81-92 Two-Sided Neighbours for Block Designs Through Projective Geometry Laxmi, R.R., Parmita and Rani, S. Department of Statistics, M.D.University, Rohtak, Haryana, India ____________________________________________________________________________ Abstract This paper is concerned with the construction of neighbour designs for OS2 series with parameters v= s2+s+1= b, r= s+1= k and λ=1, through projective geometry, for different values of s, whether s is a prime number or a prime power. For these constructed designs, a method has been developed to find out both-sided neighbours of a treatment. These both-sided neighbours have some common neighbours forming a series, and have property of circularity also. Keywords: Projective Geometry; OS2 Series; Border Plots; Neighbour Design; Two-Sided Neighbours ____________________________________________________________________________ 1 Introduction Designs over finite fields were introduced by Thomas in 1987. He constructed the first nontrivial 2-designs, over a finite field which were the designs with parameters 2-(v,3,7;2) for v ≥7 & v ≡ ±1 mod 6 and had used a geometric construction in a projective plane. In 1990 Suzuki extended Thomas family of 2-designs to a family of designs with parameters 2 -(v,3, s2+s+1; s) admitting a Singer cycle. In 1995 Miyakawa, Munemasa and Yoshiara gave a classification of 2-(7,3, λ, s) designs for s = 2,3 with small λ. In 2005 Kerber, Laue and Braun published the first 3-design over a finite field, a 3-(8, 4, 11; 2) design admitting the normalize of a Singer cycle, as well as the smallest 2-design known as design with parameters 2-(6, 3, 3; 2).
    [Show full text]
  • Combinatorial Designs
    LECTURE NOTES COMBINATORIAL DESIGNS Mariusz Meszka AGH University of Science and Technology, Krak´ow,Poland [email protected] The roots of combinatorial design theory, date from the 18th and 19th centuries, may be found in statistical theory of experiments, geometry and recreational mathematics. De- sign theory rapidly developed in the second half of the twentieth century to an independent branch of combinatorics. It has deep interactions with graph theory, algebra, geometry and number theory, together with a wide range of applications in many other disciplines. Most of the problems are simple enough to explain even to non-mathematicians, yet the solutions usually involve innovative techniques as well as advanced tools and methods of other areas of mathematics. The most fundamental problems still remain unsolved. Balanced incomplete block designs A design (or combinatorial design, or block design) is a pair (V; B) such that V is a finite set and B is a collection of nonempty subsets of V . Elements in V are called points while subsets in B are called blocks. One of the most important classes of designs are balanced incomplete block designs. Definition 1. A balanced incomplete block design (BIBD) is a pair (V; B) where jV j = v and B is a collection of b blocks, each of cardinality k, such that each element of V is contained in exactly r blocks and any 2-element subset of V is contained in exactly λ blocks. The numbers v, b, r, k an λ are parameters of the BIBD. λ(v−1) λv(v−1) Since r = k−1 and b = k(k−1) must be integers, the following are obvious arithmetic necessary conditions for the existence of a BIBD(v; b; r; k; λ): (1) λ(v − 1) ≡ 0 (mod k − 1), (2) λv(v − 1) ≡ 0 (mod k(k − 1)).
    [Show full text]
  • Steiner Systems S(2,4,V)
    Steiner systems S(2, 4,v) - a survey Colin Reid, [email protected] Alex Rosa, [email protected] Department of Mathematics and Statistics, McMaster University, Hamilton, Ontario, Canada Submitted: Jan 21, 2009; Accepted: Jan 25, 2010; Published: Feb 1, 2010 Mathematics Subject Classification: 05B05 Abstract We survey the basic properties and results on Steiner systems S(2, 4, v), as well as open problems. 1 Introduction A Steiner system S(t, k, v) is a pair (V, ) where V is a v-element set and is a family of k-element subsets of V called blocks suchB that each t-element subset of V Bis contained in exactly one block. For basic properties and results on Steiner systems, see [51]. By far the most popular and most studied Steiner systems are those with t = 2 and k = 3, called Steiner triple systems (STS). There exists a very extensive literature on STSs (see, eg., [54] and the bibliography therein). Steiner systems with t = 3 and k =4 are known as Steiner quadruple systems and are commonly abbreviated as SQS; there exist (at least) two extensive surveys on SQSs (see [122], [95]); see also [51]). When t = 2, one often speaks of a Steiner 2-design. Quite a deal of attention has also been paid to the case of Steiner systems S(2, 4, v), but to the best of our knowledge, no survey of known results and problems on these Steiner 2-designs with block size 4 has been published. It is the purpose of this article to fill this gap by bringing together known results and problems on this quite interesting class of Steiner systems.
    [Show full text]
  • Combinatorics of Block Designs and Finite Geometries
    Combinatorics of block designs and finite geometries Sharad S. Sane Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai 76 [email protected] November 10, 2013 Sharad S. Sane (IITB) IASc Talk, Chandigarh 2013 November 10, 2013 1 / 35 A quote from Gian Carlo Rota In the words of Gian Carlo Rota (Preface: Studies in Combinatorics published by the MAA): Block Designs are generally acknowledged to be the most complex structures that can be defined from scratch in a few lines. Progress in understanding and classification has been slow and has proceeded by leaps and bounds, one ray of sunlight being followed by years of darkness. ··· the subject has been made even more mysterious, a battleground of number theory, projective geometry and plain cleverness. This is probably the most difficult combinatorics going on today ::: Sharad S. Sane (IITB) IASc Talk, Chandigarh 2013 November 10, 2013 2 / 35 A quote from Gian Carlo Rota In the words of Gian Carlo Rota (Preface: Studies in Combinatorics published by the MAA): Block Designs are generally acknowledged to be the most complex structures that can be defined from scratch in a few lines. Progress in understanding and classification has been slow and has proceeded by leaps and bounds, one ray of sunlight being followed by years of darkness. ··· the subject has been made even more mysterious, a battleground of number theory, projective geometry and plain cleverness. This is probably the most difficult combinatorics going on today ::: Sharad S. Sane (IITB) IASc Talk, Chandigarh 2013 November 10, 2013 2 / 35 What to expect in this talk? Block designs are (finite) configurations of points and blocks (lines) that satisfy certain additional requirements.
    [Show full text]
  • Symmetric and Unsymmetric Balanced Incomplete Block Designs: a Comparative Analysis
    International Journal of Statistics and Applications 2012, 2(4): 33-39 DOI: 10.5923/j.statistics.20120204.02 Symmetric and Unsymmetric Balanced Incomplete Block Designs: A Comparative Analysis Acha Chigozie Ke lechi Department of Statistics, Michael Okpara University of Agriculture, Umudike, Abia State, Nigeria Abstract This paperdiscusses a comparative analysis on balanced incomplete block designs by using the classical analysis of variance (ANOVA) method. Fortunately, the data collected for the analysis were in two groups of the balanced incomp lete-block designs (BIBD’s), that is, symmetric, and unsymmetric (BIBD’s). In this paper, the basic interest is to apply classical ANOVA on the two types of BIBD’s and check whether they are significant and also minimizes error. A secondary data from N.R.C.R.I, Umudike, Abia State was used. To achieve this, we shall consider treatment (adjusted), block (adjusted) treatment (not adjusted) in the classical ANOVA method on the available data. Though, symmetric balanced incomplete block design (SBIBD) and unsymmetric balanced incomplete block design (USBIBD) are significant, it is pertinent to note that the SBIBD classical ANOVA method is found to be preferable to the USBIBD with reference to their variances at different level of significance. Ke ywo rds Variance, Design, Experiment, Plot, Replication The objective of this study is to check if there is any 1. Introduction significance of the relationship between the variables at 0.01 and 0.05 levels with reference to minimum variance on The basic concepts of the statistical design of experiments th symmetric balanced incomplete block design (SBIBD) and and data analysis were discovered in the early part of the 20 unsymmetric balanced incomplete block design (USBIBD).
    [Show full text]
  • 11 Block Designs
    11 Block Designs Linear Spaces In this section we consider incidence structures = ( ; ; ). By convention, we shall I V B ∼ always let v = and b = . jVj jBj Linear Space: We say that an incidence structure ( ; ; ) is a linear space if every line V B ∼ contains at least two points and every pair of points are contained in exactly one line. Theorem 11.1 (De Bruijn & Erd¨os) For every linear space either b = 1 or b v. Fur- ≥ ther, equality implies that for any two lines there is exactly one point contained in both. Proof: For any point x we let rx denote the number of blocks incident with x and for 2 V any line B we let k` denote the number of points contained in B. Assume there is more 2 B than one line and let x and B satisfy x B. Then rx kB since there are kB lines 2 V 2 B 62 ≥ joining x to the points in B. If we suppose that b v then b(v kB) v(b rx) and thus ≤ − ≥ − X X 1 X X 1 1 = = 1 v(b rx) ≥ b(v kB) x2V B63x − B2B x62B − Now we must have equality in the above equation, so v = b and rx = kB if x B. 62 Designs Designs: Let v; k; t; λ satisfy v k t 0 and λ 1. A t-(v; k; λ) design, also called a ≥ ≥ ≥ ≥ Sλ(t; k; v) is an incidence structure ( ; ; ) which satisfies: V B ∼ (i) = v jVj (ii) B = k for every B .
    [Show full text]
  • Kirkman's Schoolgirls Wearing Hats and Walking Through Fields Of
    ARTICLES Kirkman’s Schoolgirls Wearing Hats and Walking through Fields of Numbers EZRA BROWN Virginia Polytechnic Institute and State University Blacksburg, VA 24061 [email protected] KEITH E. MELLINGER University of Mary Washington Fredericksburg, VA 22401 [email protected] Fifteen young ladies at school Imagine fifteen young ladies at the Emmy Noether Boarding School—Anita, Barb, Carol, Doris, Ellen, Fran, Gail, Helen, Ivy, Julia, Kali, Lori, Mary, Noel, and Olive. Every day, they walk to school in the Official ENBS Formation, namely, in five rows of three each. One of the ENBS rules is that during the walk, a student may only talk with the other students in her row of three. These fifteen are all good friends and like to talk with each other—and they are all mathematically inclined. One day Julia says, “I wonder if it’s possible for us to walk to school in the Official Formation in such a way that we all have a chance to talk with each other at least once a week?” “But that means nobody walks with anybody else in a line more than once a week,” observes Anita. “I’ll bet we can do that,” concludes Lori. “Let’s get to work.” And what they came up with is the schedule in TABLE 1. TABLE 1: Walking to school MON TUE WED THU FRI SAT SUN a, b, e a, c, f a, d, h a, g, k a, j, m a, n, o a, i, l c, l, o b, m, o b, c, g b, h, l b, f, k b, d, i b, j, n d, f, m d, g, n e, j, o c, d, j c, i, n c, e, k c, h, m g, i, j e, h, i f, l, n e, m, n d, e, l f, h, j d, k, o h, k, n j, k, l i, k, m f, i, o g, h, o g, l, m e, f, g TABLE 1 was probably what T.
    [Show full text]
  • Randomized Block Designs
    MATH 4220 Dr. Zeng Student Activity 6: Randomized Block Design, Latin Square, Repeated Latin Square, and Graeco Latin Square Consider the “one-way treatment structure in a completely randomized design structure” experiment. We have “a” treatments, each replicated n times (we consider the balanced case for simplicity). The appropriate means model is Y i 1,2,..., a ij i ij 2 where ij ~ iidN 0, j 1,2,...,n The error terms ij denote the plot to plot variation in the response that cannot be attributed to the treatment effect. The variance 2 is a measure of this variation. If the plots are more alike (homogeneous) then 2 will be low. If the plots are very different from one another 2 will be large. A small 2 enables an experimenter to attribute even small variation in the treatment sample means 2 Y1 ,..,Ya to differences between treatment (population) means ij . In other words, a small results in a more powerful F-test. The reverse is true if 2 is large. Thus, one of the main tasks of an experimenter is to reduce 2 by using homogeneous experimental units. However, one should make sure that such homogeneity does not compromise to applicability of the results. [e.g.: Using white males ages 21-25 in a test of a hair growing formulation will make the results inapplicable to older males and individuals of other races or females. Another way to reduce 2 is by grouping experimented units that are more alike. e.g.: 1) We have two drugs to be tested. Use identical twins, say 5 pairs.
    [Show full text]