Construction of Partially Balanced Incomplete Block Designs

Size: px
Start display at page:

Download "Construction of Partially Balanced Incomplete Block Designs"

Transcription

1 International Journal of Statistics and Systems ISS Volume, umber (06), pp Research India Publications Construction of Partially Balanced Incomplete Block Designs Jyoti Sharma, D. K. Ghosh and Jagdish Prasad 3 Centre for Mathematical Sciences, Banasthali University, Rajasthan, India. Department of Statistics, Saurashtra University, Rajkot, India. 3 School of Applied Sciences, Amity University Rajasthan, Jaipur, India. sharmajyoti09@gmail.com, 3 jprasad@jpr.amity.edu Abstract In this paper, some series of BIB and PBIB designs have been constructed using either Semi-Regular Group Divisible Designs or Regular Group Divisible Designs along with its corresponding group. Keywords: Association Scheme, Balanced incomplete block designs, Partially balanced incomplete block designs, group and Group Divisible designs.. Introduction Yates (936) introduced the concept of BIBD. BIBD is an arrangement of v treatments into b blocks each of k (<v) treatments, satisfying the following conditions:. Every treatment occurs at most once in each block.. Every treatment occurs in exactly r blocks. 3. Every pair of treatment occurs together in exactly blocks. A BIBD is said to be symmetrical if v=b and r=k. The terms v, b, r, k, are known as the parameters of BIBD. In this design we can estimate all possible treatment contrast with the same precision. The rich contribution of BIBD is mainly by Fisher (940, 94), Fisher and Yates (963) or Bose ( ). A BIBD is said to be resolvable if the b blocks are grouped into r classes of n blocks each, such that each class forms a complete replication of all the v treatments and each class however contains b / r blocks. BIBD are not available for every parametric combination. Also even if a BIBD exists for a given no. of treatments (v) and block size (k), it may require too many replications. To overcome this problem, Bose and

2 68 Jyoti Sharma et al air (939) introduced a class of binary, equi-replicate and proper designs, which we called PBIBD with m-associate classes. Bose and Shimamoto (95), air and Rao (94) have also contributed to the theory of PBIBD. A PBIBD with two associate classes is an arrangement of v treatments in b blocks such that:. Each of the v treatments is replicated r times in b blocks each of size k (k < v), and no treatments appears more than once in any block.. There exists a relationship of association between every pair of the v treatments satisfying the following conditions: a. Any two treatments are either first or second associates. b. Each treatment has exactly n i ith associates (i=, ). c. Given any two treatments which are i th associates, the number of treatments common to the j th associate of the first and k th associate of the second is p i jk and is independent of the pair of treatments. Also p i jk=p i kj, i, j, k=,. 3. Any pair of treatments which are i th associate occur together in exactly i blocks for i=,. air and Rao (94) modified the original definition of PBIB designs. For m=, Bose and Shimamoto (95) classified the known PBIB designs into () Group Divisible (GD), () Simple (S.I), (3) Triangular (T), (4) Latin Square Type (L i ) and (5) Cyclic Designs. A group divisible design is an arrangement of v=mn treatments into b blocks such that each block contains k(<v) distinct treatments which are partitioned into m( ) groups of n( ) treatments each, further any two distinct treatments occurring together in blocks if they belong to the same group, and in blocks if they belong to different groups. A group divisible design is classified into ) Singular Group Divisible Design ) Semi-Regular Group Divisible Design 3) Regular Group Divisible Design. A Group Divisible Design is said to be Singular Group Divisible Design if r- =0, a Group Divisible Design is said to be Semi-Regular Group Divisible Design if r- >0 and rk-v =0, and a Group Divisible Design is said to be Regular Group Divisible Design if r- >0 and rk-v >0. In this paper, we have discussed the method of construction of BIBD and PBIBD using GD design along with their corresponding group.. Method of Construction Let us consider a group (m,n) of a GD design, where v=mn treatments arranged in m groups of n treatments each. For an example: consider a Group (, ). ow this group

3 Construction of Partially Balanced Incomplete Block Designs 69 (, ) is expressed as an arrangement of in groups of treatments each. Let us call this group as design d, that is, d = Here the incidence matrix and concurrence matrix of d is denoted by, and which are as follows: = = Remark: If the same group is repeated p-times then is expressed as Im Im = p (.) I m... Im Where, an identity matrix I m is repeated n times in rows and m times in columns. Further consider a GD design with parameters v, b, r, k, m, n,,. ext add the corresponding group (m, n) to this GD design, which gives either resolvable BIBD or PBIBD according to its parameters. Case.: RGD designs from SRGD designs: Theorem.: If there exists a SRGD design with parameters v, b, r, k, m, n,, for which n=k, then a RGD design with parameters v=v, b=b +m, r=r +, k=k, = +, = always exists. Proof: Consider a SRGD design with parameters v, b, r, k, m, n,, whose incidence matrix is denoted by. ext add the corresponding group to this design and let the incidence matrix of the group is. ow we define the incidence matrix of resulting design which is given by, [ ] v b = ext the concurrence matrix of this design is as follows: = [ ] = [ + ] (.) Here we will obtain and separately. Since is the incidence matrix of SRGD and hence can be expressed as

