Published April 28, 2026 | Version v1
Preprint Open

Orbit-Induced Redundancy in Finite Symbolic Systems

  • 1. ROR icon Universidade Federal do Rio de Janeiro

Description

We study how the action of a finite symmetry group $G$ over a symbolic grid $\Sigma^{n^2}$ induces structural redundancy, dimensional compression, reading-direction invariance, and passive recovery under noise. Motivated by the Sator Square, we formalize these mechanisms across finite group actions on square grids. We prove an exact identity for the information action $A[M,G]$, determined by the number of orbits of $G$, and introduce transition entropy as a non-trivial diagnostic separating weakly constrained systems from structurally rigid ones.

Computational experiments over representative finite groups provide evidence that baseline-corrected recovery is better predicted by $d_{min}^{orb}(G)$, the size of the smallest non-trivial orbit, than by the group order $|G|$. The Sator Square is thereby reframed as a minimum-complexity historical example of an orbit-constrained symbolic system rather than an isolated mathematical anomaly.

Files

Orbit-Induced Redundancy in Finite Symbolic Systems.pdf

Files (483.5 kB)

Additional details

Software

Repository URL
https://github.com/dougdotcon/sator_order_structural
Programming language
Python
Development Status
Active

References

  • Fulber, D. H. M. The Sator Square as a Zero-Entropy Symbolic Structure: Symmetry, Information Theory, and the Klein Group. Tamesis Program (2026).
  • Burnside, W. Theory of Groups of Finite Order. Cambridge University Press (1897).
  • Shannon, C. E. A Mathematical Theory of Communication. Bell System Technical Journal 27 (1948).
  • Kitaev, A. Fault-tolerant quantum computation by anyons. Annals of Physics 303 (2003).
  • Cover, T. M., Thomas, J. A. Elements of Information Theory. Wiley (2006).