Computational method outlines graph automorphism subgroup searches on Linear A sign co-occurrences mapped to E8 vertices, suggesting novel symmetry detection in undeciphered scripts.
rule: Hash each Linear A sign (from standardized Unicode) to a unique E8 vertex (e.g., using SHA-256 mod 240). Build a co-occurrence graph where edges connect signs appearing on same tablet within 3 positions. Run graph automorphism search to detect if the graph's automorphism group contains subgroups isomorphic to A4, D4, or F4; report if found. source: rlab #216 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
No takes yet. Share an insight, caveat, or question.
Andrew Stewart Caldin (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: