| |
| |
| Preface | |
| |
| |
| |
| The Existence of 2-SOLSSOMs | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Direct Constructions | |
| |
| |
| |
| Recursive Constructions | |
| |
| |
| |
| Conjugate Orthogonal Diagonal Latin Squares with Missing Subsquares | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Preliminaries | |
| |
| |
| |
| Direct Construction | |
| |
| |
| |
| Recursive Construction | |
| |
| |
| |
| A General Bound | |
| |
| |
| |
| The Case 2 [less than or equal] n [less than or equal] 6 | |
| |
| |
| |
| Combinatorial Trades: a Survey of Recent Results | |
| |
| |
| |
| |
| Introduction and Preliminaries | |
| |
| |
| |
| Trades in designs | |
| |
| |
| |
| Trades in latin squares | |
| |
| |
| |
| Trade uses | |
| |
| |
| |
| Latin representations and trades used in tripartite decompositions | |
| |
| |
| |
| [mu]-way trades | |
| |
| |
| |
| Graphical trades | |
| |
| |
| |
| Future directions | |
| |
| |
| |
| Two-stage Generalized Simulated Annealing for the Construction of Change-Over Designs | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Notation and Definitions | |
| |
| |
| |
| A Two Stage Generalized Simulated Annealing Algorithm | |
| |
| |
| |
| Performance of the Two-Stage GSA | |
| |
| |
| |
| New Lower Bounds on the Maximum Number of Mutually Orthogonal Steiner Triple Systems | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Starters over Finite Fields | |
| |
| |
| |
| Automorphisms and Hill-climbing | |
| |
| |
| |
| Conclusion | |
| |
| |
| |
| On minimal defining sets in AG(d, 3) | |
| |
| |
| |
| |
| Background | |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Further Preliminaries | |
| |
| |
| |
| Proof of the Main Theorem | |
| |
| |
| |
| Sets of good hyperplanes in AG(d, 3) | |
| |
| |
| |
| Related critical sets | |
| |
| |
| |
| Appendix | |
| |
| |
| |
| Hadamard Matrices, Orthogonal designs and Construction Algorithms | |
| |
| |
| |
| |
| Algorithms for constructing Hadamard matrices | |
| |
| |
| |
| On inequivalent Hadamard matrices | |
| |
| |
| |
| Algorithms for constructing orthogonal designs | |
| |
| |
| |
| Short amicable sets and Kharaghani type orthogonal designs | |
| |
| |
| |
| Constructing a Class of Designs with Proportional Balance | |
| |
| |
| |
| |
| Proportionally balanced designs | |
| |
| |
| |
| The method of construction | |
| |
| |
| |
| Feasible parameters for [alpha] = 2, 3 and 4 | |
| |
| |
| |
| Constructions motivated by Construction 5 | |
| |
| |
| |
| Constructions Using Balanced n-ary Designs | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Balanced n-ary Designs | |
| |
| |
| |
| Our Construction | |
| |
| |
| |
| Some Examples | |
| |
| |
| |
| Some Non-existence Results | |
| |
| |
| |
| An Improved Construction | |
| |
| |
| |
| Quadratic Residues | |
| |
| |
| |
| Another Improvement | |
| |
| |
| |
| An Application | |
| |
| |
| |
| More Difference Families | |
| |
| |
| |
| Sets of Steiner Triple Systems of Order 9 Revisited | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Large sets | |
| |
| |
| |
| Results | |
| |
| |
| |
| Uniformly intersecting sets | |
| |
| |
| |
| Solving Isomorphism Problems for t-Designs | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Basics | |
| |
| |
| |
| Moebius Inversions | |
| |
| |
| |
| Extensions of designs | |
| |
| |
| |
| Finding Double Youden Rectangles | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Definitions and Literature | |
| |
| |
| |
| Examples | |
| |
| |
| |
| Searching for a 13-cyclic 13 X 40 DYR | |
| |
| |
| |
| Isomorphism | |
| |
| |
| |
| Further Properties of our new DYRs | |
| |
| |
| |
| Check for Balance | |
| |
| |
| |
| Kirkman Triple Systems and their Generalizations: A Survey | |
| |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Constructions for Kirkman Triple Systems and Nearly Kirkman Triple Systems for all admissible orders | |
| |
| |
| |
| Early Generalizations | |
| |
| |
| |
| Resolvable Packings and Coverings of v points where v [not identical with] 0 (mod 3) | |
| |
| |
| |
| Other Generalizations | |
| |
| |
| |
| Conclusion and Acknowledgements | |