Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T11:42:48.752Z Has data issue: false hasContentIssue false

Asymptotic randomization of subgroup shifts by linear cellular automata

Published online by Cambridge University Press:  03 July 2006

ALEJANDRO MAASS
Affiliation:
Departamento de Ingeniería Matemática and Centro de Modelamiento Matemático, Universidad de Chile, Casilla 170 Correo 3, Santiago, Chile (e-mail: amaass@dim.uchile.cl, smartine@dim.uchile.cl)
SERVET MARTÍNEZ
Affiliation:
Departamento de Ingeniería Matemática and Centro de Modelamiento Matemático, Universidad de Chile, Casilla 170 Correo 3, Santiago, Chile (e-mail: amaass@dim.uchile.cl, smartine@dim.uchile.cl)
MARCUS PIVATO
Affiliation:
Department of Mathematics, Trent University, 1600 West Bank Drive, Peterborough, Ontario, K9J 7B8, Canada (e-mail: marcuspivato@trentu.ca, ryassawi@trentu.ca)
REEM YASSAWI
Affiliation:
Department of Mathematics, Trent University, 1600 West Bank Drive, Peterborough, Ontario, K9J 7B8, Canada (e-mail: marcuspivato@trentu.ca, ryassawi@trentu.ca)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let ${\mathbb{M}}={\mathbb{N}}^D$ be the positive orthant of a $D$-dimensional lattice and let $({\mathcal{G}},+)$ be a finite abelian group. Let ${\mathfrak{G}} \subseteq{\mathcal{G}}^{\mathbb{M}}$ be a subgroup shift, and let $\mu$ be a Markov random field whose support is ${\mathfrak{G}}$. Let $\Phi: {\mathfrak{G}} \longrightarrow {\mathfrak{G}}$ be a linear cellular automaton. Under broad conditions on ${\mathcal{G}}$, we show that the Cesaro average $N^{-1} \sum_{n=0}^{N-1} \Phi^n (\mu)$ converges to a measure of maximal entropy for the shift action on ${\mathfrak{G}}$.

Information

Type
Research Article
Copyright
2006 Cambridge University Press