Topological properties of cellular automata on trees

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.Comment: In Proceedings AUTOMATA&JAC 2012, arXiv:1208.249

Discrete Dynamical Systems Embedded in Cantor Sets

While the notion of chaos is well established for dynamical systems on manifolds, it is not so for dynamical systems over discrete spaces with $N$ variables, as binary neural networks and cellular automata. The main difficulty is the choice of a suitable topology to study the limit $N\to\infty$. By embedding the discrete phase space into a Cantor set we provided a natural setting to define topological entropy and Lyapunov exponents through the concept of error-profile. We made explicit calculations both numerical and analytic for well known discrete dynamical models.Comment: 36 pages, 13 figures: minor text amendments in places, time running top to bottom in figures, to appear in J. Math. Phy

Continuous cellular automata on irregular tessellations : mimicking steady-state heat flow

Leaving a few exceptions aside, cellular automata (CA) and the intimately related coupled-map lattices (CML), commonly known as continuous cellular automata (CCA), as well as models that are based upon one of these paradigms, employ a regular tessellation of an Euclidean space in spite of the various drawbacks this kind of tessellation entails such as its inability to cover surfaces with an intricate geometry, or the anisotropy it causes in the simulation results. Recently, a CCA-based model describing steady-state heat flow has been proposed as an alternative to Laplace's equation that is, among other things, commonly used to describe this process, yet, also this model suffers from the aforementioned drawbacks since it is based on the classical CCA paradigm. To overcome these problems, we first conceive CCA on irregular tessellations of an Euclidean space after which we show how the presented approach allows a straightforward simulation of steady-state heat flow on surfaces with an intricate geometry, and, as such, constitutes an full-fledged alternative for the commonly used and easy-to-implement finite difference method, and the more intricate finite element method

The ideal energy of classical lattice dynamics

We define, as local quantities, the least energy and momentum allowed by quantum mechanics and special relativity for physical realizations of some classical lattice dynamics. These definitions depend on local rates of finite-state change. In two example dynamics, we see that these rates evolve like classical mechanical energy and momentum.Comment: 12 pages, 4 figures, includes revised portion of arXiv:0805.335

Multidimensional cellular automata and generalization of Fekete's lemma

Fekete's lemma is a well known combinatorial result on number sequences: we extend it to functions defined on $d$-tuples of integers. As an application of the new variant, we show that nonsurjective $d$-dimensional cellular automata are characterized by loss of arbitrarily much information on finite supports, at a growth rate greater than that of the support's boundary determined by the automaton's neighbourhood index.Comment: 6 pages, no figures, LaTeX. Improved some explanations; revised structure; added examples; renamed "hypercubes" into "right polytopes"; added references to Arratia's paper on EJC, Calude's book, Cook's proof of Rule 110 universality, and arXiv paper 0709.117

Entropy rate of higher-dimensional cellular automata

We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the entropy rate result from basic results about the entropy of partitions of multidimensional cellular automata. We prove several results that show that entropy rate of 2-dimensional automata preserve similar properties of the entropy of one dimensional cellular automata. In particular we establish an inequality which involves the entropy rate, the radius of the cellular automaton and the entropy of the d-dimensional shift. We also compute the entropy rate of permutative bi-dimensional cellular automata and show that the finite value of the entropy rate (like the standard entropy of for one-dimensional CA) depends on the number of permutative sites. Finally we define the topological entropy rate and prove that it is an invariant for topological shift-commuting conjugacy and establish some relations between topological and measure-theoretic entropy rates

Excitable Delaunay triangulations

In an excitable Delaunay triangulation every node takes three states (resting, excited and refractory) and updates its state in discrete time depending on a ratio of excited neighbours. All nodes update their states in parallel. By varying excitability of nodes we produce a range of phenomena, including reflection of excitation wave from edge of triangulation, backfire of excitation, branching clusters of excitation and localized excitation domains. Our findings contribute to studies of propagating perturbations and waves in non-crystalline substrates