Exact 1-perfect-code classification of the fourth-order generalized Fibonacci cubes
Year: 2026
Type: preprint
Abstract: Research No.74. For every integer n >= 1, the fourth-order generalized Fibonacci cube Q_n(1111), induced by binary words avoiding 1111, has a 1-perfect code if and only if n = 1 or n = 3. The infinite classification is proved analytically; finite checks are corroboration. Ryutaro Yonezu — Independent Researcher. AI-assisted; NOT PEER REVIEWED; NOVELTY INCONCLUSIVE; REFERENCES PARTIAL. An independent AI mathematical audit of the frozen v0.1 proof reported PASS, the author reported Windows FULL PASS for v0.1, and the v0.2 editorial differential passed. Neither is a new run of this v1.0 wrapper. No proof-assistant formal verification and no priority claim. The result covers fixed order s = 4 only and does not classify all s >= 5. Version 1.0. Copyright (c) 2026 Ryutaro Yonezu. All rights reserved. Public access grants no open license. The manuscript and reproduction assets are attached. GitHub repository: https://github.com/yonezaemon1-hub/no74-tetranacci-cube-perfect-codes
Author: Yonezu, Ryutaro
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236417774
