Name
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 ofBlackburn, Etzion, Martin and Paterson has shown that (in contrast to thesituation for Costas arrays) there are only finitely many examples of honeycombarrays, though their bound on the maximal size of a honeycomb array is toolarge to permit an exhaustive search over all possibilities. The present paper contains a theorem that significantly limits the number ofpossibilities for a honeycomb array (in particular, the theorem implies thatthe number of dots in a honeycomb array must be odd). Computer searches forhoneycomb arrays are summarised, and two new examples of honeycomb arrays with15 dots are given. |
Year | Venue | DocType |
|---|---|---|
2010 | Electr. J. Comb. | Journal |
Volume | Issue | Citations |
17 | 1 | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon R. Blackburn | 1 | 357 | 36.95 |
| Anastasia Panoui | 2 | 10 | 1.23 |
| Maura B. Paterson | 3 | 164 | 17.08 |
| Douglas R. Stinson | 4 | 2387 | 274.83 |