Packing Costas arrays

zbMATH Open1277.05022arXiv1102.1332MaRDI QIDQ2895355FDOQ2895355

Authors: J. H. Dinitz, Patric R. J. Östergård, D. R. Stinson 

Publication date: 2 July 2012

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Abstract: A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point of view. A complete classification is carried out up to order 27. In this range, we verify the conjecture that there is no Costas latin square for any odd order n >= 3. Various other related combinatorial structures are also considered, including near Costas latin squares (which are certain packings of near Costas arrays) and Vatican Costas squares.

Full work available at URL: https://arxiv.org/abs/1102.1332

Recommendations

• On maximal partial costas Latin squares
• scientific article; zbMATH DE number 874506
• Construction and properties of Costas arrays.
• scientific article; zbMATH DE number 4145919
• Structural properties of Costas arrays

zbMATH Keywords

Costas arraypacking

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Cited In (10)

• Enumeration of parallelograms in permutation matrices for improved bounds on the density of Costas arrays
• Title not available (Why is that?)
• Title not available (Why is that?)
• Investigating the existence of Costas Latin squares via satisfiability testing
• Open problems in Costas arrays
• Title not available (Why is that?)
• Interlaced Costas arrays do not exist
• Parity properties of Costas arrays defined via finite fields
• Title not available (Why is that?)
• On maximal partial costas Latin squares

This page was built for publication: Packing Costas arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895355)