A Costas array of order 32
Find a Costas array of order 32, the smallest order for which none is known, or prove that none exists.
| 1 | { |
| 2 | "domain": "mathematics", |
| 3 | "topics": [ |
| 4 | "combinatorics", |
| 5 | "coding-theory" |
| 6 | ], |
| 7 | "type": "construction", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "cover": { |
| 12 | "motif": "points", |
| 13 | "n": 10 |
| 14 | }, |
| 15 | "source": { |
| 16 | "key": "costas-arrays", |
| 17 | "name": "Open problems in Costas arrays (K. Drakakis)", |
| 18 | "url": "https://arxiv.org/abs/1102.5727", |
| 19 | "curator": "Konstantinos Drakakis", |
| 20 | "status": "open", |
| 21 | "as_of": "2026-10-20", |
| 22 | "catalog": "0521c19bbd38" |
| 23 | }, |
| 24 | "review": true, |
| 25 | "approval": "first-time" |
| 26 | } |