Parity-Reduced Invariant Symmetry Model (PRISM)

In PRISM (Parity-Reduced Invariant Symmetry Model), we show that over binary state spaces, a minimal parity-feedback rule produces exact coarse-graining endogenously, linking discrete dynamical systems, error-correcting codes, spectral graph theory, and quantum information. Given an n-bit state, the rule flips every bit if the total parity is odd and leaves it unchanged if even, acting reversibly for even n yet as an idempotent antipodal quotient for odd n >= 3. Under symmetric two-node coupling, two updates collapse the space to a single fixed point for even n, or to an exact four-state parity law for odd n where two initial parity bits determine the future trajectory. The same mechanism yields an exact state-compression law and parity-recovery criterion on arbitrary networks, characterizes a two-dimensional even-weight product code in matrix space, and establishes explicit correspondences to quantum channel configurations.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24308983
Primary Topic
Cellular Automata and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Parity-Reduced Invariant Symmetry Model (PRISM)

Alexander Sellmeier
Zenodo (CERN European Organization for Nuclear Research)
Cellular Automata and Applications
preprint

Parity-Reduced Invariant Symmetry Model (PRISM)

Alexander Sellmeier
preprint en

Abstract

In PRISM (Parity-Reduced Invariant Symmetry Model), we show that over binary state spaces, a minimal parity-feedback rule produces exact coarse-graining endogenously, linking discrete dynamical systems, error-correcting codes, spectral graph theory, and quantum information. Given an n-bit state, the rule flips every bit if the total parity is odd and leaves it unchanged if even, acting reversibly for even n yet as an idempotent antipodal quotient for odd n >= 3. Under symmetric two-node coupling, two updates collapse the space to a single fixed point for even n, or to an exact four-state parity law for odd n where two initial parity bits determine the future trajectory. The same mechanism yields an exact state-compression law and parity-recovery criterion on arbitrary networks, characterizes a two-dimensional even-weight product code in matrix space, and establishes explicit correspondences to quantum channel configurations.

Zenodo (CERN European Organization for Nuclear Research)
Cellular Automata and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon