Papers › Linear encoding of the spatiotemporal cat
Linear encoding of the spatiotemporal cat
Boris Gutkin, Li Han, Rana Jafari, Adrien K. Saremi, Predrag Cvitanović
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The dynamics of an extended, spatiotemporally chaotic system might appear extremely complex. Nevertheless, the local dynamics, observed through a finite spatiotemporal window, can often be thought of as a visitation sequence of a finite repertoire of finite patterns. To make statistical predictions about the system, one needs to know how often a given pattern occurs. Here we address this fundamental question within a spatiotemporal cat, a 1-dimensional spatial lattice of coupled cat maps evolving in time. In spatiotemporal cat, any spatiotemporal state is labeled by a unique 2-dimensional lattice of symbols from a finite alphabet, with the lattice states and their symbolic representation related linearly (hence "linear encoding"). We show that the state of the system over a finite spatiotemporal domain can be described with exponentially increasing precision by a finite pattern of symbols, and we provide a systematic, lattice Green's function methodology to calculate the frequency (i.e., the measure) of such states.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections