There is a newer version of the record available.

Published July 19, 2026 | Version 2.1.1
Software documentation Open

Exact and Near Recurrence in Reversible Dynamical Systems

Authors/Creators

Description

This repository presents a reproducible computational study of exact recurrence, observational recurrence, and hidden-state ambiguity in finite reversible dynamical systems.

The central result is that repeating a complete predictive state forces the same future evolution, while repeating only an observable state does not. In the exhaustively analyzed HPP lattice-gas model, 54 microscopic states produce identical density histories despite representing different underlying particle configurations. These states form 18 period-three cycles arranged into 9 time-reversal pairs, producing 27 predictive doubletons.

The project includes the research paper, source code, validation scripts, tests, generated data, figures, integrity checks, and an independent certificate verifier. The results are intended to clarify the difference between visible observations and complete internal states in deterministic systems, with implications for recurrence, simulation, inference, and hidden-state reconstruction.

Files

recurrence-dynamics-study.zip

Files (2.5 MB)

Name Size Download all
md5:a2b19a765579ffdb73bece7243b67b08
2.5 MB Preview Download

Additional details

Related works

Is version of
Software documentation: https://github.com/scottasundy/recurrence-dynamics-study (URL)

Software

Repository URL
https://github.com/scottasundy/recurrence-dynamics-study
Programming language
Python
Development Status
Active

References

  • Moore, E. F. (1956). Gedanken-experiments on sequential machines. In Automata Studies, Annals of Mathematics Studies, Vol. 34, pp. 129–153. Princeton University Press.
  • Nerode, A. (1958). Linear automaton transformations. Proceedings of the American Mathematical Society, 9, 541–544. https://doi.org/10.1090/S0002-9939-1958-0135681-9
  • Park, D. (1981). Concurrency and automata on infinite sequences. In Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 104, pp. 167–183. Springer. https://doi.org/10.1007/BFb0017309
  • Sinai, Ya. G. (1968). Markov partitions and C-diffeomorphisms. Functional Analysis and Its Applications, 2, 61–82. https://doi.org/10.1007/BF01075361
  • Kalman, R. E. (1961). On the general theory of control systems. In Proceedings of the First International Congress of Automatic Control, pp. 481–492. Butterworths.
  • Littman, M. L., Sutton, R. S., & Singh, S. (2002). Predictive representations of state. In Advances in Neural Information Processing Systems 14, pp. 1555–1561. MIT Press.
  • Bennett, C. H. (1973). Logical reversibility of computation. IBM Journal of Research and Development, 17, 525–532. https://doi.org/10.1147/rd.176.0525
  • Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27, 379–423 and 623–656.
  • Poincaré, H. (1890). Sur le problème des trois corps et les équations de la dynamique. Acta Mathematica, 13, 1–270. https://doi.org/10.1007/BF02392506
  • Arnold, V. I. (1989). Mathematical Methods of Classical Mechanics (2nd ed.). Springer. https://doi.org/10.1007/978-1-4757-2063-1
  • Takens, F. (1981). Detecting strange attractors in turbulence. In Dynamical Systems and Turbulence, Warwick 1980, Lecture Notes in Mathematics, Vol. 898, pp. 366–381. Springer. https://doi.org/10.1007/BFb0091924
  • Sauer, T., Yorke, J. A., & Casdagli, M. (1991). Embedology. Journal of Statistical Physics, 65, 579–616. https://doi.org/10.1007/BF01053745
  • Paige, R., & Tarjan, R. E. (1987). Three partition refinement algorithms. SIAM Journal on Computing, 16, 973–989. https://doi.org/10.1137/0216062
  • Crutchfield, J. P., & Young, K. (1989). Inferring statistical complexity. Physical Review Letters, 63, 105–108. https://doi.org/10.1103/PhysRevLett.63.105
  • Hardy, J., Pomeau, Y., & de Pazzis, O. (1973). Time evolution of a two-dimensional model system. I. Invariant states and time correlation functions. Journal of Mathematical Physics, 14, 1746–1759. https://doi.org/10.1063/1.1666248
  • Frisch, U., Hasslacher, B., & Pomeau, Y. (1986). Lattice-gas automata for the Navier–Stokes equation. Physical Review Letters, 56, 1505–1508. https://doi.org/10.1103/PhysRevLett.56.1505
  • Bocchieri, P., & Loinger, A. (1957). Quantum recurrence theorem. Physical Review, 107, 337–338. https://doi.org/10.1103/PhysRev.107.337
  • Schulman, L. S. (1978). Note on the quantum recurrence theorem. Physical Review A, 18, 2379–2380. https://doi.org/10.1103/PhysRevA.18.2379