ON THE CONSTRUCTION OF ORTHOGONAL ARRAYS

Similar documents
- 1 - Association Schemes. Orthogonal Arrays and Codes from Non-degenerate Quadrics and Hermitian Varieties in Finite Projective Geometries.

Department of Statistics Chapel Hill, N. C.

ON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS

Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.

ON SWELL COLORED COMPLETE GRAPHS

A Communications Network???

Provide a drawing. Mark any line with three points in blue color.

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

Unlabeled equivalence for matroids representable over finite fields

CS-9645 Introduction to Computer Vision Techniques Winter 2019

The statement implies that any three intersection points of two distinct planes lie on a line.

Extending partial projective planes

1 Solution of Homework I

Interpretations and Models. Chapter Axiomatic Systems and Incidence Geometry

Projective geometry and the extended Euclidean plane

Definition 2 (Projective plane). A projective plane is a class of points, and a class of lines satisfying the axioms:

Hawraa Abbas Almurieb. Axiomatic Systems

2 Solution of Homework

Random strongly regular graphs?

Extending partial projective planes

3D Computer Vision II. Reminder Projective Geometry, Transformations

Inversive Plane Geometry

Rubber bands. Chapter Rubber band representation

Definition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.

9.5 Equivalence Relations

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

Math Introduction to Advanced Mathematics

TAGUCHI TECHNIQUES FOR 2 k FRACTIONAL FACTORIAL EXPERIMENTS

1 Elementary number theory

LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS

A Short Introduction to Projective Geometry

Discrete Mathematics Lecture 4. Harper Langston New York University

On the complete arcs containing the quadrangles constructing the Fano planes of the left near field plane of order 9

the projective completion of the affine plane with four points

Problem 3.1 (Building up geometry). For an axiomatically built-up geometry, six groups of axioms needed:

Synthetic Geometry. 1.1 Foundations 1.2 The axioms of projective geometry

On the construction of nested orthogonal arrays

Chapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.

Chapter 4 Concepts from Geometry

The Further Mathematics Support Programme

.(3, 2) Co-ordinate Geometry Co-ordinates. Every point has two co-ordinates. Plot the following points on the plane. A (4, 1) D (2, 5) G (6, 3)

Robot Vision: Projective Geometry

7. The Gauss-Bonnet theorem

Bulgarian Math Olympiads with a Challenge Twist

2 Geometry Solutions

Multiple View Geometry in Computer Vision

Topics in geometry Exam 1 Solutions 7/8/4

Is there a McLaughlin geometry?

Parallel and perspective projections such as used in representing 3d images.

LATIN SQUARES AND TRANSVERSAL DESIGNS

Finite Math - J-term Homework. Section Inverse of a Square Matrix

Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes

MAT 3271: Selected Solutions to the Assignment 6

Epipolar Geometry and the Essential Matrix

REGULAR GRAPHS OF GIVEN GIRTH. Contents

A.1 Numbers, Sets and Arithmetic

1 Affine and Projective Coordinate Notation

Binary Relations McGraw-Hill Education

Hamiltonian cycles in bipartite quadrangulations on the torus

Mirrors of reflections of regular maps

Two Characterizations of Hypercubes

Conic Duality. yyye

2017 SOLUTIONS (PRELIMINARY VERSION)

11 1. Introductory part In order to follow the contents of this book with full understanding, certain prerequisites from high school mathematics will

Sparse Hypercube 3-Spanners

An Approach to Geometry (stolen in part from Moise and Downs: Geometry)

The Football Pool Problem for 5 Matches

TECHNISCHE UNIVERSITÄT BERLIN WS2005 Fachbereich 3 - Mathematik Prof. Dr. U. Pinkall / Charles Gunn Abgabe:

New Constructions of Non-Adaptive and Error-Tolerance Pooling Designs

2 Solution of Homework II

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Math 102A Hw 3 P a (2 points)

3D Computer Vision II. Reminder Projective Geometry, Transformations. Nassir Navab. October 27, 2009

Pantographic polygons

A geometric non-existence proof of an extremal additive code

Algebraic Graph Theory- Adjacency Matrix and Spectrum

An Introduction to Belyi Surfaces

Laguerre Planes: A Basic Introduction

On the Minimum Number of Convex Quadrilaterals in Point Sets of Given Numbers of Points

Technische Universität München Zentrum Mathematik

Euler s Theorem. Brett Chenoweth. February 26, 2013

The number of spanning trees of plane graphs with reflective symmetry

AH Matrices.notebook November 28, 2016

Lecture 2 September 3

Math 170- Graph Theory Notes

ON THE STRONGLY REGULAR GRAPH OF PARAMETERS

Suggested problems - solutions

On the number of distinct directions of planes determined by n points in R 3

On Valuations, the Characteristic Polynomial, and Complex Subspace Arrangements

SPERNER S LEMMA MOOR XU

GEOMETRIC DISTANCE-REGULAR COVERS

Vertex Magic Total Labelings of Complete Graphs 1

Geometric Constructions

Assignments in Mathematics Class IX (Term I) 5. InTroduCTIon To EuClId s GEoMETry. l Euclid s five postulates are : ANIL TUTORIALS

The Largest Pure Partial Planes of Order 6 Have Size 25

Vertex Magic Total Labelings of Complete Graphs

Lecture 5: More Examples/Applications of Quasirandom Graphs

The focus and the median of a non-tangential quadrilateral in the isotropic plane

On extensions of Pascal's theorem

Transcription:

Hacettepe Journal of Mathematics and Statistics Volume 31 (2002), 45 51 ON THE CONSTRUCTION OF ORTHOGONAL ARRAYS Hülya Bayrak and Aslıhan Alhan Received 04. 10. 2001 Abstract In this study, the geometric representation of an Orthogonal Array is obtained using finite analytic projective geometry of the Galois field GF(s) of t-dimensions, which can be denoted by PG(t, s), where s is a prime or a power of a prime number. We give relations between the parameters of Orthogonal Arrays and properties of the projective geometry and of related geometries. We offer some geometrical examples. Key Words: Orthogonal Array, Projective Geometry, Net. 1. Introduction Orthogonal arrays, first introduced by Rao [7, 8] have been used extensively in factorial designs. Specifically, an orthogonal array of size N, k constraints, s levels and strength t, denoted by OA(N, k, s, t), is a k N matrix X of s symbols such that all the ordered t-tuples of the symbols occur equally often as column vectors of any t N submatrix of X. It is clear that N must be of the form λs t, where λ is usually called the index of the orthogonal array. In applications to factorial designs, each row corresponds to a factor, the symbols are factor levels and each column represents a combination of the factor levels. Thus every OA(N, k, s, t) defines an N-run factorial design for k factors each having s levels [6], where λ = 1, and we refer to such arrays as orthogonal arrays of index unity [5]. A connection between orthogonal arrays and the theory of confounding in symmetrical factorial designs (based on the use of finite projective geometries) was first established by Bose and Kishen [3], and this was later amplified by Bose [1, 2]. Bose [1] proved that the maximum number of factors, which can be accommodated in symmetrical problems of the design of experiments, could be attacked fruitfully by interpreting the statistical terms involved in terms of finite geometries [10]. Gazi University, Faculty of Arts and Sciences, Department of Statistics, Ankara, Turkey. E-Mail: hbayrak@gazi.edu.com Gazi University, Instute of Science and Technology, Department of Statistics, Ankara,Turkey. E-Mail: aalhan@mynet.com 45

46 H. Bayrak, A. Alhan The reader may refer to Raghavarao [9] for the definition of an orthogonal array, various construction methods and the maximum the number of constraints. Further, Raghavarao shows that projective geometries are related to orthogonal arrays, discusses the product of orthogonal arrays and gives the relationship between orthogonal arrays and partially balanced arrays. 2. The use of Projective Geometry in the Construction of Orthogonal Arrays There is a GF(s = p n ) of order p n for every prime number p and every positive integer n. A point in the t-dimensional finite projective geometry PG(t, s) is an ordered set of t+1 elements of GF(s), not all of which are equal to zero. If we delete any line of PG(t, s), together with the points on it, we obtain a finite Euclidean Geometry EG(t, s), constructed on GF(s). The idea of deleting a line can be considered as grouping s varieties according to a treatment or combination of treatments, which are the points of the deleted line. The geometric representation of an Orthogonal Array can be obtained using a finite analytic projective geometry over the Galois field GF(s) of t-dimensions. Rao [7] considered constructions of hypercubes from PG(t, s). The orthogonal array OA(s t, (s t 1)/(s 1), s, 2) of index λ = s t 2, which is the same as the hypercube [(s t 1)/(s 1), s, t, 2] of strength 2, can be constructed from PG(t, s) in the following manner: in PG(t, s) the equation x 0 = 0 (1) represents the (t 1)-flat at infinity, and any other (t 1)-flat can be represented by an equation of the from a 0 x 0 + a 1 x 1 + + a t x t = 0, (2) so a (t 2)-flat at infinity can be represented by x 0 = 0; a 1 x 1 + a 2 x 2 + + a t x t = 0, a i GF (s), i = 1, 2,..., t. (3) We observe that there are (s t 1)/(s 1), (t 2)-flats at infinity. From the (t 2)- flat given by (3), there originates a pencil of s, (t 1)-flats given by the following equation: α i x 0 + a 1 x 1 + a 2 x 2 + + a t x t = 0, α i GF(s) (4) The (t 2)-flat (3) is called the vertex of the pencil (4), and corresponds to a factor identified by (a 1, a 2,..., a t ). The (t 1)-flat (4), with α i as the coefficient of x 0, may be identified with α i, which may be taken to correspond to the i th level (i = 0, 1,..., s 1) of a factor, identified by (a 1, a 2,..., a t ), defining the vertex (3) of the pencil (4). Thus there are m = (s t 1)/(s 1) factors, each at s levels. There are s t finite points (1, x 1, x 2,..., x t ), and through each of the finite points there passes exactly one (t 1)-flat from each of the (s t 1)/(s 1) pencils of (t 1)-flats. We now identify the s t finite points and the factors with the

