Answers are grounded in this paper and cite their sources.
Research No.77. Ryutaro Yonezu, Independent Researcher. Unrefereed analytic preprint v1.0, 19 November 2026. For all integers k ≥ 3 and n ≥ 2, with A_n^(k) the number of length-n binary words avoiding k consecutive ones, gp_e(Q_n(1^k)) = 2(A_n^(k) − A_(n−1)^(k)). For n ≥ k+1, Θ_1 ∪ Θ_n is the unique maximum set; for 2 ≤ n ≤ k, all maxima are exactly unions of two distinct complete coordinate classes. The proof is analytic; finite checks corroborate it and are not premises. Author-provided full-response independent AI audit record: PACKAGE/MODEL/PROJECTION/STAR/DENSITY/PROBABILITY PASS, COMPUTATION PASS within its range, THEOREM CONDITIONAL PASS / UNIQUENESS CONDITIONAL PASS. The original answer was not independently compared verbatim, the auditor’s independent code was not obtained, and the auditor’s historical PUBLICATION HOLD is retained. The author explicitly approved conditional preprint publication and the G3 evidence exception. NOVELTY INCONCLUSIVE / REFERENCES PARTIAL / NOT HUMAN PEER REVIEWED.
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: