The paper “Constructing Orthogonal Designs in Powers of Two: Groebner Bases Meet Equational Unification” by Dimitris E. Simos (SBA Research, Austria), Ilias Kotsireas (Wilfrid Laurier University, Canada), Temur Kutsia (RISC – Johannes Kepler University, Austria) has been accepted for publication in 26th International Conference on Rewriting Techniques and Applications (RTA 2015). RTA is the premium venue for rewriting techniques on computation theory and mathematics.
RTA 2015 takes place from June 29 – July 1, 2015 in Warsaw, Poland.
Abstract: In the past few decades, design theory has grown to encompass a wide variety of research directions. It comes as no surprise that applications in coding theory and communications continue to arise, and also that designs have found applications in new areas. Computer science has provided a new source of applications of designs, and simultaneously a field of new and challenging problems in design theory. In this paper, we revisit a construction for orthogonal designs using the multiplication tables of Cayley-Dickson algebras of dimension $2^n$. The desired orthogonal designs can be described by a system of equations with the aid of a Groebner basis computation. For orders greater than 16 the combinatorial explosion of the problem gives rise to equations that are unfeasible to be tackled by traditional search algorithms. However, the structural properties of the designs make this problem possible to be tackled in terms of rewriting techniques, by equational unification. We establish connections between central concepts of design theory and equational unification where equivalence operations of designs point to the computation of a minimal complete set of unifiers. These connections make feasible the computation of some types of orthogonal designs that have not been found before with the aforementioned algebraic modelling.