On the Construction of Orthogonal Arrays 47 columns and rows of an array, and fill its (i, j) th position by k if the αk th flat of the i th pencil passes through the j th finite point (k = 0, 1,..., s 1; i = 1, 2,..., (s t 1)/(s 1); j = 1, 2,..., s t ). The array thus constructed can easily be verified to be the orthogonal array OA(s t, (s t 1)/(s 1), s, 2) of index λ = s t 2 [9]. 2.1. Illustration. We illustrate this method of construction by constructing the orthogonal array OA(8, 7, 2, 2) of index 2. This orthogonal array can be constructed from PG(3, 2). In PG(3, 2) each of the 15 points can be represented by (x 0, x 1, x 2, x 3 ), where x i = 0 or 1 (i = 0, 1, 2, 3), and not all the x i coordinates are equal to zero. The vertices corresponding to the pencil (4) are (1,0,0), (0,1,0), (0,0,1), (1,1,0), (1,0,1), (0,1,1) and (1,1,1), and we call them the factors A, B, C, D, E, F and G, respectively. The eight finite points are (1,0,0,0), (1,1,0,0), (1,0,1,0), (1,0,0,1), (1,1,1,0), (1,1,0,1), (1,0,1,1) and (1,1,1,1), numbered in the serial order 1, 2,..., 8. Let us form an array of seven rows and eight columns, the rows corresponding to the seven factors, and the columns corresponding to the eight finite points, and fill the (i, j) th entry by the flat number of the i th pencil passing through the j th finite point (i = A, B,..., G; j = 1, 2,..., 8). For example, the second point lies on the flat number 1 passing through the vertex D, and hence the entry in the second column under row D is 1. The completed arrangement constituting the orthogonal array OA(8, 7, 2, 2) of index 2 will then be as follows: Table 1. Orthogonal Array OA(8, 7, 2, 2) of index 2 Finite Points Factor 1 2 3 4 5 6 7 8 A 0 1 0 0 1 1 0 1 B 0 0 1 0 1 0 1 1 C 0 0 0 1 0 1 1 1 D 0 1 1 0 0 1 1 0 E 0 1 0 1 1 0 1 0 F 0 0 1 1 1 1 0 0 G 0 1 1 1 0 0 0 1 To construct a hypercube of strength 3, or equivalently an orthogonal array of index λ = s t 3 from PG(t, s), we need to select the factors suitably. To get the orthogonal array of index λ = s t 3, it is necessary that three (t 1)-flats belonging to three different pencils from the set of (s t 1)/(s 1) pencils intersect at s t 3 finite points. Any two vertices corresponding to two pencils intersect at a (t 3)- flat at infinity. A third vertex has to be chosen so that it does not pass through the intersection of the previous two vertices; a fourth vertex has to be chosen so that it does not pass through the intersection of any two vertices already chosen; and so on. It is now easy to see that the conditions for an orthogonal array of index λ = s t 3 are satisfied if the selected vertices are identified with factors [9]. Thus, Table 1 defines the finite EG(3, 2).

