Group divisible designs in MOLS of order ten
|
|
- Elijah Paul
- 5 years ago
- Views:
Transcription
1 Des. Codes Cryptogr. (014) 71:83 91 DOI /s Group divisible designs in MOLS of order ten Peter Dukes Leah Howard Received: 10 March 011 / Revised: June 01 / Accepted: 10 July 01 / Published online: 5 July 01 Springer Science+Business Media, LLC 01 Abstract The maximum number of mutually orthogonal latin squares (MOLS) of order 10 is known to be between and 6. A hypothetical set of four MOLS must contain at least one of the types of group divisible designs (GDDs) classified here. The proof is based on a dimension argument modified from work by Dougherty. The argument has recently led to the discovery of a counterexample to Moorhouse s conjecture on the rank of nets, found by Howard and Myrvold. Although it is known that even three MOLS can admit no nontrivial symmetry group, we are hopeful this classification via GDDs and dimension can offer some structure to aid the eventual goal of exhausting the search for four MOLS of order 10. Keywords Code Dimension Net MOLS GDD Mathematics Subject Classification (000) Primary 05B15 Secondary 51E14 1 Introduction A latin square of order n is an n n array with n symbols such that every row and column is a permutation of the symbols. Two latin squares A and B are orthogonal if the ordered pairs (A ij, B ij ) exhaust all n possible ordered pairs of the symbols. For example, it is easy to see that there do not exist orthogonal latin squares of order. On the other hand, the addition and subtraction tables for finite fields of odd characteristic furnish orthogonal latin squares of all odd prime power orders. Communicated by C. Mitchell. P. Dukes (B) Department of Mathematics and Statistics, University of Victoria, Victoria, BC V8W 3R4, Canada dukes@uvic.ca L. Howard Department of Mathematics, Camosun College, Victoria, BC V8P 5J, Canada howardl@camosun.bc.ca
2 84 P. Dukes, L. Howard A straightforward argument shows that there can exist at most n 1 pairwise orthogonal, or mutually orthogonal latin squares of order n, with equality if and only if there exists a projective plane of that order. In general, a family of mutually orthogonal latin squares (MOLS) of order n is abbreviated MOLS(n) and the maximum size of such a family is denoted N(n). A wide body of literature on MOLS(n) is summarized in [4], chapter III.3; in particular a table of values of N(n) is given. As many lower bounds on N(n) come from a product construction, the most challenging case is generally n = 4t + for some integer t. In 1959 Bose and Shrikhande [1] disproved Euler s 178 conjecture that there do not exist orthogonal latin squares of order 4t + by constructing a pair of order. The same year Parker [1] established the existence of a pair of order 10. In 1960 Bose, Shrikhande and Parker [] showedthatthere areatleasttwo MOLS(4t + ), exceptfororders and6. Since then, much research has been conducted on MOLS of order 4t +. In 005 McKay, Meynert and Myrvold [10] showed that if three MOLS(10) exist then each latin square in the triple has trivial symmetry. A result of Bruck [3] gives one of the few known general upper bounds on MOLS. Theorem 1.1 If N(n) <n 1 then N(n) <n 1 (n) 1 4. In 1989 Lam, Thiel and Swiercz s computer search [9] revealed no projective plane of order ten; hence N(10) <9. Taken together with Theorem 1.1, this yields the current best upper bound of N(10) 6. That is, there are at most six MOLS(10). MOLS are equivalent to two other combinatorial objects: nets and transversal designs. First, a k-net of order n is an incidence structure of n points and kn lines, so that every pair of points is on at most one line and every line contains n points; furthermore, the lines partition into k parallel classes,each containing n disjoint lines. Dually, a transversal design TD(k, n) is a collection of kn vertices and n blocks, each containing k vertices; the kn vertices are partitioned into k groups, each of size n, and every pair of vertices from different groups belongs to exactly one block. By interchanging points with blocks, lines with vertices, and parallel classes with groups, it is clear that k-nets of order n and transversal designs TD(k, n) are equivalent objects. Moreover, a set of k MOLS(n) is equivalent to either of these. In the net context, the n points correspond to the n cells of the latin squares. The parallel classes of lines are formed by the rows, columns, and, for each latin square, the set of cells containing a fixed entry. In the TD context, the vertices correspond with row labels, column labels, and symbols in each of the k squares. A block is necessarily transverse to the groups and indicates which symbols appear in each square in a given row and column. Proposition 1. The existence of the following are equivalent: (1) k MOLS(n), () a k-net of order n, and (3) a transversal design TD(k, n). The definition of a TD(k, n) can be weakened so that the k groups have different sizes and blocks do not necessarily intersect each group. We call such an object a group divisible design, or GDD. The GDDs under consideration here have block sizes of, 4, or 6 and each vertex lies in exactly 10 blocks of the GDD. Given a GDD, the groups can be added to the set of blocks to produce a pairwise balanced design, or PBD. Every pair of distinct vertices now belongs to exactly one block. The type of a GDD specifies the group sizes in exponential notation. For example, a GDD with a group of size, three groups of size 4 and a group of size 6 is of type
3 GDDs in MOLS of order Specializing to our context, a GDD embeds in a TD(6, 10) if it is possible to extend each group to 10 vertices, extend each block to six vertices and enlarge the set of blocks in such a way that each pair of vertices appear together in one group or one block, but not both. Here the possible existence of four MOLS(10) is studied in terms of the corresponding TD(6, 10), and the possible GDDs which are subdesigns of the TD. The two main results in this paper are a classification of the possible types of GDDs that occur in this way, and a proof that one of these possible GDDs does not embed in a TD(6, 10). It is our hope that the classification of GDDs could provide a preliminary framework for a computer search for four MOLS(10). The feasibility of at least a partial search was demonstratedbyhowardandmyrvold[8] who found a GDD embedded in a TD(4, 10), providing a counterexample to Moorhouse s conjecture [11] on the rank of nets. If it could be shown that none of the GDDs in our classification extend to a TD(6, 10), then an upper bound of N(10) 3 could be established. Main results The general approach of examining codes arising from designs was pioneered by Hall [7]. Stinson [13] gave a new proof of the nonexistence of two MOLS(6) using design-theoretic techniques and a concise dimension argument. Some of the techniques in this paper, particularly those in the proof of Proposition.7, follow Stinson s treatment of sub-pbds in a hypothetical transversal design. Dougherty [6] gavean expandeddimension argumentbased on that of Stinson, but now phrased in the language of nets, to show the nonexistence of two MOLS(6). Dougherty s dimension argument is valid for finite fields of prime order p and for nets whose order is divisible by p. This generality allows Dougherty s techniques to be applied to nets of order 10. A k-net will be denoted N k for brevity. The number k is the net s degree. Somevector spaces associated with nets F generated by the characteristic functions of lines in N k.these characteristic functions indicate which points lie on each line; in a net of order n the vectors will have n components. Let D (N k ) denote the vector space over F generated by the characteristic functions of vectors of the form l + m where l and m lie in the same parallel class. The dimensions of C and D over F for nets of degree one are as follows: dim C (N 1 ) = n and dim D (N 1 ) = n 1. Any linear dependency in the vector space C (N k ) is called a relation. For instance, a 6-net of order 10 has trivial relations generated by the following five relations: 1, 1 3, 1 4, 1 5,and 1 6,wherethe i are the parallel classes of the net. Since such a net has 60 lines, its dimension is at most 55. Any relation consists of a set of lines of the net that intersects each point of the net an even number of times (possibly zero). The weight of a parallel class with respect to a relation is the number of lines it contributes to the relation. The following four results are due to Dougherty [6]: Theorem.1 If k is even or if N k has a transversal then, for even orders, dim C (N k ) dim D (N k ) = k. Lemma. If any parallel class has odd weight with respect to a relation in a net N k of even order then dim C (N k ) dim D (N k )<k. Lemma.3 The weight of each parallel class is 0, n, or n for any relation in a net N 3.
4 86 P. Dukes, L. Howard Lemma.4 If a net N 3 of order two modulo four has a transversal then dim C (N 3 ) dim C (N ) = n 1. These can be used to give an upper bound on the dimension of nets of even order: Proposition.5 Let N k be a net of even order n such that k is even or N k has a transversal. Then dim C (N k ) n +k. Proof When n is even C (N k ) D (N k), implying that dim C (N k ) dim D (N k) = n dim D (N k ). When k is even or N k has a transversal, this gives dim C (N k ) n + k dim C (N k ) or dim C (N k ) n +k. Corollary.6 A 6-net of order ten contains at least two linearly independent nontrivial relations. Proof The net has 60 lines and five linearly independent trivial dependencies, yielding a dimension of 55 minus the number of linearly independent nontrivial dependencies. By Proposition.5,dimC (N 6 ) = 53 for a 6-net of order ten. Since a 6-net of order 10 has even degree, Dougherty s Theorem.1 and Lemma. imply that each parallel class has even weight with respect to any such relation. Furthermore, Lemma.4 implies that there are no nontrivial relations in fewer than four parallel classes. It is convenient to view each relation in a 6-net of order 10 as a GDD with blocks of size, 4 or 6 embedded in a TD(6, 10). The vertices of the GDD correspond to the lines of the relation, with groups corresponding to the parallel classes of the net. Each block of the GDD arises from a point of the net, indicating which lines of the net intersect at that point. In any such GDD, each vertex lies in exactly 10 blocks of the GDD. Note that some parallel classes may not contribute any lines to the relation; therefore the GDD may have some groups of size 0. Proposition.7 The number of lines in a relation in a net N k of order ten is divisible by four, provided that k is even or N k has a transversal. Proof Consider the GDD resulting from the dual of the relation. Construct a PBD by adding the groups to the block set. Let m be the number of lines in the relation, equal to the number of vertices in the PBD. All block sizes are necessarily even by the definition of a relation and because all groups of the GDD are of even size. Let b, b 4, b 6, b 8, b 10 be the number of blocks of appropriate size in the PBD. Each vertex of the PBD appears in precisely eleven blocks: b + 4b 4 + 6b 6 + 8b b 10 = 11m. Each pair of distinct vertices in the PBD appear together in precisely one block: b + 6b b 6 + 8b b 10 = m(m 1). Subtracting the first equation from twice the second yields 8b 4 + 4b b b 10 = m(m 1) so that m(m 1) is divisible by eight. This implies that four divides m. Theorem.8 The following types of GDDs in a TD(6, 10) admit the possibility of a relation: 4 4, , 4 3, , 4 5, 6, 5 6 1, 4 4, , 4 4, , 4 6. Any other admissible type of GDD can be achieved from one of the above by complementing the vertex set in an even number of groups.
5 GDDs in MOLS of order Proof Consider the GDDs embedding in a TD(6, 10) that represent relations. By Proposition.7 the number of vertices in any such GDD is divisible by four. The total number of vertices when any group is deleted must be at least ten since any deleted vertex appears in exactly ten blocks. The vertices in any pair of groups whose combined size exceeds ten can be complemented to get a combined size below 10. This reduces the total number of vertices under consideration. Together with Proposition.7 the list is reduced to the types: , 4 4, , 4 3, , 4 5, 6, 5 6 1, 4 4, , 4 4, , 4 6.Now suppose that a GDD of type embedded in a TD(6, 10) admits a relation. Since every vertex of the GDD appears in exactly ten blocks of the GDD, and recalling that all block sizes are even, all blocks through the largest group must be blocks of size two. Such GDDs therefore consist of 8 blocks of size zero and 9 blocks of size two. Such GDDs cannot embedinatd(4, 10), for a contradiction. GDDs of type in a TD(6, 10) therefore do not admit a relation. Since a GDD is embedded in a TD(6, 10) if and only if one complementable to it is, at least two GDDs chosen from the types above are forced to occur in any TD(6, 10). The goal is now to describe the structure that is forced on each of the GDDs above. Consider the structure produced when all the vertices from one group of the GDD are deleted. This structure will be called a conformation. The blocks now have size 1 through 5. Let b 1, b, b 3, b 4, b 5 represent the number of blocks of each size. It will be convenient to let b 0 represent the number of blocks of size 0. Suppose a group of size g is deleted from the GDD. Let L be the number of vertices remaining in the GDD and P be the number of pairs of vertices remaining that lie in different groups. Given a GDD of type 4 4 and a resulting conformation of type 4 3, P = 3 4 = 48. The quantity C comes from the same calculation for 10 minus each group size. In this example C = 3 6 = 108. The quantity copairs is 3b 0 +b 1, 6b 0 +3b 1 +b or 10b 0 +6b 1 +3b +b 3 depending on whether the original GDD had four, five or six groups respectively. A conformation then produces blocks of various sizes according to solutions of the following system: b 0 + b 1 + b + b 3 + b 4 + b 5 = 100 b + 3b 3 + 6b b 5 = P copairs = C b 1 + b 3 + b 5 = 10g b 1 + 3b 3 + 5b 5 = Lg The last two restrictions insist that each deleted vertex contributes to 10 odd-sized blocks and that each deleted vertex appears in a block with each vertex in another group precisely once. When the GDD has four or five groups of nonzero size, b 5 must equal zero and the above system has a unique solution. When the GDD has six groups of nonzero size, given an integral solution (b 0, b 1, b, b 3, b 4, b 5 ) to the above system with b 5 = 0, observe that (b 0 r, b 1 + r, b + r, b 3 r, b 4 r, r) is also an integral solution for any positive integer r. Combinatorial feasibility of the GDD requires that all solutions be nonnegative. An upper bound on r, the number of blocks of size six in the GDD, helps to restrict the structure of the GDD. Here are some upper bounds on this number: the product of the two smallest group sizes in the GDD, b 0, 1 b 3, b 4.Thelast three follow from the nonnegativity condition above.
6 88 P. Dukes, L. Howard Consider any GDD corresponding to a relation, and consider any group of size g in the GDD (not necessarily the largest group). Let c, c 4, c 6 represent the number of blocks of each size through a given vertex in this group. Let L be the number of vertices in the GDD not in the group. Then c + c 4 + c 6 = 10 because each vertex appears in exactly 10 blocks of the GDD and c + 3c 4 + 5c 6 = L because each vertex must meet each of the vertices from the other groups. These two conditions are called regularity conditions. Subtracting the first regularity condition from the second we have c 6 L This gives another upper bound on the number of blocks of size six in the GDD: g L When there are no blocks of size six in the GDD, the solution to the system of regularity conditions is unique: Otherwise (c, c 4, c 6 ) = (c, c 4, c 6 ) = ( 1 (30 L), 1 ) (L 10), 0. ( 1 (30 L) + h, 1 ) (L 10) h, h for some h between 0 and the maximum number of blocks of size six in the GDD. The regularity conditions will now be used to exclude a GDD of type from embedding in a TD(6, 10). Proposition.9 A GDD of type does not embed in a TD (6, 10). Proof Complement the vertex sets of two groups to produce a GDD of type Any vertex in the largest group has to occur in blocks with 1 other vertices and must occur in exactly ten blocks. Thus there are no blocks of size six in the GDD. The conformation produced when the group of size eight is deleted has (b 0, b 1, b, b 3, b 4, b 5 ) = (13, 7,, 8, 5, 0). Let d 3 and d 4 be the numbers of blocks of sizes 3 and 4 that intersect the fifth group of the conformation. By counting pairs of vertices where one lies in the fifth group and one lies in one of the first four groups, 3d 4 + d 3 3. There are 5 d 4 blocks of size four and 8 d 3 blocks of size three containing only vertices from the first four groups. Counting pairs of vertices lying in two of the first four groups, 3d 4 + d 3 + 6(5 d 4 ) + 3(8 d 3 ) 4. This simplifies to 30 3d 4 + d 3. Thus 30 3d 4 + d 3 3. Since d 4 5andd 3 8, the only solution is d 4 = 5, d 3 = 8. Altogether this gives 13 blocks of size four through the fifth group of the GDD of type On the other hand the regularity conditions are c + c 4 = 10 and c + 3c 4 = 16 for a vertex in the fifth group of the GDD. This means that there are three blocks of size four through each vertex in the fifth group, a contradiction. A GDD of type does not embed in a TD(6, 10). Since a GDD embeds in a TD(6, 10) if and only if one complementable to it does, GDDs of type do not embed either. The Eleven Types of GDDs Possible in a TD(6, 10): The largest group is chosen for deletion. The maximum r value, that is the maximum number of blocks of size six in the GDD, is given where applicable. When r > 0 is possible, additional solutions are given by (b 0 r, b 1 + r, b + r, b 3 r, b 4 r, r). 1. GDD of type 4 4 with a group of size four deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (4, 36, 36, 4, 0, 0)
7 GDDs in MOLS of order Since the number of blocks through a vertex in the deleted group is always ten, and each deleted vertex has to pair with the 1 vertices from the other groups, each deleted vertex must appear in one block of size four and nine blocks of size two in the GDD. This applies no matter which group is chosen for deletion. This is just a restatement of the regularity conditions. Using just this structure, Howard and Myrvold [8] generated some examples of GDDs by computer and tried to extend them to a TD(4, 10). Several examples of GDDs embedded in a TD(4, 10) were found. Some of the corresponding nets had dim C (N 4 ) dim C (N 3 ) 6. These nets yielded counterexamples to Moorhouse s conjecture [11]that dim C p (N k ) dim C p (N k 1 ) n k + 1 for p any prime dividing the net s order at most once. Continuing with the classification:. GDD of type with a group of size six deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (4, 60, 1, 0, 4, 0) 3. GDD of type 4 3 with a group of size four deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (5, 36, 34, 4, 1, 0) 4. GDD of type with a group of size six deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (14, 48, 4, 1,, 0) 5. GDD of type 4 5 with a group of size four deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (15, 8, 4, 1, 3, 0) 6. GDD of type 6 with a group of size two deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (40, 0, 40, 0, 0, 0); r = 0byb 4 = 0 7. GDD of type 4 4 with a group of size four deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (6, 36, 3, 4,, 0); r = 0byg L 10 4 =0 8. GDD of type with a group of size six deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (15, 48,, 1, 3, 0); r 3byb 4 = 3 9. GDD of type 4 4 with a group of size four deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (16, 8, 40, 1, 4, 0); r 4 by two groups of size two 10. GDD of type with a group of size six deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (9, 36, 6, 4, 5, 0); r 5byb 4 = GDD of type 4 6 with a group of size four deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (10, 0, 40, 0, 10, 0); r 8byg L 10 4 =8 Each GDD listed above gives rise to a number of GDDs with a different type by complementing the vertex sets in an even number of groups. When investigating a specific GDD there is a trade-off between the ease of working with a GDD having a small vertex set versus the stringent restrictions imposed on a GDD with a large number of blocks of sizes four and six. For instance, the GDD of type 4 5 corresponds to: a GDD of type with a group of size six deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (7, 36, 30, 4, 3, 0) a GDD of type with a group of size six deleted: (b 0, b 1, b, b 3, b 4, b 5 ) = (3, 4, 30, 36, 7, 0) Varying the group size chosen for deletion provides the same information as the regularity conditions discussed above. Recently Delisle [5] determined by computer search that any TD(4, 10) containing GDDs corresponding to two or more linearly independent relations of type 4 4 does not extend to a
8 90 P. Dukes, L. Howard TD(5, 10). This work was motivated by the search for 3 MOLS(10). By Theorem.8, relations of type 4 4 are the only possible type of relations in a TD(4, 10), up to complementing vertices in an even number of groups. Thus there can be at most one non-trivial relation in any TD(4, 10) that extends to a TD(5, 10). In other words, any 4-net of order 10 which can be extended to a net of higher degree must have dim C (N 4 ) equal to 36 or Further results on dimension Some additional results on the dimensions of C (N k ) are established for nets of order 10. Implications for sets of MOLS(10) are also discussed. Proposition 3.1 If k is even or N k has a transversal, then dim C (N k )>dim C (N k 1 ) for any subnet N k 1 of N k. Proof Since k is even or N k has a transversal by Dougherty sn Theorem.1 and Lemma. the evenness condition applies to weights of parallel classes in any relation. This means that the codeword corresponding to any transversal of N k 1 lying in the kth parallel class must be linearly independent over C (N k 1 ). Proposition 3. If dim C (N 5 )<46 or dim C (N 6 )<47 for a net of order ten then there is a nontrivial relation in four or five classes of the net. Proof If dim C (N 5 )<46 = then there is a nontrivial relation in the net, which is necessarily a relation in at most five classes. If dim C (N 6 )<47 then any subnet N 5 has a transversal by the existence of N 6 and Proposition 3.1 applies to give dim C (N 5 ) < 47 1 = 46. This is a particularly useful result because only five of the GDD types in Theorem.8 contain vertices in at most five groups, and hence give a relation in at most five parallel classes. The combinatorial structure of these GDDs is well understood. Thus a proof of the nonexistence of 4 MOLS(10) could happen in two ways: by showing that the dimension of C (N 6 ) is too high and applying the dimension argument or by showing that the dimension of C (N 6 ) is low and showing that none of these five GDDs embed in a transversal design. Proposition 3.3 If N 6 is a 6-net satisfying dim C (N 6 ) = 53, and N 6 can be extended to a 7-net, N 7,thenN 7 has no transversal. Proof If dim C (N 6 ) = 53 then by Dougherty s Theorem.1, dimd (N 6 ) = 47 and dim D (N 6) = 53. Since C (N 6 ) D (N 6) this implies that C (N 6 ) = D (N 6). Any transversal of N 6 belongs to D (N 6) and therefore lies in C (N 6 ). A relation in N 7 with odd weight in the seventh parallel class is thus produced. This means that N 7 has no transversal. Corollary 3.4 If N 6 is a 6-net satisfying dim C (N 6 ) = 53, thenn 6 canbeextendedtoat most a 7-net, or equivalently to at most five MOLS of order 10. Proof By Proposition 3.3 the net N 7 has no transversal and certainly the net cannot extend to an eighth parallel class. Thus there are at most five MOLS(10). To conclude, it is worth mentioning that further structural results are possible for some of the GDDs listed here. This has been left to a separate study.
9 GDDs in MOLS of order Acknowledgments This research of the first author is supported by NSERC. Thanks to the referees for careful reading which helped greatly improve the presentation. References 1. Bose R.C., Shrikhande S.S.: On the falsity of Euler s conjecture about the non-existence of two orthogonal Latin squares of order 4t +. Proc. Natl Acad Sci. U.S.A. 45(5), (1959).. Bose R.C., Shrikhande S.S., Parker E.T.: Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler s conjecture. Can. J. Math. 1, (1960). 3. Bruck R.H.: Finite Nets II. Uniqueness and embedding. Pac. J. Math. 13, (1963). 4. Colbourn C.J., Dinitz J.H. (eds.): The CRC Handbook of Combinatorial Designs, nd edn. CRC Press, Boca Raton (006). 5. Delisle E.: The search for a triple of mutually orthogonal latin squares of order ten: looking through pairs of dimension thirty-five and less. M.Sc. Thesis, University of Victoria (010). 6. Dougherty S.T.: A coding theoretic solution to the 36 officer problem. Des. Codes Cryptogr. 4, 18 (1994). 7. Hall M. Jr.: Combinatorial Theory, nd edn. Wiley, New York (1986). 8. Howard L., Myrvold W.: A counterexample to Moorhouse s conjecture on the rank of nets. Bull. Inst. Combin. Appl. 60, (010). 9. Lam C., Thiel L., Swiercz S.: The non-existence of finite projective planes of order 10. Can. J. Math. XLI(6), (1989). 10. McKay B.D., Meynert A., Myrvold W.: Small Latin squares, quasigroups, and loops. J. Combin. Des. 15(), (006). 11. Moorhouse G.E.: Bruck nets, codes and characters of loops. Des. Codes Cryptogr. 1, 7 9 (1991). 1. Parker E.T.: Constructions of some sets of pairwise orthogonal Latin squares. Proc. Natl Acad Sci. U.S.A. 45, (1959). 13. Stinson D.R.: A short proof of the nonexistence of a pair of orthogonal Latin squares of order six. J. Combin. Theory Ser. A 36, (1984).
Latin 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 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 informationTransversal Designs in Classical Planes and Spaces. Aiden A. Bruen and Charles J. Colbourn. Computer Science. University of Vermont
Transversal Designs in Classical Planes and Spaces Aiden A. Bruen and Charles J. Colbourn Computer Science University of Vermont Burlington, VT 05405 U.S.A. Abstract Possible embeddings of transversal
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 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 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 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 informationcerin Delisle, 2010 University of Victoria
The Search for a Triple of Mutually Orthogonal Latin Squares of Order Ten: Looking Through Pairs of Dimension Thirty-Five and Less by Erin Delisle B.Sc., University of Victoria, 2005 A Thesis Submitted
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 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 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 informationSTEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS. Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 37(57)(2002), 259 268 STEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia Abstract. In this article
More informationarxiv: v2 [math.co] 6 Apr 2016
On the chromatic number of Latin square graphs Nazli Besharati a, Luis Goddyn b, E.S. Mahmoodian c, M. Mortezaeefar c arxiv:1510.051v [math.co] 6 Apr 016 a Department of Mathematical Sciences, Payame Noor
More informationNon-Extendible Latin Cuboids
Non-Extendible Latin Cuboids Darryn Bryant db@maths.uq.edu.au, Barbara Maenhaut bmm@maths.uq.edu.au Nicholas J. Cavenagh nicholas cavenagh@yahoo.co.uk Ian M. Wanless ian.wanless@monash.edu Kyle Pula jpula@math.du.edu
More informationThe 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 informationHadamard matrices of order 32
Hadamard matrices of order 32 H. Kharaghani a,1 B. Tayfeh-Rezaie b a Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, T1K3M4, Canada b School of Mathematics,
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 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 informationTHE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2)
THE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2) S. EL-ZANATI, H. JORDON, G. SEELINGER, P. SISSOKHO, AND L. SPENCE 4520 MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY NORMAL,
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 informationSome results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of
More informationExtending 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 informationSmall Group Divisible Steiner Quadruple Systems
Small Group Divisible Steiner Quadruple Systems Artem A. Zhuravlev, Melissa S. Keranen, Donald L. Kreher Department of Mathematical Sciences, Michigan Technological University Houghton, MI 49913-0402,
More informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
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 informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
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 informationQuasimultiples of Geometric Designs
Quasimultiples of Geometric Designs G. L. Ebert Department of Mathematical Sciences University of Delaware Newark, DE 19716 ebert@math.udel.edu Dedicated to Curt Lindner on the occasion of his 65th birthday
More informationFinite affine planes in projective spaces
Finite affine planes in projective spaces J. A.Thas H. Van Maldeghem Ghent University, Belgium {jat,hvm}@cage.ugent.be Abstract We classify all representations of an arbitrary affine plane A of order q
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 information5-Chromatic Steiner Triple Systems
5-Chromatic Steiner Triple Systems Jean Fugère Lucien Haddad David Wehlau March 21, 1994 Abstract We show that, up to an automorphism, there is a unique independent set in PG(5,2) that meet every hyperplane
More informationSOME SYMMETRIC (47,23,11) DESIGNS. Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 38(58)(2003), 1 9 SOME SYMMETRIC (47,23,11) DESIGNS Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia Abstract. Up to isomorphism there are precisely fifty-four
More informationThere 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 informationCodes, Designs and Graphs from the Janko Groups J 1 and J 2
Codes, Designs and Graphs from the Janko Groups J 1 and J 2 J. D. Key Department of Mathematical Sciences Clemson University Clemson SC 29634, U.S.A. J. Moori School of Mathematics, Statistics and Information
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 Non-existence of Finite Projective Planes of. Order 10. C. W. H. Lam, L. Thiel, and S. Swiercz. 15 January, 1989
The Non-existence of Finite Projective Planes of Order 10 C. W. H. Lam, L. Thiel, and S. Swiercz 15 January, 1989 Dedicated to the memory of Herbert J. Ryser Abstract This note reports the result of a
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 informationLatin 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 informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationAffine 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 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 informationinto 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 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 informationMUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS. 1. Introduction
MUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS JOHN LORCH Abstract For a class of linear sudoku solutions, we construct mutually orthogonal families of maximal size for all square orders, and
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationNew infinite families of Candelabra Systems with block size 6 and stem size 2
New infinite families of Candelabra Systems with block size 6 and stem size 2 Niranjan Balachandran Department of Mathematics The Ohio State University Columbus OH USA 4210 email:niranj@math.ohio-state.edu
More informationTHE PARTITION WEIGHT ENUMERATOR AND BOUNDS ON MDS CODES. T.L. Alderson Svenja Huntemann
Atlantic Electronic http://aem.ca Journal of Mathematics http://aem.ca/rema Volume 6, Number 1, Summer 2014 pp. 1-10 THE PARTITION WEIGHT ENUMERATOR AND BOUNDS ON MDS CODES T.L. Alderson Svena Huntemann
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationIsotropic matroids III: Connectivity
Isotropic matroids III: Connectivity Robert Brijder Hasselt University Belgium robert.brijder@uhasselt.be Lorenzo Traldi Lafayette College Easton, Pennsylvania 18042, USA traldil@lafayette.edu arxiv:1602.03899v2
More informationHadamard matrices of order 32
Hadamard matrices of order 32 H. Kharaghani a,1 B. Tayfeh-Rezaie b a Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, T1K3M4, Canada b School of Mathematics,
More informationExistence of six incomplete MOLS
Existence of six incomplete MOLS Charles J. Colbourn and L. Zhu * Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada N2L 301 Abstract Six mutually orthogonal
More informationSteiner Triple Systems Intersecting in Pairwise Disjoint Blocks
Steiner Triple Systems Intersecting in Pairwise Disjoint Blocks Yeow Meng Chee Netorics Pte Ltd 130 Joo Seng Road #05-02 Olivine Building Singapore 368357 ymchee@alumni.uwaterloo.ca Submitted: Feb 18,
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 informationSmall Orders of Hadamard Matrices and Base Sequences
International Mathematical Forum, Vol. 6, 2011, no. 62, 3061-3067 Small Orders of Hadamard Matrices and Base Sequences Dragomir Ž. D oković Department of Pure Mathematics and Institute for Quantum Computing
More informationSYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN. Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 35(55)(2000), 271 281 SYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia Abstract.
More informationGeneralized Quadrangles Weakly Embedded in Finite Projective Space
Generalized Quadrangles Weakly Embedded in Finite Projective Space J. A. Thas H. Van Maldeghem Abstract We show that every weak embedding of any finite thick generalized quadrangle of order (s, t) in a
More informationPARTITIONS OF FINITE VECTOR SPACES INTO SUBSPACES
PARTITIONS OF FINITE VECTOR SPACES INTO SUBSPACES S.I. EL-ZANATI, G.F. SEELINGER, P.A. SISSOKHO, L.E. SPENCE, AND C. VANDEN EYNDEN Abstract. Let V n (q) denote a vector space of dimension n over the field
More informationUniform semi-latin squares and their Schur-optimality
Uniform semi-latin squares and their Schur-optimality Leonard H. Soicher School of Mathematical Sciences Queen Mary University of London Mile End Road, London E1 4NS, UK L.H.Soicher@qmul.ac.uk September
More informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationMinimal perfect bicoverings of K v with block sizes two, three and four
Minimal perfect bicoverings of K v with block sizes two, three and four M.J. Grannell and T.S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM
More informationOn small minimal blocking sets in classical generalized quadrangles
On small minimal blocking sets in classical generalized quadrangles Miroslava Cimráková a Jan De Beule b Veerle Fack a, a Research Group on Combinatorial Algorithms and Algorithmic Graph Theory, Department
More informationOrdering and Reordering: Using Heffter Arrays to Biembed Complete Graphs
University of Vermont ScholarWorks @ UVM Graduate College Dissertations and Theses Dissertations and Theses 2015 Ordering and Reordering: Using Heffter Arrays to Biembed Complete Graphs Amelia Mattern
More informationLax embeddings of the Hermitian Unital
Lax embeddings of the Hermitian Unital V. Pepe and H. Van Maldeghem Abstract In this paper, we prove that every lax generalized Veronesean embedding of the Hermitian unital U of PG(2, L), L a quadratic
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationarxiv: v1 [math.co] 14 Jan 2016
The Cameron-Liebler problem for sets Maarten De Boec, Leo Storme and Andrea Švob arxiv:1601.03628v1 [math.co] 14 Jan 2016 Abstract Cameron-Liebler line classes and Cameron-Liebler -classes in PG(2 + 1,
More informationAn enumeration of equilateral triangle dissections
arxiv:090.599v [math.co] Apr 00 An enumeration of equilateral triangle dissections Aleš Drápal Department of Mathematics Charles University Sokolovská 83 86 75 Praha 8 Czech Republic Carlo Hämäläinen Department
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 informationHadamard matrices and strongly regular graphs with the 3-e.c. adjacency property
Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property Anthony Bonato Department of Mathematics, Wilfrid Laurier University, Waterloo, Ontario, Canada, N2L 3C5 abonato@wlu.ca
More informationSome properties of latin squares - Study of mutually orthogonal latin squares
Some properties of latin squares - Study of mutually orthogonal latin squares Jeranfer Bermúdez University of Puerto Rico, Río Piedras Computer Science Department Lourdes M. Morales University of Puerto
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
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 informationEvery SOMA(n 2, n) is Trojan
Every SOMA(n 2, n) is Trojan John Arhin 1 Marlboro College, PO Box A, 2582 South Road, Marlboro, Vermont, 05344, USA. Abstract A SOMA(k, n) is an n n array A each of whose entries is a k-subset of a knset
More informationTriangle-free graphs with no six-vertex induced path
Triangle-free graphs with no six-vertex induced path Maria Chudnovsky 1, Paul Seymour 2, Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia University, New York, NY 10027 June
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationDIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH
DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH HEATHER JORDON AND JOY MORRIS Abstract. In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete
More informationEmbeddings of Small Generalized Polygons
Embeddings of Small Generalized Polygons J. A. Thas 1 H. Van Maldeghem 2 1 Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, jat@cage.rug.ac.be 2 Department
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 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 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 informationThe candidates are advised that they must always show their working, otherwise they will not be awarded full marks for their answers.
MID SWEDEN UNIVERSITY TFM Examinations 2006 MAAB16 Discrete Mathematics B Duration: 5 hours Date: 7 June 2006 There are EIGHT questions on this paper and you should answer as many as you can in the time
More information#A30 INTEGERS 17 (2017) CONFERENCE MATRICES WITH MAXIMUM EXCESS AND TWO-INTERSECTION SETS
#A3 INTEGERS 7 (27) CONFERENCE MATRICES WITH MAIMUM ECESS AND TWO-INTERSECTION SETS Koji Momihara Faculty of Education, Kumamoto University, Kurokami, Kumamoto, Japan momihara@educ.kumamoto-u.ac.jp Sho
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationUnmixed Graphs that are Domains
Unmixed Graphs that are Domains Bruno Benedetti Institut für Mathematik, MA 6-2 TU Berlin, Germany benedetti@math.tu-berlin.de Matteo Varbaro Dipartimento di Matematica Univ. degli Studi di Genova, Italy
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 informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationTrades in complex Hadamard matrices
Trades in complex Hadamard matrices Padraig Ó Catháin Ian M. Wanless School of Mathematical Sciences, Monash University, VIC 3800, Australia. February 9, 2015 Abstract A trade in a complex Hadamard matrix
More informationDivisible Design Graphs
Divisible Design Graphs Willem H. Haemers Department of Econometrics and Operations Research, Tilburg University, The Netherlands Hadi Kharaghani Department of Mathematics and Computer Science, University
More informationRepresentations of disjoint unions of complete graphs
Discrete Mathematics 307 (2007) 1191 1198 Note Representations of disjoint unions of complete graphs Anthony B. Evans Department of Mathematics and Statistics, Wright State University, Dayton, OH, USA
More informationTwisted Projective Spaces and Linear Completions of some Partial Steiner Triple Systems
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 49 (2008), No. 2, 341-368. Twisted Projective Spaces and Linear Completions of some Partial Steiner Triple Systems Ma lgorzata
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More informationCharacterizations of the finite quadric Veroneseans V 2n
Characterizations of the finite quadric Veroneseans V 2n n J. A. Thas H. Van Maldeghem Abstract We generalize and complete several characterizations of the finite quadric Veroneseans surveyed in [3]. Our
More informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
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 informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationGeneralized covering designs and clique coverings
Generalized covering designs and clique coverings Robert F. Bailey, Andrea C. Burgess, Michael S. Cavers, Karen Meagher March 14, 2011 Abstract Inspired by the generalized t-designs defined by Cameron
More informationBlocking Sets in Designs with Block Size 4
Europ. J. Combinatorics (1990) 11,451-457 Blocking Sets in Designs with Block Size 4 D. G. HOFFMAN, C. C. LINDNER AND K. T. PHELPS We construct A-fold block designs with block size 4 and A E {1, 2} of
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 informationOn the size of autotopism groups of Latin squares.
On the size of autotopism groups of Latin squares. Douglas Stones and Ian M. Wanless School of Mathematical Sciences Monash University VIC 3800 Australia {douglas.stones, ian.wanless}@sci.monash.edu.au
More information