4 70 Jyoti Sharma et al = r r r. r and = , ow using (.), is expressed as r + + r r = r (.3) Here all diagonal elements are same, that is, (r + ) and off diagonal elements are and ( + ). Hence we can say is the incidence matrix of a PBIB design with parameters v=v, b=b +m, r=r +, k=k, = +, =. Further we verified that r- >0 and (rk-v ) > 0 holds true and hence design is RGD. Example.: Consider SR with parameters v=4, r=4, k=, b=8, m=, n=, = 0, = with corresponding group (, ), whose blocks are as follows: ow by adding the group to this design we obtain another design whose blocks are, Which is a RGD design with parameters v=4, r=5, k=, b=0, n =, n =, m=, n=, = 0, =. This design is listed as R-3 in the Clatworthy (973).

5 Construction of Partially Balanced Incomplete Block Designs 7 Case.: RGD designs from RGD design. Theorem.: If there exists a RGD design with parameters v, b, r, k, m, n,, for which n=k, then a RGD design with parameters v=v, b=b +m, r=r + p, k=k, = + p, = always exists, where, p is the number of times a group is repeated. Proof: On the similar lines of theorem.. Example.: Consider a RGD design (R-) with parameters v=4, r=4, k=, b=8, m=, n=, =, = along with its group (, ), whose blocks are as follows: ow with this design, add its group (, ). we have another design whose blocks are, The resulting design is a RGD with parameters v=4, r=5, k=, b=0, m=, n=, = 3, = which is reported as R- in Clatworthy(973). Case.3: RGD design from a resolvable BIBD. Theorem.3: If there exists a resolvable BIBD with parameters v =s, b =s(s+), r =s+, k =s, =, then by adding a group (m, n) for which n=k, we obtained a RGD design with parameters v=v, b=b + m, r=r +, k=k, m*=m, n*=n, =+, =. Proof: consider a resolvable BIBD with parameters v =s, b = s( s + ), r =s+, k =s, = and let the incidence matrix of this design is denoted by. ext add the group (m, n) to this resolvable BIBD. Let the incidence matrix of group is. ow we define the incidence matrix of resulting design which is given by [ ] v b = ext the concurrence matrix of this design is as follows: = [ ] = [ + ] (.4) r + + r r + Hence = (.5). +. r + Here all diagonal elements are same, that is, (r + ) and off diagonal elements are of two types which are + = and =. Hence we can say is the incidence matrix of

6 7 Jyoti Sharma et al a PBIB design with parameters v=v, b=b + m, r=r +, k=k, m*=m, n*=n, =+, =. Further we verified that r- >0 and (rk-v ) > 0 holds true and hence the resulting design is RGD. Example.3: If we substitute s=3 in the above theorem, then a resolvable BIBD with parameters v=9, b=, r=4, k=3, = is considered, which is as follows: ow by adding the design of group (3, 3) to this BIBD we obtained the following design: The resulting design is RGD with parameters v=9, b=5, r=5, k=3,, =, = reported as R-59 in Clatworthy(973). Corollary.: If there exists a GD design with parameters v, b, r, k, m, n,,, then a resolvable BIBD exists provided =. Proof: Consider either a SRGD or RGD design such that n=k and let the incidence matrix of this design is denoted by. ext add the corresponding group to this design and let the incidence matrix of the group is. ow we add to and then we have the incidence matrix of resulting design is given by = [ ] ext the concurrence matrix of this design is as follows: r + + r r = r Here all the diagonal elements are r +, that is, r=r +. Further off-diagonal elements are either = or = +. Since it is given that = =, and r=r + and hence becomes the concurrence matrix of a BIBD. Example.4: Consider a SRGD design(sr-) with parameters v=4, r=, k=, b=4, m=, n=,, = 0, =,whose blocks are as follows:

7 Construction of Partially Balanced Incomplete Block Designs ow by adding the group (,) to the above design we have another design whose blocks are, This gives the blocks of resolvable BIBD. Therefore the resulting design is a resolvable BIBD with parameters v=4, r=3, k=, b=6, =. Table. SRGD used to construct BIBD Parameters of SRGD Parameters of resulting BIBD S.. v r k b m n Group v r k b Design SR (,) BIBD SR (3,3) BIBD SR (,4) BIBD SR (4,4) BIBD SR (5,5) BIBD SR (,6) 6 5 BIBD SR (7,7) BIBD SR (8,8) BIBD SR (9,9) BIBD SRGD used to construct PBIBD Parameters of SRGD Group Parameters of resulting PBIBD Design S.. v r k b m n v r k b SR (,) R-3 SR (,) R-7 SR (,) R-3 SR (,) 4 5 RGD* SR (3,3) R-6 SR (3,3) R-68 SR (4,4) R- SR (5,5) RGD* RGDs by which BIBD is obtained Parameters of RGD Group Parameters of resulting BIBD v r k b m n Λ v r k b Design R (,) 4 6 BIBD R (,) BIBD

8 74 Jyoti Sharma et al R (3,) BIBD R (3,) BIBD R (4,) BIBD R (5,) BIBD R (6,) 66 BIBD R (,3) BIBD R (3,3) BIBD RGDs through which PBIBD is obtained Design Parameters of RGD Group Parameters of resulting PBIBD v r k b m n Λ v r k b R (,) R- R (,) R-4 R (,) R-5 R (,) R-8 R (,) R-9 R (,) R-0 R (,) R- R (,) R- R (,) R-4 R (,) R-5 R (,) R-7 R (,) 4 9 RGD* R (,) 4 7 RGD* R (,) RGD* R (,) RGD* R (3,) R- R (3,) R- R (3,) R-6 R (3,) R-7 R (3,) R-8 R (3,) RGD* R (4,) R-3 R (4,) R-33 R (5,) RGD* R (,3) R-45 R (,3) R-47 R (,3) R-49 R (,3) R-53 R (,3) RGD* R (3,3) R-60 R (3,3) R-6 R (3,3) R-63

9 Construction of Partially Balanced Incomplete Block Designs 75 R (3,3) R-64 R (3,3) R-66 R (3,3) R-67 R (3,3) RGD* R (3,3) RGD* R (3,3) RGD* R (4,3) R-78 R (5,3) R-84 R (5,3) RGD* R (,4) R-00 R (4,4) R-0 R (4,4) R- R (4,4) R-3 R (4,4) RGD* R (7,4) RGD* R (5,5) R-57 R (5,5) R-58 R (5,5) RGD* R (7,7) RGD* Indicates design is not listed as r,k>0 References [] Bose, R. C. (939) On the Construction of Balanced Incomplete Block Designs. Annals of Eugenics, Vol. 9 (939), pp [] R. C. Bose (95), Partially balanced incomplete block d esigns with two associate classes involving only two replications, Calcutta Statistical Association Bulletin 3, 0. [3] Bose, R.C. and Connor, W.S.(95). Combinatorial properties of group divisible incomplete block designs. Ann. Math. Statist., 3, [4] Bose, R.C. and air, K.R. (939) Partially Balanced Incomplete Block Designs. Sankhya. 4, [5] Bose, R.C. and Shimamoto, T. (95) Classification and Analysis of Partially Balanced Incomplete Block Designs with two Associate Classes. J. Amer. Statist. Assoc., 47, [6] Clatworthy W. H. (973) Tables of Two-Associates-Class Partially Balanced Designs. BS Applied Mathematics Series 63, Washington, Dc. [7] Dey, A. (986) Theory of Block Designs. Willey Eastern. [8] Das, M.. and Giri,.C. (986) Design and Analysis of Experiments. Wiley Eastern Limited, ew Delhi. [9] Fisher, R.A. (940) An examination of the different possible solutions of a problem in incomplete blocks. Ann. Eugen., Lond.,

10 76 Jyoti Sharma et al [0] Fisher R.A. (94). The theory of confounding in factorial experiments in relation to the theory of groups. Ann. Eugenics,, [] Fisher, R.A. and Yates, F.(963). Statistical Tables for Biological, Agricultural and Medical Resuarch, Sixth edition, Oliver and Boyd, Edinburgh [] air, K. R. and Rao, C. R. (94) A ote on Partially Balanced Incomplete Block Designs. Science and Culture, 7, [3] Raghavarao, D. (970). Constructions and Combinatorial Problems in Design of Experiments. Willey, ew York. [4] Yates, F. (936) Incomplete Randomized Blocks. Ann. Eugen. 7, -40.

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION CHAPTER 3 CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION 3.1 Introduction 3.2 Historical Review 3.3 Preliminary Results 3.4 Construction of RG Designs using a BIB design with b

More information

Construction of PBIBD (2) Designs Using MOLS

Construction of PBIBD (2) Designs Using MOLS Intern. J. Fuzzy Mathematical Archive Vol. 3, 013, 4-49 ISSN: 30 34 (P), 30 350 (online) Published on 4 December 013 www.researchmathsci.org International Journal of R.Jaisankar 1 and M.Pachamuthu 1 Department

More information

Construction of lattice designs using MOLS

Construction of lattice designs using MOLS Malaya Journal of Matematik S(1)(2013) 11 16 Construction of lattice designs using MOLS Dr.R. Jaisankar a, and M. Pachamuthu b, a Department of Statistics, Bharathiar University, Coimbatore-641046, India.

More information

Group 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 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 information

MUTUALLY ORTHOGONAL LATIN SQUARES AND THEIR USES

MUTUALLY 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 information

Some Construction Methods of Optimum Chemical Balance Weighing Designs I

Some Construction Methods of Optimum Chemical Balance Weighing Designs I Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) 4(6): 778-783 Scholarlin Research Institute Journals, 3 (ISS: 4-76) jeteas.scholarlinresearch.org Journal of Emerging Trends in Engineering

More information

Construction of Pair-wise Balanced Design

Construction 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 information

CONSTRUCTION OF RECTANGULAR PBIB DESIGNS

CONSTRUCTION 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 information

X -1 -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs

X -1 -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs DOI:.55/bile-5- Biometrical Letters Vol. 5 (5), No., - X - -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs Ryszard Walkowiak Department

More information

PAIRED COMPARISON DESIGNS FOR TESTING CONCORDANCE BE.'TWEEN JUDGES

PAIRED 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 information

Constructing some PBIBD(2)s by Tabu Search Algorithm

Constructing some PBIBD(2)s by Tabu Search Algorithm Constructing some PBIBD(2)s by Tabu Search Algorithm Luis B. Morales IIMAS, Universidad Nacional Autónoma de México Apdo. Postal 70-221, México, D.F., 04510, Mexico lbm@servidor.unam.mx Abstract Some papers

More information

Anale. Seria Informatică. Vol. XII fasc Annals. Computer Science Series. 12 th Tome 2 nd Fasc. 2014

Anale. 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 information

Some Construction Methods of Optimum Chemical Balance Weighing Designs II

Some Construction Methods of Optimum Chemical Balance Weighing Designs II Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) 5(): 39-44 Scholarlin Research Institute Journals, 4 (ISS: 4-76) jeteas.scholarlinresearch.org Journal of Emerging Trends in Engineering

More information

BLOCK DESIGNS WITH FACTORIAL STRUCTURE

BLOCK DESIGNS WITH FACTORIAL STRUCTURE BLOCK DESIGNS WITH ACTORIAL STRUCTURE V.K. Gupta and Rajender Parsad I.A.S.R.I., Library Avenue, New Delhi - 0 0 The purpose of this talk is to expose the participants to the interesting work on block

More information

CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS

CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS CHAPTER 4 CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS 4.1 Introduction 4.2 Historical Review 4.3 Preliminary Results 4.4 Methods of Construction of SRG Designs 4.4.1 Construction using BIB Designs with

More information

A-efficient balanced treatment incomplete block designs

A-efficient balanced treatment incomplete block designs isid/ms/2002/25 October 4, 2002 http://www.isid.ac.in/ statmath/eprints A-efficient balanced treatment incomplete block designs Ashish Das Aloke Dey Sanpei Kageyama and Kishore Sinha Indian Statistical

More information

ON THE EQUIVALENCE OF A SET OF MUTUALLY ORTHOGONAL LATIN SQUARES WITH OTHER COMBINATORIAL SYSTEMS (1) By A-. Hedayat(2)

ON THE EQUIVALENCE OF A SET OF MUTUALLY ORTHOGONAL LATIN SQUARES WITH OTHER COMBINATORIAL SYSTEMS (1) By A-. Hedayat(2) (. i.'. ( RM-237 AH-1 October 1969 ON THE EQUIVALENCE OF A SET OF MUTUALLY ORTHOGONAL LATIN SQUARES WITH OTHER COMBINATORIAL SYSTEMS (1) By A-. Hedayat(2) ( 1) (2) This research was supported by NSF grant

More information

Balanced Treatment-Control Row-Column Designs

Balanced Treatment-Control Row-Column Designs International Journal of Theoretical & Applied Sciences, 5(2): 64-68(2013) ISSN No. (Print): 0975-1718 ISSN No. (Online): 2249-3247 Balanced Treatment-Control Row-Column Designs Kallol Sarkar, Cini Varghese,

More information

THE ESTIMATION OF MISSING VALUES IN INCOMPLETE RANDOMIZED BLOCK EXPERIMENTS

THE ESTIMATION OF MISSING VALUES IN INCOMPLETE RANDOMIZED BLOCK EXPERIMENTS THE ESTIMATION OF MISSING VALUES IN INCOMPLETE RANDOMIZED BLOCK EXPERIMENTS BY E. A. CORNISH Waite Agricultural Research Institute, Xouth Australia D u RIN a recent years Yates has developed the series

More information

Week 15-16: Combinatorial Design

Week 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 information

Use of α-resolvable designs in the construction of two-factor experiments of split-plot type

Use of α-resolvable designs in the construction of two-factor experiments of split-plot type Biometrical Letters Vol. 53 206, No. 2, 05-8 DOI: 0.55/bile-206-0008 Use of α-resolvable designs in the construction of two-factor experiments of split-plot type Kazuhiro Ozawa, Shinji Kuriki 2, Stanisław

More information

Institute of Mathematical Statistics is collaborating with JSTOR to digitize, preserve and extend access to The Annals of Statistics.

Institute of Mathematical Statistics is collaborating with JSTOR to digitize, preserve and extend access to The Annals of Statistics. Resistant and Susceptible BIB Designs Author(s): A. Hedayat and P. W. M. John Source: The Annals of Statistics, Vol. 2, No. 1 (Jan., 1974), pp. 148-158 Published by: Institute of Mathematical Statistics

More information

arxiv: v1 [math.co] 27 Jul 2015

arxiv: 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 information

Non-existence of strongly regular graphs with feasible block graph parameters of quasi-symmetric designs

Non-existence of strongly regular graphs with feasible block graph parameters of quasi-symmetric designs Non-existence of strongly regular graphs with feasible block graph parameters of quasi-symmetric designs Rajendra M. Pawale, Mohan S. Shrikhande*, Shubhada M. Nyayate August 22, 2015 Abstract A quasi-symmetric

More information

BALANCED INCOMPLETE BLOCK DESIGNS

BALANCED 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 information

Some Construction Methods of Optimum Chemical Balance Weighing Designs III

Some Construction Methods of Optimum Chemical Balance Weighing Designs III Open Journal of Statistics, 06, 6, 37-48 Published Online February 06 in SciRes. http://www.scirp.org/journal/ojs http://dx.doi.org/0.436/ojs.06.6006 Some Construction Meods of Optimum Chemical Balance

More information

ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS

ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS Hacettepe Journal of Mathematics and Statistics Volume 31 (2002), 57 62 ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS Hülya Bayra and Aslıhan Alhan Received 22. 01. 2002 Abstract The application of

More information

LINEAR 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. 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 information

FRACTIONAL FACTORIAL TREATMENT DESIGN. Walter T. Federer and B. Leo Raktoe Cornell University and University of Guelph. Abstract

FRACTIONAL FACTORIAL TREATMENT DESIGN. Walter T. Federer and B. Leo Raktoe Cornell University and University of Guelph. Abstract FRACTIONAL FACTORIAL TREATMENT DESIGN by BU-7l7-M * Walter T. Federer and B. Leo Raktoe Cornell University and University of Guelph September, l980 Abstract An expository treatment of fractional replication

More information

Symmetric and Unsymmetric Balanced Incomplete Block Designs: A Comparative Analysis

Symmetric and Unsymmetric Balanced Incomplete Block Designs: A Comparative Analysis International Journal of Statistics and Applications 01, (4): 33-39 DOI: 10.593/j.statistics.01004.0 Symmetric and Unsymmetric Balanced Incomplete Block Designs: A Comparative Analysis Acha Chigozie Ke

More information

An Incomplete Block Change-Over Design Balanced for First and Second-Order Residual Effect

An Incomplete Block Change-Over Design Balanced for First and Second-Order Residual Effect ISSN 66-0379 03, Vol., No. An Incomplete Block Change-Over Design Balanced for First and Second-Order Residual Effect Kanchan Chowdhury Professor, Department of Statistics, Jahangirnagar University Savar,

More information

Combinatorial designs with two singular values II. Partial geometric designs

Combinatorial designs with two singular values II. Partial geometric designs Linear Algebra and its Applications 396 (2005) 303 316 www.elsevier.com/locate/laa Combinatorial designs with two singular values II. Partial geometric designs E.R. van Dam a,,1, E. Spence b a Department

More information

NESTED BLOCK DESIGNS

NESTED BLOCK DESIGNS NESTED BLOCK DESIGNS Rajender Parsad I.A.S.R.I., Library Avenue, New Delhi 0 0 rajender@iasri.res.in. Introduction Heterogeneity in the experimental material is the most important problem to be reckoned

More information

Square 2-designs/1. 1 Definition

Square 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 information

Blocks are formed by grouping EUs in what way? How are experimental units randomized to treatments?

Blocks 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 information

Balanced Nested Designs and Balanced n-ary Designs

Balanced 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 information

A 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 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 information

Designs for Multiple Comparisons of Control versus Treatments

Designs for Multiple Comparisons of Control versus Treatments Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 14, Number 3 (018), pp. 393-409 Research India Publications http://www.ripublication.com Designs for Multiple Comparisons of Control

More information

Systems of distinct representatives/1

Systems 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 information

Introduction to Block Designs

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 information

PALINDROMIC AND SŪDOKU QUASIGROUPS

PALINDROMIC 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 information

Chapter 10 Combinatorial Designs

Chapter 10 Combinatorial Designs Chapter 10 Combinatorial Designs 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 }. BIBD Definition

More information

REMAINDER LINEAR SYSTEMATIC SAMPLING

REMAINDER LINEAR SYSTEMATIC SAMPLING Sankhyā : The Indian Journal of Statistics 2000, Volume 62, Series B, Pt. 2, pp. 249 256 REMAINDER LINEAR SYSTEMATIC SAMPLING By HORNG-JINH CHANG and KUO-CHUNG HUANG Tamkang University, Taipei SUMMARY.

More information

A 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 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 information

New Lower Bounds for the Number of Blocks in Balanced Incomplete Block Designs

New 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 information

Stanton Graph Decompositions

Stanton Graph Decompositions Stanton Graph Decompositions Hau Chan and Dinesh G. Sarvate Abstract. Stanton graphs S k (in honor of professor Ralph G. Stanton) are defined, and a new graph decomposition problem for Stanton graphs is

More information

Abstract. Using graphs to find optimal block designs. Problem 1: Factorial design. Conference on Design of Experiments, Tianjin, June 2006

Abstract. Using graphs to find optimal block designs. Problem 1: Factorial design. Conference on Design of Experiments, Tianjin, June 2006 Abstract Ching-Shui Cheng was one of the pioneers of using graph theory to prove results about optimal incomplete-block designs. There are actually two graphs associated with an incomplete-block design,

More information

GENERALIZATION OF NEAREST NEIGHBOUR TREATMENTS

GENERALIZATION OF NEAREST NEIGHBOUR TREATMENTS International Journal of Advances in Engineering & Technology, Jan 04 GENERALIZATION OF NEAREST NEIGHBOUR TREATMENTS USING EUCLIDEAN GEOMETRY Rani S, Laxmi R R Assistant Professor, Department of Statistics

More information

Quasigroups and Related Systems 9 (2002), Galina B. Belyavskaya. Abstract

Quasigroups and Related Systems 9 (2002), Galina B. Belyavskaya. Abstract Quasigroups and Related Systems 9 (2002), 1 17 Quasigroup power sets and cyclic Ssystems Galina B. Belyavskaya Abstract We give new constructions of power sets of quasigroups (latin squares) based on pairwise

More information

CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS

CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS Journal of Research (Science), Bahauddin Zakariya University, Multan, Pakistan. Vol. 8, No., July 7, pp. 67-76 ISSN - CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS L. Rasul and I. Iqbal Department

More information

B. L. Raktoe* and W. T. Federer University of Guelph and Cornell University. Abstract

B. L. Raktoe* and W. T. Federer University of Guelph and Cornell University. Abstract BALANCED OPTIMAL SA'IURATED MAIN EFFECT PLANS OF 'IHE 2n FACTORIAL AND THEIR RELATION TO (v,k,'x.) CONFIGURATIONS BU-406-M by January, 1S72 B. L. Raktoe* and W. T. Federer University of Guelph and Cornell

More information

arxiv: v1 [cs.cr] 1 Aug 2011

arxiv: v1 [cs.cr] 1 Aug 2011 Indian Statistical Institute Kolkata Tech. Rep. no. ASD/2010/3, November 10, 2010 Revised draft August 1, 2011 Key Predistribution Schemes for Distributed Sensor Networks via Block Designs arxiv:1108.0243v1

More information

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Statistica Sinica 12(2002), 905-916 QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Kashinath Chatterjee, Ashish Das and Aloke Dey Asutosh College, Calcutta and Indian Statistical Institute,

More information

Determinants of Partition Matrices

Determinants of Partition Matrices journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised

More information

BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS

BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS Rajener Parsa I.A.S.R.I., Lirary Avenue, New Delhi 110 012 rajener@iasri.res.in 1. Introuction For experimental situations where there are two cross-classifie

More information

On the Classification of Splitting (v, u c, ) BIBDs

On 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 information

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES

ORTHOGONAL 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 information

Combinatorial Designs: Balanced Incomplete Block Designs

Combinatorial 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 information

Designs for asymmetrical factorial experiment through confounded symmetricals

Designs for asymmetrical factorial experiment through confounded symmetricals Statistics and Applications Volume 9, Nos. 1&2, 2011 (New Series), pp. 71-81 Designs for asymmetrical factorial experiment through confounded symmetricals P.R. Sreenath (Retired) Indian Agricultural Statistics

More information

Latin Squares with No Small Odd Plexes

Latin Squares with No Small Odd Plexes Latin Squares with No Small Odd Plexes Judith Egan, Ian M. Wanless School of Mathematical Sciences, Monash University, Victoria 3800, Australia, E-mail: judith.egan@sci.monash.edu.au; ian.wanless@sci.monash.edu.au

More information

ROW-COLUMN DESIGNS. Seema Jaggi I.A.S.R.I., Library Avenue, New Delhi

ROW-COLUMN DESIGNS. Seema Jaggi I.A.S.R.I., Library Avenue, New Delhi ROW-COLUMN DESIGNS Seema Jaggi I.A.S.R.I., Library Avenue, New Delhi-110 012 seema@iasri.res.in 1. Introduction Block designs are used when the heterogeneity present in the experimental material is in

More information

3.5 Efficiency factors

3.5 Efficiency factors 3.5. EFFICIENCY FACTORS 63 3.5 Efficiency factors For comparison we consider a complete-block design where the variance of each response is σ CBD. In such a design, Λ = rj Θ and k = t, so Equation (3.3)

More information

Product distance matrix of a tree with matrix weights

Product distance matrix of a tree with matrix weights Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian

More information

MODIFIED SYSTEMATIC SAMPLING WITH MULTIPLE RANDOM STARTS

MODIFIED SYSTEMATIC SAMPLING WITH MULTIPLE RANDOM STARTS RESTAT Statistical Journal olume 6, Number, April 08, 87 MODIFIED SYSTEMATIC SAMPLING WITH MULTIPLE RANDOM STARTS Authors: Sat Gupta Department of Mathematics and Statistics, University of North Carolina,

More information

OPTIMAL CONTROLLED SAMPLING DESIGNS

OPTIMAL CONTROLLED SAMPLING DESIGNS OPTIMAL CONTROLLED SAMPLING DESIGNS Rajender Parsad and V.K. Gupta I.A.S.R.I., Library Avenue, New Delhi 002 rajender@iasri.res.in. Introduction Consider a situation, where it is desired to conduct a sample

More information

A Simple Procedure for Constructing Experiment Designs with Incomplete Blocks of Sizes 2 and 3

A Simple Procedure for Constructing Experiment Designs with Incomplete Blocks of Sizes 2 and 3 A Simple Procedure for Constructing Experiment Designs with Incomplete Blocks of Sizes 2 and 3 Walter T. Federer Biometrics Unit Cornell University Ithaca, New York 14853 BU-1180-MA August 1994 A SIMPLE

More information

Abstract. A substitute for the non-existent affine plane of order 6. Chapter 1. Outline. Square lattice designs for n 2 treatments in rn blocks of n

Abstract. A substitute for the non-existent affine plane of order 6. Chapter 1. Outline. Square lattice designs for n 2 treatments in rn blocks of n A substitute for the non-existent affine plane of order R. A. Bailey University of St Andrews QMUL (emerita) Algebra and Combinatorics seminar, University of St Andrews, 1 February 018 Joint work with

More information

On Strongly Prime Semiring

On Strongly Prime Semiring BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 30(2) (2007), 135 141 On Strongly Prime Semiring T.K. Dutta and M.L. Das Department

More information

Optimal Fractional Factorial Plans for Asymmetric Factorials

Optimal Fractional Factorial Plans for Asymmetric Factorials Optimal Fractional Factorial Plans for Asymmetric Factorials Aloke Dey Chung-yi Suen and Ashish Das April 15, 2002 isid/ms/2002/04 Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110

More information

Lecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky

Lecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,

More information

International Journal of Mathematical Archive-9(3), 2018, Available online through ISSN

International Journal of Mathematical Archive-9(3), 2018, Available online through   ISSN Internatonal Journal of Matheatcal Archve-9(3), 208, 20-24 Avalable onlne through www.ja.nfo ISSN 2229 5046 CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS T. SHEKAR GOUD, JAGAN MOHAN RAO M AND N.CH.

More information

Solving Linear Systems Using Gaussian Elimination. How can we solve

Solving Linear Systems Using Gaussian Elimination. How can we solve Solving Linear Systems Using Gaussian Elimination How can we solve? 1 Gaussian elimination Consider the general augmented system: Gaussian elimination Step 1: Eliminate first column below the main diagonal.

More information

On Construction of a Class of. Orthogonal Arrays

On Construction of a Class of. Orthogonal Arrays On Construction of a Class of Orthogonal Arrays arxiv:1210.6923v1 [cs.dm] 25 Oct 2012 by Ankit Pat under the esteemed guidance of Professor Somesh Kumar A Dissertation Submitted for the Partial Fulfillment

More information

Generalizing Clatworthy Group Divisible Designs. Julie Rogers

Generalizing 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 information

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i ) Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical

More information

USE OF NESTED DESIGNS IN DIALLEL CROSS EXPERIMENTS

USE OF NESTED DESIGNS IN DIALLEL CROSS EXPERIMENTS USE OF NESTED DESIGNS IN DIALLEL CROSS EXPERIMENTS. Introuction Rajener Parsa I.A.S.R.I., Library Avenue, New Delhi - 0 0 The term iallel is a Greek wor an implies all possible crosses among a collection

