EOA Symbolic Sequence: Letter 'a', LCR ≈ 3.14 – Sublinear Factor Complexity and Consistent With Zero Entropy v1

Abstract

This record contains the first 6,260 letters of a deterministic symbolic sequence generated from the English letter name 'a' using the EOA recursive operator. The sequence is not random; it is the output of a fixed deterministic process. Key properties:- Alphabet: 16 distinct letters (permuted by a fixed 1–1 substitution for staged disclosure)- Factor complexity: sublinear on the released segment, consistent with zero topological entropy- Limiting growth ratio (LCR): converges to approximately 3.141593223578, matching π to six decimal places; no claim of exact equality is made.- Released segment: first 6,260 letters (roughly first 8 terms)- Full scale: the 25th term alone contains 1,777,496,641,819 Trillion letters Files include:- eoa_a_LCR3.14_symbolic_sequence_technical_note.pdf, 4-page technical note- eoa_a_LCR3.14_symbolic_sequence_6260.txt, the 6,260-letter sequence- checksum.txt, SHA-256 checksum The original mapping and operator are withheld under the EOA staged disclosure policy.They can be made available to qualified researchers under a signed collaboration agreement. We welcome collaboration from symbolic dynamicists, combinatorists on words, and researchers in formal languages and automata theory. Contact: Bahaa Budargham