The Rendering–Golay Functor: An M12-Equivariant Bridge from the Rendering Algebra to the Extended Binary Golay Code via the Hexacode

Read full text Summarise with VIRAT
Authors: Han-Jun Lim
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

AbstractOpen Problem 7 of the Rendering Category Theory paper [1] asks whether a functor F : Rend12 → CodeF2exists mapping the optimal rendering algebra R12 to the extended binary Golay code C24, preserving the parameter triple[ψ(12), 12, ⌊1/S⌋] = [24, 12, 8]. This paper answers in the affirmative by constructing an explicit M12-equivariant correspondence F = F2 ◦ F1 factoring through the hexacode H6 = [6, 3, 4]F4 . The construction uses no new axioms: every arrow is standard mathematics (Chinese Remainder Theorem, Skolem–Noether, Mathieu 1861, Conway–Sloane hexacode construction, alphabet expansion). The parameter preservation is proved as follows: 24 = 4 × 6 and 12 = 4 × 3 from the F4-to-F2 alphabet expansion of the hexacode; 8 = 2×4 where 4 is the MDS minimum distance of the hexacode (forced by the CRT decomposition 12 = 3 × 4 and the Singleton bound) and 2 = [F4 : F2]. A uniqueness theorem is proved: n = 12 is the only integer n ≥ 4 for which ⌊1/S(n, Zn)⌋ equals the MDS alphabet-expanded distance.The proof combines an exhaustive computation for n ≤ 23 with an analytic bound for n ≥ 24. This resolves Open Problem 7 completely

Fields of Study & Subjects

Coding theory and cryptography Finite Group Theory Research Advanced Combinatorial Mathematics

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
23 March 2026
Language
EN
Document type
Preprint