A 45-letter word refuting the toroidal-grid representation-number conjecture of Alshammari, Kitaev and Pyatkin (arXiv:2507.16469, Conjecture 1)

Myeongjin Kang

Abstract

Alshammari-Kitaev-Pyatkin Conjecture 1: R(C_m □ C_n) ≥ 4 for m, n ≥ 3 and m + n ≥ 8. False at (3, 5): an explicit 45-letter 3-uniform word represents C_3 □ C_5, so its representation number is at most 3.

AI-assisted research preprint. The scoped main statement has a Lean certificate. Internal AI review is not external journal peer review; bounded prior-art searches do not certify worldwide priority. See the paper for exact qualifications and formalization limits.

8

Supplementary files

  • proof-sources.json2.6 KBOpen
  • extract_sources.py430 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 369421. Proof sources are attached as proof-sources.json (gzip-compressed, base64-encoded file contents); extract_sources.py reconstructs all archived files. Original archive SHA-256: 9f16ff5afa9a23b693443c0916507a8103bef5f23e431ca6c39e8cb4e7318200.

Version history

Discussion 0