2018/05/25 by Pablo Arrighi, Arrighi, Pablo, Clément Chouteau +5
Computer Science · Mathematics · #Cellular Automata and Applications #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Mathematical Dynamics and Fractals #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1805.10051
openalex publication_date 2018/05/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same. For this purpose we develop a correspondence between complexes and labeled graphs. In particular we reformulate the properties that characterize discrete manifolds amongst complexes, solely in terms of graphs. In dimensions n<4, over bounded-star graphs, it is decidable whether a Cellular Automaton maps discrete manifolds into discrete manifolds.