An order-preserving property of additive invariant for Takesue-type reversible cellular automata

Simple item page
dc.creatorCaterina, Gianluca
dc.creatorBoghosian, Bruce M.
dc.date2008-07-18
dc.date.accessioned2026-07-07T09:51:41Z
dc.date.available2026-07-07T09:51:41Z
dc.descriptionWe show that, for a fairly large class of reversible, one-dimensional cellular automata, the set of additive invariants exhibits an algebraic structure. More precisely, if $f$ and $g$ are one-dimensional, reversible cellular automata of the kind considered by Takesue, we show that there is a binary operation on these automata $\vee$ such that $ψ(f)\subseteq ψ(f\vee g)$, where $ψ(f)$ denotes the set of additive invariants of $f$ and $\subseteq$ denotes the inclusion relation between real subspaces.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0807.3046
dc.identifierhttp://arxiv.org/abs/0807.3046
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165331
dc.subjectCellular Automata and Lattice Gases
dc.titleAn order-preserving property of additive invariant for Takesue-type reversible cellular automata
dc.typetext

Files

Collections

arXiv