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

This record contains the first 2,000 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, zero topological entropy- Limiting growth ratio (LCR): converges to approximately 3.14159 at term 24- Released prefix: first 2,000 letters (roughly first 7 terms)- Full scale: cumulative sequence up to term 24 contains approximately 1,116,231,938,318 Trillion letters Files include:- eoa_a_LCR3.14_symbolic_sequence_technical_note.pdf – 3-page technical note- eoa_a_LCR3.14_symbolic_sequence_2000.txt – the 2,000-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