A feasibility approach for constructing combinatorial designs of circulant type

Francisco J. Aragón Artacho (), Rubén Campoy (), Ilias Kotsireas () and Matthew K. Tam ()
Additional contact information
Francisco J. Aragón Artacho: University of Alicante
Rubén Campoy: University of Alicante
Ilias Kotsireas: Wilfrid Laurier University
Matthew K. Tam: Universität Göttingen

Journal of Combinatorial Optimization, 2018, vol. 35, issue 4, No 4, 1085 pages

Abstract: Abstract In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas–Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler’s table.

Keywords: Strassler’s table; Circulant weighing matrices; Circulant combinatorial designs; Douglas–Rachford algorithm (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0250-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:4:d:10.1007_s10878-018-0250-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0250-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().