Thumbnail
Access Restriction
Open

Author Blackburn, Simon R. ♦ Panoui, Anastasia ♦ Paterson, Maura B. ♦ Stinson, Douglas R.
Source arXiv.org
Content type Text
File Format PDF
Date of Submission 2009-11-12
Language English
Subject Domain (in DDC) Natural sciences & mathematics ♦ Mathematics
Subject Keyword Mathematics - Combinatorics ♦ 05B10 ♦ 94C30 ♦ math
Abstract A honeycomb array is an analogue of a Costas array in the hexagonal grid; they were first studied by Golomb and Taylor in 1984. A recent result of Blackburn, Etzion, Martin and Paterson has shown that (in contrast to the situation for Costas arrays) there are only finitely many examples of honeycomb arrays, though their bound on the maximal size of a honeycomb array is too large to permit an exhaustive search over all possibilities. The present paper contains a theorem that significantly limits the number of possibilities for a honeycomb array (in particular, the theorem implies that the number of dots in a honeycomb array must be odd). Computer searches for honeycomb arrays are summarised, and two new examples of honeycomb arrays with 15 dots are given.
Educational Use Research
Learning Resource Type Article
Page Count 12


Open content in new tab

   Open content in new tab