More information

Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems. Matrix Factorization Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

More information

REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS

REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS REVSTAT Statistical Journal Volume 10, Number 3, November 01, 33 333 REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS Author: Ma lgorzata Graczyk Department of Mathematical and Statistical Methods, Poznań

More information

into B multisets, or blocks, each of cardinality K (K V ), satisfying

into B multisets, or blocks, each of cardinality K (K V ), satisfying ,, 1{8 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Balanced Part Ternary Designs: Some New Results THOMAS KUNKLE DINESH G. SARVATE Department of Mathematics, College of Charleston,

More information

Balanced colourings of strongly regular graphs

Balanced colourings of strongly regular graphs Balanced colourings of strongly regular graphs R. A. Bailey School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK Abstract A colouring of a strongly regular

More information

ON THE CONSTRUCTION OF ORTHOGONAL BALANCED INCOMPLETE BLOCK DESIGNS

ON 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 information

Abstract. Designs for variety trials with very low replication. How do we allow for variation between the plots? Variety Testing

Abstract. Designs for variety trials with very low replication. How do we allow for variation between the plots? Variety Testing Abstract Designs for variety trials with very low replication R A Bailey University of St Andrews QMUL (emerita) TU Dortmund, June 05 In the early stages of testing new varieties, it is common that there

More information

There is no 2-(22, 8, 4) Block Design

There is no 2-(22, 8, 4) Block Design There is no 2-(22, 8, 4) Block Design Richard Bilous, Clement W. H. Lam, Larry H. Thiel, Department of Computer Science and Software Engineering Concordia University Montreal, Québec, Canada H3G 1M8 (Ben)

More information

Incidence Structures Related to Difference Sets and Their Applications

Incidence 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 information

ACI-matrices all of whose completions have the same rank

ACI-matrices all of whose completions have the same rank ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices

More information

3360 LECTURES. R. Craigen. October 15, 2016

3360 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 information

Elementary Row Operations on Matrices

Elementary Row Operations on Matrices King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix

More information

Extending MDS Codes. T. L. Alderson

Extending MDS Codes. T. L. Alderson Extending MDS Codes T. L. Alderson Abstract A q-ary (n,k)-mds code, linear or not, satisfies n q + k 1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show

More information

Cayley-Hamilton Theorem

Cayley-Hamilton Theorem Cayley-Hamilton Theorem Massoud Malek In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n Let A be an n n matrix Although det (λ I n A

More information

FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES

FRACTIONAL 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 information

Regular graphs with a small number of distinct eigenvalues

Regular 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 information

Chapter 4 No. 4.0 Answer True or False to the following. Give reasons for your answers.

Chapter 4 No. 4.0 Answer True or False to the following. Give reasons for your answers. MATH 434/534 Theoretical Assignment 3 Solution Chapter 4 No 40 Answer True or False to the following Give reasons for your answers If a backward stable algorithm is applied to a computational problem,

More information

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc. 1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a

More information

Smarandache mukti-squares 1

Smarandache mukti-squares 1 Scientia Magna Vol. 3 (2007), No. 1, 102-107 Smarandache mukti-squares 1 Arun S. Muktibodh Mohota Science College, Umred Rd., Nagpur-440009, India. Email: amukti2000@yahoo.com Received Feb 1, 2007. Abstract

More information

The number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes

The number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes The number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes Vrije Universiteit Brussel jvpoucke@vub.ac.be joint work with K. Hicks, G.L. Mullen and L. Storme

More information

Topics Related to Combinatorial Designs

Topics 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 information

Characterization of quasi-symmetric designs with eigenvalues of their block graphs

Characterization of quasi-symmetric designs with eigenvalues of their block graphs AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(1) (2017), Pages 62 70 Characterization of quasi-symmetric designs with eigenvalues of their block graphs Shubhada M. Nyayate Department of Mathematics,

More information

NON-PARAMETRIC METHODS IN ANALYSIS OF EXPERIMENTAL DATA

NON-PARAMETRIC METHODS IN ANALYSIS OF EXPERIMENTAL DATA NON-PARAMETRIC METHODS IN ANALYSIS OF EXPERIMENTAL DATA Rajender Parsad I.A.S.R.I., Library Aenue, New Delhi 0 0. Introduction In conentional setup the analysis of experimental data is based on the assumptions

More information

Affine designs and linear orthogonal arrays

Affine designs and linear orthogonal arrays Affine designs and linear orthogonal arrays Vladimir D. Tonchev Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA, tonchev@mtu.edu Abstract It is proved

More information

Bose's method of differences applied to construct Bhaskar Rao designs

Bose's method of differences applied to construct Bhaskar Rao designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1998 Bose's method of differences applied to construct Bhaskar Rao designs

More information