Honeycomb arrays

zbMATH Open1201.05017arXiv0911.2384MaRDI QIDQ612962FDOQ612962

Authors: Simon R. Blackburn, Anastasia Panoui, Maura Paterson, D. R. Stinson 

Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Two-Dimensional Honeycombs
• Hyperbolic honeycomb
• Honeycomb networks
• Some series of honey-comb spaces
• Packing in honeycomb networks
• Four dimensional honeycomb
• Visualizing hyperbolic honeycombs
• Honeycomb toroidal graphs

zbMATH Keywords

Costas arrayhoneycomb array

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cited In (2)

• Honeycomb-Lattice Minnaert Bubbles
• Some series of honey-comb spaces

This page was built for publication: Honeycomb arrays

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