Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics

Details Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics

2001-08-12

arxiv.org/abs/math/0108084v3

Mathematics

Dynamical Systems

LaTeX2E Format, 20 pages, 2 tables. To appear in Journal of Statistical Physics. REVISION 1: extensive notational improvement.

Scientific paper

If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where nearby coordinates are combined using the multiplication operation of G. We characterize when MCA are group endomorphisms of G^M, and show that MCA on G^M inherit a natural structure theory from the structure of G. We apply this structure theory to compute the measurable entropy of MCA, and to study convergence of initial measures to Haar measure.

Affiliated with

Also associated with

No associations

Rating

Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626989