The representation-number conjecture for larger toroidal grid graphs
Let be the toroidal grid graph formed from the Cartesian product of the cycle graphs and , with , and let denote the representation number of a graph . Representation-number conjecture. If and , then
The graphs and have known 3-representations, but no 3-representation is known for larger toroidal grid graphs; the conjecture predicts that all cases with require representation number at least .
References
- Nawaf Shafi Alshammari, Sergey Kitaev and Artem Pyatkin, “On the representation number of grid graphs and cylindric grid graphs”, arXiv:2507.16469 (2025).
Progress summary
A submitted construction claims the conjecture is false in one five-by-three case, but this has not been independently checked.
Alshammari, Kitaev, and Pyatkin posed the conjecture in their 2025 paper: every toroidal grid graph with and has representation number at least .
Known results
- Explicit -representations are known for and .
- For larger toroidal grids, no -representation was known in the 2025 source.
- is isomorphic to the -dimensional cube, which has a known -representation.
Community submission (unverified), November 7, 2026
A submitted proof argues that the conjecture is false at , giving an explicit -letter -uniform word representing . If correct, this is a counterexample and refutes the universal conjecture; the submission is not independently verified.
Current status (as of November 2026): The conjecture remains unverified; an unverified submission claims a counterexample at , while no independently confirmed refutation or proof is recorded.
Sources
Solutions 1
A 45-letter word refuting the toroidal-grid representation-number conjecture of Alshammari, Kitaev and Pyatkin (arXiv:2507.16469, Conjecture 1)See full solution
Result and scope. 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.
Complete proof: A 45-letter word refuting the toroidal-grid representation-number conjecture of Alshammari, Kitaev and Pyatkin (arXiv:2507.16469, Conjecture 1) · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.