Chapter 10 Combinatorial Designs
|
|
- Preston Rich
- 5 years ago
- Views:
Transcription
1 Chapter 10 Combinatorial Designs
2 BIBD Example (a,b,c) (a,b,d) (a,c,e) (a,d,f) (a,e,f) (b,c,f) (b,d,e) (b,e,f) (c,d,e) (c,d,f) Here are 10 subsets of the 6 element set {a, b, c, d, e, f }.
3 BIBD Definition A balanced incomplete block design is a collection of k-subsets, called blocks, of a v-set S, k < v, such that each pair of elements of S occur together in exactly λ of the blocks. Notation (v, k, λ)-bibd or (v, k, λ) design. Alternately, we could say we have a (b, v, r, k, λ)-bibd. b is the number of blocks r is the number of times each element appears in a block
4 Necessary Conditions Theorem In a (v, k, λ) design with b blocks, each element occurs in r blocks such that 1 λ(v 1) = r(k 1) 2 bk = vr
5 Example Existence Show that no (11, 6, 2) design can exist.
6 Example Existence Does a (43, 7, 1)-BIBD exist?
7 Example Example (7, 3, 1)-BIBD
8 Finite Projective Plane Definition A finite projective plane is a (n 2 + n + 1, n + 1, 1) design.
9 Fisher s Inequality Theorem Fisher s Inequality: In any (v, k, λ) design, b v. Definition The incidence matrix of a (v, k, λ) design is a b v matrix A = (a ij ) defined by { 1 if the i a ij = th block contains the j th element 0 otherwise
10 Theorem We Need Theorem If A is a (v, k, λ) design, then A A = (r λ)i + λj where A is the transpose of A, I is the v v identity matrix and J is the v v matrix of all 1 s.
11 Proof of Fisher s Inequality Let A be the incidence matrix. We first show what A A is nonsingular by showing that its determinant is non-zero. Now, A A = r λ λ λ r λ λ λ λ.... λ λ. r Subtract the first row from each of the other rows. = r λ λ λ r r λ 0 λ r 0 r λ λ r 0. r λ
12 Proof of Fisher s Inequality (cont.) Now, add to the first column of the sum of all the other columns. r + (v 1)λ λ λ 0 r λ 0 = 0 0 r λ r λ = [r + λ(v 1)](r λ) v 1 = [r + r(k 1)](r λ) v 1 = rk(r λ) v 1 But, k < v, so by property (1) r > λ, so A A 0, But, A A is a v v matrix, so the rank ρ of A A is ρ(a A) = v. Finally, since ρ(a A) ρ(a) and since ρ(a) b (A has b rows), v ρ(a) b.
13 Existence Example Can a (16, 6, 1) design exist?
14 Complementary Designs Definition Let D be a (b, v, r, k, λ) design on a set S of v elements. Then the complementary design D has as it s blocks the complements S B of the blocks B in D.
15 Complementary Designs Theorem Suppose that D is a (b, v, r, k, λ) design. Then D is a (b, v, b r, v k, b 2r + λ) design provided that b 2r + λ > 0. Why must b 2r + λ > 0?
16 Symmetric Designs Corollary If D is a symmetric (v, k, λ) design with v 2k + λ > 0 then D is a symmetric (v, v k, v 2k + λ) design.
17 Residual Designs Definition The (v 1, v k, r, k λ, λ) design obtained from a symmetric (v, k, λ) design by deleting all elements of one block is called a residual design. Example The residual design created from a (7, 3, 1)-BIBD (1,2,4) (2,3,5) (3,4,6) (4,5,7) (5,6,1) (6,7,2) (7,1,3)
18 Affine Plane Definition A design with the parameters (n 2, n, 1) is called an affine plane of order n. If we can arrange the blocks into groups so that each group contains each element exactly once, we say the design is resolvable.
19 Resolvability Definition A BIBD is resolvable if the blocks can be arranged into v groups so that the ( ) ( b r = v k) blocks of each group are disjoint and contain in their union each element exactly once. The groups are called resolution classes of parallel classes.
20 Kirkman(1850) Fifteen young ladies in a school walk out three abreast for seven days in succession; it is required to arrange them daily so that no two shall walk abreast twice.
21 (4,2,1) Design Suppose we wanted a league schedule for 4 teams where each team played each other team one time. How many weeks do we need? How many total games?
22 The Turning Trick A (2n, 2, 1) design exists for all integers n 1. But this would get tedious to develop for a large league unless we had a trick... If we wanted to construct a league schedule for 8 teams, what would the parameters of the corresponding block design be?
23 The Turning Trick
24 The Turning Trick
25 The Turning Trick
26 Back to the (4,2,1) Design We can go backwards from the residual design idea to build finite projective planes. These constructions show that affine planes of order n exist iff finite projective planes of order n exist. There is also a correspondence with...
27 Latin Squares Definition A Latin square on n symbols is an n n array such that each of the n symbols occurs exactly once in each row and in each column. The number n is called the order of the square. Example A B C D D A B C C D A B B C D A
28 Latin Squares and League Schedules Suppose a league schedule has been arranged for 2n teams in 2n 1 rounds. Then, define a 2n 2n array A = (a ij ) by a ii = n, a ij = k i j where the i th and j th teams play in round k. Since each team plays precisely one game per round, A is a Latin square.
29 Latin Squares and League Schedules Example Construct a Latin square of order 2n from a league schedule on 8 teams
30 MOLS So just how many Latin squares are there of order n, up to labeling? Is there just one of each order? [ Order 2 ] Order
31 MOLS Order
32 MOLS Definition Join (A, B) is the n n array where the i, j th entry is (a ij, b ij ) where a ij A and b ij B. These two Latin squares are called mutually orthogonal. For short, we say MOLS. For n 4, the MOLS are pairwise orthogonal.
33 MOLS Definition A complete set of MOLS of order n consists of n 1 pairwise orthogonal Latin squares. Notation: Number of MOLS of order n is given by N(n).
34 MOLS Definition A complete set of MOLS of order n consists of n 1 pairwise orthogonal Latin squares. Notation: Number of MOLS of order n is given by N(n). Theorem For all numbers n 3, N(n) 2, except for N(6) = 1.
35 MOLS Theorem N(n) 2 whenever n is odd, n 3.
36 MOLS Example Example Construct 2 MOLS of order 3.
37 MOLS Example Example Construct 2 MOLS of order 5.
38 Moore-MacNeish Theorem Moore-MacNeish: N(mn) min{n(m), N(n)} Corollary N(n) min{p α i i }-1
39 Latin Squares and Finite Projective Planes Theorem An affine plane of order n exists iff a finite projective plane of order n iff n 1 MOLS of order n exists.
40 Construction Example Construct an affine plane of order 4 from the three MOLS of order 4.
41 Initial Designs Definition A (cyclic) (v, k, λ) difference set (mod v) is a set D = {d 1, d 2,..., d k } of distinct elements of Z v such that each non-zero d Z v can be expressed in the form d = d i d j in precisely λ ways.
42 Back to the (7,3,1) Design Example {1, 2, 4} is a (7, 3, 1) difference set.
43 Justification Why is it that the design we will obtain will be balanced?
44 Translates Definition If D = {d 1, d 2,..., d k } is a (v, k, λ) difference set mod v) then the set D + A = {d 1 + a, d 2 + a,..., d k + A} is called a translate of D. Theorem If D = {d 1, d 2,..., d k } is a cyclic (v, k, λ) difference set then the translates D, D + 1,..., D + (v 1) are the blocks of a symmetric (v, k, λ) design.
45 Translate Example Example We will illustrate this with our {1, 2, 4} difference set.
46 Another Example Example Verify that {1, 2, 4, 10} is a (13,4,1) difference set in Z 13.
47 Another Example Example Verify that {1, 3, 4, 5, 9}(mod 11) yields a (11,5,2) design.
48 Difference Sets in Groups Other Than Z v Definition A (v, k, λ) difference set in an additive abelian group G of order v is a set D = {d 1, d 2,..., d k } of distinct elements of G such that each non-zero element g G has exactly λ representations as g = d i d j.
49 How The Example Gives a Design We can obtain the translates in the same manner, but how does this give us a (16,6,2) design?
50 Difference Systems Definition Let D 1,..., D t be sets of size k in an additive abelian group G of order v such that the differences arising from the D i give each non-zero element of G exactly λ times. The D 1,..., D t are said to form a (v, k, λ) difference system in G. Note: the D i need not be disjoint.
51 Difference System Example Example Show that {1, 2, 5},{1, 3, 9} form a (13,3,1) difference system in Z 13. Important: the differences are only taken within blocks.
52 Starters Definition A starter in an abelian group G of order 2n 1 is a set of n 1 unordered pairs {x 1, y 1 },..., {x n 1, y n 1 } of elements of G such that i. x 1, y 1,..., x n 1, y n 1 are precisely all the non-zero elements of G ii. ±(x 1 y 1 ),..., ±(x n 1 y n 1 ) are precisely the non-zero elements of G
53 Example of a Starter Example The pairs {1, 2}, {4, 8}, {5, 10}, {9, 7}, {3, 6} form a starter in Z 11.
54 Whist Tournaments Difference systems can also be used to construct whist tournaments. Definition A whist tournament, denoted Wh(4n), on 4n players is a schedule of games involving two players against two others, such that: (i) the games are arranged in 4n 1 rounds, each of n games (ii) each player plays in exactly one game each round (iii) each player partners every other player exactly once (iv) each player opposes every other player exactly twice Example Construct a Wh(4).
55 Example of Whist Tournament Example Verify that,0 v 4,5 1,10 v 2,8 3,7 v 6,9 is the initial round of a cyclic Wh(12).
Introduction to Block Designs
School of Electrical Engineering and Computer Science University of Ottawa lucia@eecs.uottawa.ca Winter 2017 What is Design Theory? Combinatorial design theory deals with the arrangement of elements into
More information11 Block Designs. Linear Spaces. Designs. By convention, we shall
11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationCombinatorial Designs: Balanced Incomplete Block Designs
Combinatorial Designs: Balanced Incomplete Block Designs Designs The theory of design of experiments came into being largely through the work of R.A.Fisher and F.Yates in the early 1930's. They were motivated
More informationTopics Related to Combinatorial Designs
Postgraduate notes 2006/07 Topics Related to Combinatorial Designs 1. Designs. A combinatorial design D consists of a nonempty finite set S = {p 1,..., p v } of points or varieties, and a nonempty family
More informationBALANCED INCOMPLETE BLOCK DESIGNS
BALANCED INCOMPLETE BLOCK DESIGNS V.K. Sharma I.A.S.R.I., Library Avenue, New Delhi -110012. 1. Introduction In Incomplete block designs, as their name implies, the block size is less than the number of
More informationLatin Squares and Orthogonal Arrays
School of Electrical Engineering and Computer Science University of Ottawa lucia@eecs.uottawa.ca Winter 2017 Latin squares Definition A Latin square of order n is an n n array, with symbols in {1,...,
More informationLINEAR SPACES. Define a linear space to be a near linear space in which any two points are on a line.
LINEAR SPACES Define a linear space to be a near linear space in which any two points are on a line. A linear space is an incidence structure I = (P, L) such that Axiom LS1: any line is incident with at
More informationBalanced Nested Designs and Balanced n-ary Designs
Balanced Nested Designs and Balanced n-ary Designs Ryoh Fuji-Hara a, Shinji Kuriki b, Ying Miao a and Satoshi Shinohara c a Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki
More informationA three-factor product construction for mutually orthogonal latin squares
A three-factor product construction for mutually orthogonal latin squares Peter J. Dukes (joint work with Alan C.H. Ling, UVM) June 17, 2014 Introduction Latin squares and MOLS Product construction Main
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationExistence of doubly near resolvable (v, 4, 3)-BIBDs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 109 124 Existence of doubly near resolvable (v, 4, 3)-BIBDs R. Julian R. Abel Nigel H. N. Chan School of Mathematics and Statistics University
More informationNew quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices Carl Bracken, Gary McGuire Department of Mathematics, National University of Ireland, Maynooth, Co.
More informationAnale. Seria Informatică. Vol. XII fasc Annals. Computer Science Series. 12 th Tome 2 nd Fasc. 2014
Anale. Seria Informatică. Vol. XII fasc. 2 24 Annals. Computer Science Series. 2 th Tome 2 nd Fasc. 24 49 AN ALGORITHM FOR CONSTRUCTING SYMMETRIC ((r+)v, kr, kλ) BIBDs FROM AFFINE RESOLVABLE (v, b, r,
More informationMutually Orthogonal Latin Squares: Covering and Packing Analogues
Squares: Covering 1 1 School of Computing, Informatics, and Decision Systems Engineering Arizona State University Mile High Conference, 15 August 2013 Latin Squares Definition A latin square of side n
More informationOn the Classification of Splitting (v, u c, ) BIBDs
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 18, No 5 Special Thematic Issue on Optimal Codes and Related Topics Sofia 2018 Print ISSN: 1311-9702; Online ISSN: 1314-4081
More informationEven Famous Mathematicians Make Mistakes!
Even Famous Mathematicians Make Mistakes! Hannah Horner May 2016 Contents 1 Abstract 2 2 Introduction 2 3 Latin Squares and MOLS 2 3.1 Growing Strawberries............................... 2 3.2 MOLS.......................................
More information3360 LECTURES. R. Craigen. October 15, 2016
3360 LECTURES R. Craigen October 15, 2016 Introduction to designs Chapter 9 In combinatorics, a design consists of: 1. A set V elements called points (or: varieties, treatments) 2. A collection B of subsets
More informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More informationMutually Pseudo-orthogonal Latin squares, difference matrices and LDPC codes
Mutually Pseudo-orthogonal Latin squares, difference matrices and LDPC codes Asha Rao (Joint Work with Diane Donovan, Joanne Hall and Fatih Demirkale) 8th Australia New Zealand Mathematics Convention Melbourne
More information--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES
ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are
More informationGroup Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration
Group Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration Spencer P. Hurd Nutan Mishra and Dinesh G. Sarvate Abstract. We present constructions and results about GDDs with
More informationThe Pennsylvania State University The Graduate School ORTHOGONALITY AND EXTENDABILITY OF LATIN SQUARES AND RELATED STRUCTURES
The Pennsylvania State University The Graduate School ORTHOGONALITY AND EXTENDABILITY OF LATIN SQUARES AND RELATED STRUCTURES A Dissertation in Mathematics by Serge C. Ballif c 2012 Serge C. Ballif Submitted
More informationFRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES
FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most
More information1. A brief introduction to
1. A brief introduction to design theory These lectures were given to an audience of design theorists; for those outside this class, the introductory chapter describes some of the concepts of design theory
More informationA Latin Square of order n is an n n array of n symbols where each symbol occurs once in each row and column. For example,
1 Latin Squares A Latin Square of order n is an n n array of n symbols where each symbol occurs once in each row and column. For example, A B C D E B C A E D C D E A B D E B C A E A D B C is a Latin square
More informationarxiv: v1 [math.co] 27 Jul 2015
Perfect Graeco-Latin balanced incomplete block designs and related designs arxiv:1507.07336v1 [math.co] 27 Jul 2015 Sunanda Bagchi Theoretical Statistics and Mathematics Unit Indian Statistical Institute
More informationOverview of some Combinatorial Designs
Bimal Roy Indian Statistical Institute, Kolkata. Outline of the talk 1 Introduction 2 3 4 5 6 7 Outline of the talk 1 Introduction 2 3 4 5 6 7 Introduction Design theory: Study of combinatorial objects
More informationSystems of distinct representatives/1
Systems of distinct representatives 1 SDRs and Hall s Theorem Let (X 1,...,X n ) be a family of subsets of a set A, indexed by the first n natural numbers. (We allow some of the sets to be equal.) A system
More informationChapter 1. Latin Squares. 1.1 Latin Squares
Chapter Latin Squares. Latin Squares Definition... A latin square of order n is an n n array in which n distinct symbols are arranged so that each symbol occurs exactly once in each row and column. If
More informationSplittable Whist Tournament Designs
Splittable Whist Tournament Designs 1 David R. Berman Department of Computer Science University of North Carolina Wilmington Wilmington, NC 28403 bermand@uncw.edu Norman J. Finizio Department of Mathematics
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationA method for constructing splitting (v,c u, ) BIBDs. Stela Zhelezova Institute of Mathematics and Informatics, BAS
A method for constructing splitting (v,c u, ) BIBDs Stela Zhelezova Institute of Mathematics and Informatics, BAS Motivation T O m = e(s) a model of G.J.Simmons, 1982 R 3-splitting (2,7,7) A-code (S,M,E)
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationSome V(12,t) vectors and designs from difference and quasi-difference matrices
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 4 (28), Pages 69 85 Some V(12,t) vectors and designs from difference and quasi-difference matrices R Julian R Abel School of Mathematics and Statistics University
More informationSTRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES
The Pennsylvania State University The Graduate School Department of Mathematics STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES A Dissertation in Mathematics by John T. Ethier c 008 John T. Ethier
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationConstruction of balanced sports schedules with subleagues
Construction of balanced sports schedules with subleagues 1 A. Geinoz, T. Ekim, D. de Werra Ecole Polytechnique Fédérale de Lausanne, ROSE, CH-1015 Lausanne, Switzerland, e-mails: alexandre.geinoz, tinaz.ekim,
More informationConstruction of Pair-wise Balanced Design
Journal of Modern Applied Statistical Methods Volume 15 Issue 1 Article 11 5-2016 onstruction of Pair-wise Balanced Design Rajarathinam Arunachalam Manonmaniam Sundaranar University, arrathinam@yahoo.com
More informationGeneralizing Clatworthy Group Divisible Designs. Julie Rogers
Generalizing Clatworthy Group Divisible Designs by Julie Rogers A dissertation submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Doctor
More informationThe upper bound of general Maximum Distance Separable codes
University of New Brunswick Saint John Faculty of Science, Applied Science, and Engineering Math 4200: Honours Project The upper bound of general Maximum Distance Separable codes Svenja Huntemann Supervisor:
More informationPALINDROMIC AND SŪDOKU QUASIGROUPS
PALINDROMIC AND SŪDOKU QUASIGROUPS JONATHAN D. H. SMITH Abstract. Two quasigroup identities of importance in combinatorics, Schroeder s Second Law and Stein s Third Law, share many common features that
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More informationWilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes
Wilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes Steiner systems S(2, k, v) For k 3, a Steiner system S(2, k, v) is usually defined as a pair (V, B), where V is a set
More informationON THE CONSTRUCTION OF ORTHOGONAL BALANCED INCOMPLETE BLOCK DESIGNS
Hacettepe Journal of Mathematics and Statistics Volume 35 (2) (2006), 235 240 ON THE CONSTRUCTION OF ORTHOGONAL BALANCED INCOMPLETE BLOCK DESIGNS Hülya Bayrak and Hanife Bulut Received 20 : 02 : 2006 :
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationProperties and Classification of the Wheels of the OLS Polytope.
Properties and Classification of the Wheels of the OLS Polytope. G. Appa 1, D. Magos 2, I. Mourtos 1 1 Operational Research Department, London School of Economics. email: {g.appa, j.mourtos}@lse.ac.uk
More informationCONSTRUCTION OF RECTANGULAR PBIB DESIGNS
Journal of Scientific Research Vol. 55, 2011 : 103-110 Banaras Hindu University, Varanasi ISSN : 0447-9483 CONSTRUCTION OF RECTANGULAR PBIB DESIGNS Hemant Kr. Singh *, J.S. Parihar **, R.D. Singh * & Vipul
More informationIMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationEnergy of Graphs. Sivaram K. Narayan Central Michigan University. Presented at CMU on October 10, 2015
Energy of Graphs Sivaram K. Narayan Central Michigan University Presented at CMU on October 10, 2015 1 / 32 Graphs We will consider simple graphs (no loops, no multiple edges). Let V = {v 1, v 2,..., v
More informationE(s 2 )-OPTIMAL SUPERSATURATED DESIGNS
Statistica Sinica 7(1997), 929-939 E(s 2 )-OPTIMAL SUPERSATURATED DESIGNS Ching-Shui Cheng University of California, Berkeley Abstract: Tang and Wu (1997) derived a lower bound on the E(s 2 )-value of
More informationThe Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More informationBlocks are formed by grouping EUs in what way? How are experimental units randomized to treatments?
VI. Incomplete Block Designs A. Introduction What is the purpose of block designs? Blocks are formed by grouping EUs in what way? How are experimental units randomized to treatments? 550 What if we have
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationRegular graphs with a small number of distinct eigenvalues
Regular graphs with a small number of distinct eigenvalues Tamara Koledin UNIVERZITET U BEOGRADU ELEKTROTEHNIČKI FAKULTET This is joint work with Zoran Stanić Bipartite regular graphs Bipartite regular
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationLecture 1: Latin Squares!
Latin Squares Instructor: Paddy Lecture : Latin Squares! Week of Mathcamp 00 Introduction Definition. A latin square of order n is a n n array, filled with symbols {,... n}, such that no symbol is repeated
More informationAdditional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs
Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs Colleen M. Swanson Computer Science & Engineering Division University of Michigan Ann Arbor, MI 48109,
More informationPAIRED COMPARISON DESIGNS FOR TESTING CONCORDANCE BE.'TWEEN JUDGES
PARED COMPARSON DESGNS FOR TESTNG CONCORDANCE BE.'TWEEN JUDGES by R. C. Bose University of North Carolina and Division ot Research Techniques, London School of Economics and Political Sciences This research
More informationApprentice Linear Algebra, 1st day, 6/27/05
Apprentice Linear Algebra, 1st day, 6/7/05 REU 005 Instructor: László Babai Scribe: Eric Patterson Definitions 1.1. An abelian group is a set G with the following properties: (i) ( a, b G)(!a + b G) (ii)
More informationIncidence Structures Related to Difference Sets and Their Applications
aòµ 05B30 ü èµ Æ Òµ 113350 Æ Æ Ø Ø K8: 'u8'é(9ùa^ = Ø K8: Incidence Structures Related to Difference Sets and Their Applications úôœææ Æ Ø ž
More information1 I A Q E B A I E Q 1 A ; E Q A I A (2) A : (3) A : (4)
Latin Squares Denition and examples Denition. (Latin Square) An n n Latin square, or a latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row
More informationOrthogonal Arrays & Codes
Orthogonal Arrays & Codes Orthogonal Arrays - Redux An orthogonal array of strength t, a t-(v,k,λ)-oa, is a λv t x k array of v symbols, such that in any t columns of the array every one of the possible
More informationA CLASS OF MAJORITY GAMES
A CLASS OF MAJORITY GAMES By J. R. ISBELL {Washington, D.C.) [Reoeived 16 December 1955] THIS paper is concerned with the description of a class of combinatorial objects, the weighted majority games of
More informationMAS334 Combinatorics Autumn Semester Lecture Notes and Example Sheets
MAS334 Combinatorics Autumn Semester 2018-2019 Lecture Notes and Example Sheets Contents Chapter 1. The Binomial Coefficients 5 Chapter 2. Three Basic Principles 11 1. Parity 11 2. The Pigeon-Hole Principle
More informationAlgebraic aspects of Hadamard matrices
Algebraic aspects of Hadamard matrices Padraig Ó Catháin University of Queensland 22 February 2013 Overview Difference set Relative difference set Symmetric Design Hadamard matrix Overview 1 Hadamard matrices
More informationConstruction of Mixed-Level Orthogonal Arrays for Testing in Digital Marketing
Construction of Mixed-Level Orthogonal Arrays for Testing in Digital Marketing Vladimir Brayman Webtrends October 19, 2012 Advantages of Conducting Designed Experiments in Digital Marketing Availability
More informationA new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L
More informationMUTUALLY ORTHOGONAL LATIN SQUARES AND THEIR USES
MUTUALLY ORTHOGONAL LATIN SQUARES AND THEIR USES LOKESH DWIVEDI M.Sc. (Agricultural Statistics), Roll No. 449 I.A.S.R.I., Library Avenue, New Delhi 0 02 Chairperson: Dr. Cini Varghese Abstract: A Latin
More informationCS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:
CS100: DISCRETE STRUCTURES Lecture 3 Matrices Ch 3 Pages: 246-262 Matrices 2 Introduction DEFINITION 1: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n
More informationMutually orthogonal latin squares (MOLS) and Orthogonal arrays (OA)
and Orthogonal arrays (OA) Bimal Roy Indian Statistical Institute, Kolkata. Bimal Roy, Indian Statistical Institute, Kolkata. and Orthogonal arrays (O Outline of the talk 1 Latin squares 2 3 Bimal Roy,
More informationOn generalized Howell designs with block size three
On generalized Howell designs with block size three R. Julian R. Abel Robert F. Bailey Andrea C. Burgess Peter Danziger Eric Mendelsohn November 2, 2015 Abstract In this paper, we examine a class of doubly
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationA Tutorial on Orthogonal Arrays: Constructions, Bounds and Links to Error-correcting Codes
A Tutorial on Orthogonal Arrays: onstructions, ounds and Links to Error-correcting odes Douglas R. Stinson David R. heriton School of omputer Science University of Waterloo D.R. Stinson 1 Talk Outline
More informationCombinatorial Group Testing for DNA Library Screening
0-0 Combinatorial Group Testing for DNA Library Screening Ying Miao University of Tsukuba 0-1 Contents 1. Introduction 2. An Example 3. General Case 4. Consecutive Positives Case 5. Bayesian Network Pool
More informationMa/CS 6a Class 28: Latin Squares
Ma/CS 6a Class 28: Latin Squares By Adam Sheffer Latin Squares A Latin square is an n n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. 1
More informationNew Lower Bounds for the Number of Blocks in Balanced Incomplete Block Designs
New Lower Bounds for the Number of Blocs in Balanced Incomplete Bloc Designs MUHAMMAD A KHAN ABSTRACT: Bose [1] proved the inequality b v+ r 1 for resolvable balanced incomplete bloc designs (RBIBDs) and
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationNew Constructions of Difference Matrices
New Constructions of Difference Matrices Department of Mathematics, Simon Fraser University Joint work with Koen van Greevenbroek Outline Difference matrices Basic results, motivation, history Construction
More informationFinite Mathematics. Nik Ruškuc and Colva M. Roney-Dougal
Finite Mathematics Nik Ruškuc and Colva M. Roney-Dougal September 19, 2011 Contents 1 Introduction 3 1 About the course............................. 3 2 A review of some algebraic structures.................
More informationNordhaus-Gaddum Theorems for k-decompositions
Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between
More informationLecture 6: Geometry of OLS Estimation of Linear Regession
Lecture 6: Geometry of OLS Estimation of Linear Regession Xuexin Wang WISE Oct 2013 1 / 22 Matrix Algebra An n m matrix A is a rectangular array that consists of nm elements arranged in n rows and m columns
More informationA Short Overview of Orthogonal Arrays
A Short Overview of Orthogonal Arrays John Stufken Department of Statistics University of Georgia Isaac Newton Institute September 5, 2011 John Stufken (University of Georgia) Orthogonal Arrays September
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationDesign Theory Notes 1:
----------------------------------------------------------------------------------------------- Math 6023 Topics in Discrete Math: Design and Graph Theory Fall 2007 ------------------------------------------------------------------------------------------------
More informationTheorems of Erdős-Ko-Rado type in polar spaces
Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More informationSets of MOLSs generated from a single Latin square
Sets of MOLSs generated from a single Latin square Hau Chan and Dinesh G Sarvate Abstract The aim of this note is to present an observation on the families of square matrices generated by repeated application
More informationThe collection of all subsets of cardinality k of a set with v elements (k < v) has the
Chapter 7 Block Designs One simile that solitary shines In the dry desert of a thousand lines. Epilogue to the Satires, ALEXANDER POPE The collection of all subsets of cardinality k of a set with v elements
More informationStatistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006
Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006 Topics What is a set? Notations for sets Empty set Inclusion/containment and subsets Sample spaces and events Operations
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationERROR-CORRECTING CODES AND LATIN SQUARES
ERROR-CORRECTING CODES AND LATIN SQUARES Ritu Ahuja Department of Mathematics, Khalsa College for Women, Civil Lines, Ludhiana 141001, Punjab, (India) ABSTRACT Data stored and transmitted in digital form
More information2 Equivalence Relations
2 Equivalence Relations In mathematics, we often investigate relationships between certain objects (numbers, functions, sets, figures, etc.). If an element a of a set A is related to an element b of a
More informationTransversals in Latin Squares
Transversals in Latin Squares Ian Wanless Monash University Australia Loops 07 workshop, Prague, Aug 2007 A latin square of order n is an n n matrix in which each of n symbols occurs exactly once in each
More informationCombinatorial Design Theory 1
Combinatorial Design Theory 1 Chris Godsil c 2010 1 version: April 9, 2010 ii Preface This course is an introduction to combinatorial design theory. iii iv Contents Preface iii 1 Block Designs 1 1.1 Definitions...............................
More information