Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture

04/03/2018
by   Curtis Bright, et al.
0

We employ tools from the fields of symbolic computation and satisfiability checking---namely, computer algebra systems and SAT solvers---to study the Williamson conjecture from combinatorial design theory and increase the bounds to which Williamson matrices have been enumerated. In particular, we completely enumerate all Williamson matrices of even order up to and including 70 which gives us deeper insight into the behaviour and distribution of Williamson matrices. We find that, in contrast to the case when the order is odd, Williamson matrices of even order are quite plentiful and exist in every even order up to and including 70. As a consequence of this and a new construction for 8-Williamson matrices we construct 8-Williamson matrices in all odd orders up to and including 35. We additionally enumerate all Williamson matrices whose orders are divisible by 3 and less than 70, finding one previously unknown set of Williamson matrices of order 63.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2018

Applying Computer Algebra Systems with SAT Solvers to the Williamson Conjecture

We employ tools from the fields of symbolic computation and satisfiabili...
research
11/13/2018

A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples

We enumerate all circulant good matrices with odd orders divisible by 3 ...
research
07/11/2019

The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices

In this paper, we provide an overview of the SAT+CAS method that combine...
research
05/14/2018

Enumeration of Complex Golay Pairs via Programmatic SAT

We provide a complete enumeration of all complex Golay pairs of length u...
research
07/27/2019

Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT

We use techniques from the fields of computer algebra and satisfiability...
research
06/23/2023

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem

One of the fundamental results in quantum foundations is the Kochen-Spec...
research
01/03/2021

Matrix constructs

Matrices can be built and designed by applying procedures from lower ord...

Please sign up or login with your details

Forgot password? Click here to reset