48 H. Bayrak, A. Alhan 2.2. Illustration. Let us construct the orthogonal array OA(9, 4, 3, 2) of index unity, where s = 3 and t = 2. This orthogonal array can be constructed from PG(2, 3). In PG(2, 3) each of the 13 points can be represented by (x 0, x 1, x 2 ), where x i = 0, 1 or 2 (i = 0, 1) and not all the coordinates x i are equal to zero. The lines and the points on those lines in PG(2, 3) are as follows: Table 2. Lines and Points in PG(2, 3) Lines Points on Lines [0, 0, 1] (1,0,0), (0,1,0), (1,1,0), (1,2,0) [0, 1, 0] (1,0,0), (0,0,1), (1,0,1), (1,0,2) [0, 2, 1] (1,0,0), (0,1,1), (1,1,1), (1,2,2) [0, 1, 1] (1,0,0), (0,2,1), (1,1,2), (1,2,1) [1, 0, 0] (0,1,0), (0,0,1), (0,1,1), (0,2,1) [1, 0, 2] (0,1,0), (1,0,1), (1,1,1), (1,2,1) [1, 0, 1] (0,1,0), (1,0,2), (1,1,2), (1,2,2) [1, 2, 0] (1,1,0), (0,0,1), (1,1,1), (1,1,2) [2, 1, 1] (1,1,0), (1,0,2), (0,1,1), (1,2,1) [1, 2, 1] (1,2,0), (0,0,1), (1,2,1), (1,2,2) [1, 1, 0] (1,1,0), (1,0,1), (0,2,1), (1,2,2) [1, 1, 2] (1,2,0), (1,0,1), (0,1,1), (1,1,2) [1, 1, 1] (1,2,0), (1,0,2), (0,2,1), (1,1,1) We selected the finite points (1, x 1, x 2,..., x t ) to correspond to s t, those points whose first coordinate is zero and the first line will be removed. The points and corresponding factors and factor combinations are given as follows: Table 3. [0, 0, 1] (1,0,0) (0,1,0) (1,1,0) (1,2,0) A B AB AB 2 [1, 0, 1] (0,1,0) (1,0,2) (1,1,2) (1,2,2) B AC 2 ABC 2 AB 2 C 2 [1, 0, 2] (0,1,0) (1,0,1) (1,1,1) (1,2,1) B AC ABC AB 2 C [0, 1, 0] (1,0,0) (0,0,1) (1,0,1) (1,0,2) A C AC AC 2 [1, 1, 0] (0,0,1) (1,2,1) (2,1,1) (1,2,0) C AB 2 C AB 2 C 2 AB 2 [1, 2, 0] (1,1,0) (0,0,1) (1,1,1) (1,1,2) AB C ABC ABC 2 [0, 2, 1] (1,0,0) (0,1,1) (1,1,1) (1,2,2) A BC ABC AB 2 C 2 [1, 1, 2] (1,2,0) (1,0,1) (0,1,1) (1,1,2) AB 2 AC BC ABC 2 [1, 2, 2] (1,1,0) (1,0,2) (0,1,1) (1,2,1) AB AC 2 BC AB 2 C

On the Construction of Orthogonal Arrays 49 [1, 1, 1] (1,1,1) (1,2,0) (1,0,2) (0,2,1) ABC AB 2 AC 2 BC 2 [0, 1, 1] (1,0,0) (0,2,1) (1,2,1) (1,1,2) A BC 2 AB 2 C ABC 2 [2, 1, 1] (1,1,0) (1,0,1) (2,1,1) (0,2,1) AB AC AB 2 C 2 BC 2 Since the line [1, 0, 0] and points on that line are removed, we have 12 lines and 9 points. Using the above notation these 12 lines and points can be shown as follows: Table 4. [0, 0, 1] (1,0,0) (1,1,0) (1,2,0) A AB AB 2 [1, 0, 0] : [1, 0, 1] (1,0,2) (1,1,2) (1,2,2) AC 2 ABC 2 AB 2 C 2 (0,1,0) (0,0,1) [1, 0, 2] (1,0,1) (1,1,1) (1,2,1) AC ABC AB 2 C (0,1,1) (0,2,1) [0, 1, 0] (1,0,0) (1,0,1) (1,0,2) A AC AC 2 [1, 0, 0] : [1, 1, 0] (1,2,1) (2,1,1) (1,2,0) AB 2 C AB 2 C 2 AB 2 (0,1,0) (0,0,1) [1, 2, 0] (1,1,0) (1,1,1) (1,1,2) AB ABC ABC 2 (0,1,1) (0,2,1) [0, 1, 2] (1,0,0) (1,1,1) (1,2,2) A ABC AB 2 C 2 [1, 0, 0] : [1, 1, 2] (1,2,0) (1,0,1) (1,1,2) AB 2 AC ABC 2 (0,1,0) (0,0,1) [1, 2, 2] (1,1,0) (1,0,2) (1,2,1) AB AC 2 AB 2 C (0,1,1) (0,2,1) [1, 1, 1] (1,1,1) (1,2,0) (1,0,2) ABC AB 2 AB 2 C 2 [1, 0, 0] : [0, 1, 1] (1,0,0) (1,2,1) (1,1,2) AB 2 AC ABC 2 (0,1,0) (0,0,1) [2, 1, 1] (1,1,0) (1,0,1) (2,1,1) AB AC 2 AB 2 C (0,1,1) (0,2,1) The vertices corresponding to the pencil (4) are (0,1,0), (0,0,1), (0,1,1) and (0,2,1), and we call them the factors B, C, BC and BC 2, respectively. The nine finite points are (1,0,0), (1,0,1), (1,0,2), (1,1,0), (1,1,1), (1,1,2), (1,2,0), (1,2,1) and (1,2,2), numbered in the serial order 1, 2,..., 9. Let us form an array of four rows and nine columns, the rows corresponding to the four factors, and the columns corresponding to the nine finite points, and fill the (i, j) th entry by the flat number of the i th pencil passing through the j th finite point (i = B, C, BC, BC 2 ; j = 1, 2,..., 9). For example, the second point lies on flat number 1, passing through the vertex B, and hence the entry in the second column under row B is 0. Deleted points corresponding to vertices (factor and factor combinations) are multiplied by the finite points, and the (i, j) th entry filled by the number obtained. For instance, if the second point and vertex B are multiplied, the (1, 2) th entry will be 0, and so on. The completed arrangement, constituting the orthogonal array OA(9, 4, 3, 2) of unit index, will then be as follows:

