Answers are grounded in this paper and cite their sources.
Research No.78. Ryutaro Yonezu (Independent Researcher). Unrefereed AI-assisted preprint, version 1.0, 20 November 2026. For every integer n >= k >= 3, the edge general position number of the cyclic run-avoiding cube H(n,k) equals 2(C_n^(k) - A_(n-1)^(k)); all maximum sets are unions of two distinct complete coordinate edge classes. The proof for k >= 4 is analytic. For k = 3 it combines 1,296 exact transfer-matrix bases, exhaustive n=4 classification, and analytic strong induction. The frozen v0.1 parent and v0.2 supplement are reproduced in full. Independent AI mathematical audit reported THEOREM / UNIQUENESS CONDITIONAL PASS within its documented scope, with no mathematical defect detected. Four optional SAT cases were INCOMPLETE, not used as premises. Auditor PUBLICATION PRIVATE HOLD is retained as a historical recommendation; the author separately authorized conditional publication. Direct auditor identity verification and verbatim chat comparison were not performed. Human peer review and proof-assistant formalization have not been performed. NOVELTY INCONCLUSIVE / REFERENCES PARTIAL / NOT HUMAN PEER REVIEWED. The model is a generalized Lucas cube in the sense of Ilic, Klavzar and Rho (2012), DOI 10.2298/AADM120108002I. Klavzar and Tan (2023), DOI 10.1007/s40840-023-01517-y, cover ordinary Fibonacci and Lucas cubes. Mollard (2020), arXiv:2004.10198, concerns perfect codes. No priority claim. Copyright (c) 2026 Ryutaro Yonezu. All rights reserved; no Creative Commons or open-source license. GitHub repository: https://github.com/yonezaemon1-hub/cyclic-run-avoiding-cubes-edge-general-position
No takes yet. Share an insight, caveat, or question.
Ryutaro Yonezu (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: