SearcharxivSearch

arXiv · 1603.08269

Equivalence of Deterministic walks on regular lattices on the plane

Abstract

We consider deterministic walks on square, triangular and hexagonal two dimensional lattices. In each case, there is a scatterer at every site that can be in one of two states that force the walker to turn either to his/her immediate right or left. After the walker is scattered, the scatterer changes state. A lattice with an arrangement of scatterers is an environment. We show that there are only two environments for which the scattering rules are injective, mirrors or rotators, on the three lattices. On hexagonal lattices, B. Z. Webb and E. G. D. Cohen, proved that given an initial position and velocity of the walker and an environment of one type of scatterers, mirrrors or rotators, there is an environment of the other type such that the walks on both environments are equivalent, meaning they visit the same sites at the same time steps. We prove the equivalence of walks on square and triangular lattices and include a proof of the equivalence of walks on hexagonal lattices. The proofs are based both on the geometry of the lattice and the structure of the scattering rule.

Explore related subjects

Keep this discovery

BibTeXRIS

Ana Rechtman, Raul Rechtman. 2016-03-27. Equivalence of Deterministic walks on regular lattices on the plane. https://doi.org/10.1016/j.physa.2016.08.077

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG