arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.09675math.GRcs.FLmath.RA
收藏

代数结构上的元胞自动机

Cellular automata over algebraic structures

Alonso Castillo-Ramirez, O. Mata-Gutiérrez, Angel Zaldivar-Corichi

摘要:

设$G$是一个群,而$A$是一个集合,该集合具有有限操作的集合。我们研究了细胞自动机$τ: A^G \to A^G$,它保留了$A$的操作按分量导出的$A^G$的操作。证明了$τ$是$A^G$的自同态当且仅当它的局部函数是同态.当$A$是熵(即所有有限操作是同态),我们建立的集合$\text{EndCA}(G;A)$,由所有这样的细胞自动机,是同构的直接限制的$\text{Hom}(A^S, A)$,其中$S$运行之间的所有有限子集的$G$。特别地,当$A$是$R$ -模时,我们证明了$\text{EndCA}(G;A)$同构于群代数$\text{End}(A)[G]$ .此外,当$A$是有限布尔代数时,我们建立了$A^G$上允许存储集$S$的自同态细胞自动机的个数正好是$(k \vert S \vert)^k$,其中$k$是$A$的原子数.

英文摘要:

Let $G$ be a group and $A$ a set equipped with a collection of finitary operations. We study cellular automata $τ: A^G \to A^G$ that preserve the operations of $A^G$ induced componentwise from the operations of $A$. We show that $τ$ is an endomorphism of $A^G$ if and only if its local function is a homomorphism. When $A$ is entropic (i.e. all finitary operations are homomorphisms), we establish that the set $\text{EndCA}(G;A)$, consisting of all such cellular automata, is isomorphic to the direct limit of $\text{Hom}(A^S, A)$, where $S$ runs among all finite subsets of $G$. In particular, when $A$ is an $R$-module, we show that $\text{EndCA}(G;A)$ is isomorphic to the group algebra $\text{End}(A)[G]$. Moreover, when $A$ is a finite Boolean algebra, we establish that the number of endomorphic cellular automata over $A^G$ admitting a memory set $S$ is precisely $(k \vert S \vert)^k$, where $k$ is the number of atoms of $A$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