Blackburn, Simon (2010) Honeycomb Arrays. The Electronic Journal of Combinatorics, 17 (). pp. . ISSN 1077-8926
Full text access: Open
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.
This is a Published version This version's date is: 10/12/2010 This item is peer reviewed
https://repository.royalholloway.ac.uk/items/021a45a9-54d2-2c84-2c04-c0f02e150c6e/1/
Deposited by () on 16-Dec-2010 in Royal Holloway Research Online.Last modified on 16-Dec-2010
First published inĀ The Electronic Journal of CombinatoricsĀ in volume 17, 2010, published by the American Mathematical Society.