Comments on "Multidimensional Costas Arrays and Their Periodicity"

Get email updates

Shiv Munagala

Munagala gives a periodic Costas array with six dots in a 2×3×2×32 \times 3 \times 2 \times 3 box. It is the graph of a bijection from [2]×[3][2] \times [3] to [2]×[3][2] \times [3], and every translated window of its periodic extension has distinct ordinary integer difference vectors. Its order 6 differs from the conjectured 22=42^{2} = 4, refuting Rubio and Torres’s Conjecture 1 in dimension four.

What was already known

Taylor proved the two-dimensional non-existence result. Rubio and Torres extended it to dimension three and conjectured that, when the domain has at least as many dimensions as the image, every periodic Costas bijection has order 2k2^{k}, where k is the domain dimension.

AI involvement AI-centered

Munagala reports that the counterexample was found by computer search carried out with Claude’s assistance. Claude wrote the verification script, Lean proof and first draft. Munagala checked the elementary argument by hand and reviewed and edited the manuscript. The disclosure supports central AI participation in finding the retained construction, without establishing task-only autonomy.

Importance Notable

The six-dot construction refutes the published general conjecture in the smallest dimension not settled by the earlier results. It also attains equality in Rubio and Torres’s pigeonhole bound, showing that this bound cannot be strengthened by the same argument.

Technical verification Formal (Lean 4; exact computation + human)

Munagala reports checking the elementary argument by hand. The script checks all 36 residue windows and offsets in {−6,…,6}4\{-6,\ldots,6\}^4. The paper reports a Lean 4 kernel check using decide +kernel and only the standard axioms propext, Classical.choice and Quot.sound. The accessible formal definition uses one-based boxes, ordinary integer differences and all integer window offsets. Jaziel Torres is credited with confirming agreement with the original periodic-Costas definition. These checks are source-reported.

Formal checking

Munagala reports checking the elementary argument by hand. The script checks all 36 residue windows and offsets in {−6,…,6}4\{-6,\ldots,6\}^4. The paper reports a Lean 4 kernel check using decide +kernel and only the standard axioms propext, Classical.choice and Quot.sound. The accessible formal definition uses one-based boxes, ordinary integer differences and all integer window offsets. Jaziel Torres is credited with confirming agreement with the original periodic-Costas definition. These checks are source-reported.

Checker
Shiv Munagala; reported Lean 4 kernel and exact script
Scope
Six-dot counterexample and all-offset periodicity
Basis
Reported by the linked checker

Human understanding Explained

Munagala explains why periodicity reduces every integer-offset window to one of 36 residue windows, each with six dots and 30 distinct ordered differences. Translation preserves these differences. The paper also explains why repeated toroidal differences do not invalidate the construction and how it saturates the earlier counting bound.

Correction and publication history

2026-11-06 · publication

Newly source-reviewed counterexample with documented central Claude-assisted search and reported human and machine checks.

Read this published revision