50 H. Bayrak, A. Alhan Table 5. Orthogonal Array OA(9, 4, 3, 2) of unit index Finite Points Factor 1 2 3 4 5 6 7 8 9 B 0 0 0 1 1 1 2 2 2 C 0 1 2 0 1 2 0 1 2 BC 0 1 2 1 2 0 2 0 1 BC 2 0 1 2 2 0 1 1 2 0 2.3. Definition. A k-net, N, is a system of undefined points and lines, together with an incidence relation, subject to the following axioms: (i) N has at least one point. (ii) The lines of N are partitioned into k disjoint, nonempty, parallel classes such that (a) each point of N is incident with exactly one line of each class; (b) for any two lines belonging to distinct classes, there corresponds exactly one point of N which is incident with both lines. If some line of N contains exactly n distinct points, the following statements are true: (I) Each line of N contains exactly n distinct points, where n 1. (II) Each point of N lies in exactly k distinct classes, where k > 1. (III) N has exactly kn distinct lines. These fall into k parallel classes of n lines each. Distinct lines of the same parallel class have no common points. Two lines of different classes have exactly one common point. (IV) N has exactly n 2 distinct points [4]. According to Definition 2.3, Table 3 defines a net. A finite net, N, of order n, deficiency zero, is precisely an affine plane of order n. Thus the design above is an affine plane. 3. Conclusion The construction and analysis of orthogonal arrays needs special care. There are several methods which can be used to construct orthogonal arrays. We have tried to give relations between orthogonal arrays and properties of projective and related geometries. We have offered some geometrical examples, some of which can be considered original.

On the Construction of Orthogonal Arrays 51 References [1] Bose, R. C. Mathematical theory of symmetrical factorial designs, Sankhya 8, 107 166, 1947. [2] Bose, R. C. and Bush, K.A. Orthogonal arrays of strength two and three, Ann. Math. Stat. 23, 508 524, 1952. [3] Bose, R. C. and Kishen, K. On the problem of confounding in the general symmetrical factorial design, Sankhya 5, 21 36, 1940. [4] Bruck, R. H. Finite nets II. Uniqueness and Imbedding, Pacific J. Math. 13, 421 457, 1963. [5] Bush, K. A. Orthogonal arrays of index unity, Ann. Math. Stat. 23, 426 434, 1952. [6] Cheng, C. S. Some projection properties of orthogonal arrays, The Annals Of Statistics 23, No.4, 1223 1233, 1995. [7] Rao, C. R. Hypercubes of strength D leading to confounded designs in factorial experiments, Bull. Calcutta Math. Soc. 38, 67 78, 1946. [8] Rao, C. R. Factorial arrangements derivable from combinatorial arrangements Of arrays, Jour. Roy. Stat., Suppl. 9, 128 139, 1947. [9] Raghavarao, D. Constructions and Ccombinatorial problems in design of experiments, Dover Publications, Inc., New York, 1971. [10] Seiden, E. A theorem in finite projective geometry and an application to statistics, Proc. Amer. Math. Soc. 1, 282 286, 1950.

2024 © technodocbox.com Privacy Policy | Terms of Service | Feedback