{"title":"SAT+CAS范式和Williamson猜想","authors":"Curtis Bright, I. Kotsireas, Vijay Ganesh","doi":"10.1145/3313880.3313889","DOIUrl":null,"url":null,"abstract":"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 orders divisible by 2 or 3 up to and including 70. We find one previously unknown set of Williamson matrices of order 63 and construct Williamson matrices in every even order up to and including 70. This extended abstract outlines a preprint currently under submission [4].","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"93 1","pages":"82-84"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The SAT+CAS paradigm and the Williamson conjecture\",\"authors\":\"Curtis Bright, I. Kotsireas, Vijay Ganesh\",\"doi\":\"10.1145/3313880.3313889\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 orders divisible by 2 or 3 up to and including 70. We find one previously unknown set of Williamson matrices of order 63 and construct Williamson matrices in every even order up to and including 70. This extended abstract outlines a preprint currently under submission [4].\",\"PeriodicalId\":7093,\"journal\":{\"name\":\"ACM Commun. Comput. Algebra\",\"volume\":\"93 1\",\"pages\":\"82-84\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Commun. Comput. Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3313880.3313889\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Commun. Comput. Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3313880.3313889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The SAT+CAS paradigm and the Williamson conjecture
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 orders divisible by 2 or 3 up to and including 70. We find one previously unknown set of Williamson matrices of order 63 and construct Williamson matrices in every even order up to and including 70. This extended abstract outlines a preprint currently under submission [4].
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
