Alonso Castillo-Ramirez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alonso Castillo-Ramirez has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Maximilien Gadouleau
Department of Computer Science, Durham University, Durham, UK
11 shared publications - Justin McInroy
Heilbronn Institute for Mathematical Research School of Mathematics University of Bristol University Walk BS8 1TW Bristol UK
6 shared publications A. Vazquez-Aceves
Centro Universitario de Ciencias Exactas e Ingenierías Universidad de Guadalajara México
3 shared publicationsA. Zaldivar-Corichi
Centro Universitario de Ciencias Exactas e Ingenierías Universidad de Guadalajara México
3 shared publications- Angel Zaldívar
Centro Universitario de Ciencias Exactas e Ingenierías, Universidad de Guadalajara
3 shared publications - Eduardo Veliz-Quintero
Centro Universitario de los Valles Universidad de Guadalajara México
2 shared publications
Latest Publications
- 15 April 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1076
On the order of lazy cellular automata
- 15 April 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1076
On the order of lazy cellular automata
- Open Access
A categorical framework for cellular automata
This paper proposes a generalized framework for cellular automata using the language of category theory, extending the classical definition beyond set-theoretic constraints. For an arbitrary category $\mathscr{C}$ with products, we define $\mathscr{C}$-cellular automata as morphisms $τ: A^G \to B^G$ in $\mathscr{C}$, where the alphabets $A$ and $B$ are objects in $\mathscr{C}$ and the universe is a group $G$. We show that $\mathscr{C}$-cellular automata form a subcategory of $\mathscr{C}$ closed under finite products, and that they satisfy a categorical version of the Curtis-Hedlund-Lyndon theorem. For two arbitrary group universes $G$ and $H$, we extend our theory to define generalized $\mathscr{C}$-cellular automata as morphisms $τ: A^G \to B^H$ constructed via a group homomorphism $φ: H \to G$. Finally, we prove that generalized $\mathscr{C}$-cellular automata form a subcategory of $\mathscr{C}$ with a finite weak product involving the free product of the underlying group universes. This framework unifies existing concepts and provides purely categorical proofs of foundational results in the theory of cellular automata.Open AccessA categorical framework for cellular automata
This paper proposes a generalized framework for cellular automata using the language of category theory, extending the classical definition beyond set-theoretic constraints. For an arbitrary category $\mathscr{C}$ with products, we define $\mathscr{C}$-cellular automata as morphisms $τ: A^G \to B^G$ in $\mathscr{C}$, where the alphabets $A$ and $B$ are objects in $\mathscr{C}$ and the universe is a group $G$. We show that $\mathscr{C}$-cellular automata form a subcategory of $\mathscr{C}$ closed under finite products, and that they satisfy a categorical version of the Curtis-Hedlund-Lyndon theorem. For two arbitrary group universes $G$ and $H$, we extend our theory to define generalized $\mathscr{C}$-cellular automata as morphisms $τ: A^G \to B^H$ constructed via a group homomorphism $φ: H \to G$. Finally, we prove that generalized $\mathscr{C}$-cellular automata form a subcategory of $\mathscr{C}$ with a finite weak product involving the free product of the underlying group universes. This framework unifies existing concepts and provides purely categorical proofs of foundational results in the theory of cellular automata. - 27 April 2025
- Published by Springer Nature
- p. 347-373
A Study on the Composition of Elementary Cellular Automata
- 27 April 2025
- Published by Springer Nature
- p. 347-373
A Study on the Composition of Elementary Cellular Automata
- Open Access
Categorical products of cellular automata
We study two categories of cellular automata. First, for any group $G$, we consider the category $\mathcal{CA}(G)$ whose objects are configuration spaces of the form $A^G$, where $A$ is a set, and whose morphisms are cellular automata of the form $τ: A_1^G \to A_2^G$. We prove that the categorical product of two configuration spaces $A_1^G$ and $A_2^G$ in $\mathcal{CA}(G)$ is the configuration space $(A_1 \times A_2)^G$. Then, we consider the category of generalized cellular automata $\mathcal{GCA}$, whose objects are configuration spaces of the form $A^G$, where $A$ is a set and $G$ is a group, and whose morphisms are $φ$-cellular automata of the form $\mathcal{T} : A_1^{G_1} \to A_2^{G_2}$, where $φ: G_2 \to G_1$ is a group homomorphism. We prove that a categorical weak product of two configuration spaces $A_1^{G_1}$ and $A_2^{G_2}$ in $\mathcal{GCA}$ is the configuration space $(A_1 \times A_2)^{G_1 \ast G_2}$, where $G_1 \ast G_2$ is the free product of $G_1$ and $G_2$. The previous results allow us to naturally define the product of two cellular automata in $\mathcal{CA}(G)$ and the weak product of two generalized cellular automata in $\mathcal{GCA}$.Open AccessCategorical products of cellular automata
We study two categories of cellular automata. First, for any group $G$, we consider the category $\mathcal{CA}(G)$ whose objects are configuration spaces of the form $A^G$, where $A$ is a set, and whose morphisms are cellular automata of the form $τ: A_1^G \to A_2^G$. We prove that the categorical product of two configuration spaces $A_1^G$ and $A_2^G$ in $\mathcal{CA}(G)$ is the configuration space $(A_1 \times A_2)^G$. Then, we consider the category of generalized cellular automata $\mathcal{GCA}$, whose objects are configuration spaces of the form $A^G$, where $A$ is a set and $G$ is a group, and whose morphisms are $φ$-cellular automata of the form $\mathcal{T} : A_1^{G_1} \to A_2^{G_2}$, where $φ: G_2 \to G_1$ is a group homomorphism. We prove that a categorical weak product of two configuration spaces $A_1^{G_1}$ and $A_2^{G_2}$ in $\mathcal{GCA}$ is the configuration space $(A_1 \times A_2)^{G_1 \ast G_2}$, where $G_1 \ast G_2$ is the free product of $G_1$ and $G_2$. The previous results allow us to naturally define the product of two cellular automata in $\mathcal{CA}(G)$ and the weak product of two generalized cellular automata in $\mathcal{GCA}$. - Open Access
Connections between the minimal neighborhood and the activity value of cellular automata
For a group $G$ and a finite set $A$, a cellular automaton is a transformation of the configuration space $A^G$ defined via a finite neighborhood and a local map. Although neighborhoods are not unique, every CA admits a unique minimal neighborhood, which consists on all the essential cells in $G$ that affect the behavior of the local map. An active transition of a cellular automaton is a pattern that produces a change on the current state of a cell when the local map is applied. In this paper, we study the links between the minimal neighborhood and the number of active transitions, known as the activity value, of cellular automata. Our main results state that the activity value usually imposes several restrictions on the size of the minimal neighborhood of local maps.Open AccessConnections between the minimal neighborhood and the activity value of cellular automata
For a group $G$ and a finite set $A$, a cellular automaton is a transformation of the configuration space $A^G$ defined via a finite neighborhood and a local map. Although neighborhoods are not unique, every CA admits a unique minimal neighborhood, which consists on all the essential cells in $G$ that affect the behavior of the local map. An active transition of a cellular automaton is a pattern that produces a change on the current state of a cell when the local map is applied. In this paper, we study the links between the minimal neighborhood and the number of active transitions, known as the activity value, of cellular automata. Our main results state that the activity value usually imposes several restrictions on the size of the minimal neighborhood of local maps. - Open Access
- 19 December 2024
- Published by Universidad de Sonora in Sahuarus. Revista ElectrÓnica de MatemÁticas
- Vol. 8 (2) , 13-27
Una aplicación de la teoría de representaciones en química
La teoría de representaciones lineales consiste en estudiar grupos abstractos a través de sus representaciones como grupos de matrices. En este artículo, presentamos una aplicación de esta teoría en química, específicamente en la aproximación de las frecuencias vibracionales de una molécula usando las representaciones del grupo de simetrías de dicha molécula. Para explicar el procedimiento, primero presentamos la definición del grupo de simetrías de una molécula, describimos cómo obtener la aproximación de las frecuencias vibracionales mediante un sistema lineal de ecuaciones diferenciales, y revisamos los conceptos básicos de la teoría de representaciones lineales. Esperamos que este texto sea útil tanto para químicos interesados en los fundamentos matemáticos del campo de la simetría molecular, como para matemáticos interesados conocer aplicaciones las matemáticas en otras ciencias.
- 19 December 2024
- Published by Universidad de Sonora in Sahuarus. Revista ElectrÓnica de MatemÁticas
- Vol. 8 (2) , 13-27
Open AccessUna aplicación de la teoría de representaciones en química
La teoría de representaciones lineales consiste en estudiar grupos abstractos a través de sus representaciones como grupos de matrices. En este artículo, presentamos una aplicación de esta teoría en química, específicamente en la aproximación de las frecuencias vibracionales de una molécula usando las representaciones del grupo de simetrías de dicha molécula. Para explicar el procedimiento, primero presentamos la definición del grupo de simetrías de una molécula, describimos cómo obtener la aproximación de las frecuencias vibracionales mediante un sistema lineal de ecuaciones diferenciales, y revisamos los conceptos básicos de la teoría de representaciones lineales. Esperamos que este texto sea útil tanto para químicos interesados en los fundamentos matemáticos del campo de la simetría molecular, como para matemáticos interesados conocer aplicaciones las matemáticas en otras ciencias.
- 18 June 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1009
Idempotent cellular automata and their natural order
- 18 June 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1009
Idempotent cellular automata and their natural order
- Open Access
Further results on generalized cellular automata
Given a finite set $A$ and a group homomorphism $φ: H \to G$, a $φ$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $φ$-equivariant in the sense that $h \cdot \mathcal{T}(x) = \mathcal{T}( φ(h) \cdot x)$, for all $x \in A^G, h \in H$, where $\cdot$ denotes the shift actions of $G$ and $H$ on $A^G$ and $A^H$, respectively. When $G=H$ and $φ= \text{id}$, the definition of $\text{id}$-cellular automata coincides with the classical definition of cellular automata. The purpose of this paper is to expand the theory of $φ$-cellular automata by focusing on the differences and similarities with their classical counterparts. After discussing some basic results, we introduce the following definition: a $φ$-cellular automaton $\mathcal{T} : A^G \to A^H$ has the unique homomorphism property (UHP) if $\mathcal{T}$ is not $ψ$-equivariant for any group homomorphism $ψ: H \to G$, $ψ\neq φ$. We show that if the difference set $Δ(φ, ψ)$ is infinite, then $\mathcal{T}$ is not $ψ$-equivariant; it follows that when $G$ is torsion-free abelian, every non-constant $\mathcal{T}$ has the UHP. Furthermore, inspired by the theory of classical cellular automata, we study $φ$-cellular automata over quotient groups, as well as their restriction and induction to subgroups and supergroups, respectively.Open AccessFurther results on generalized cellular automata
Given a finite set $A$ and a group homomorphism $φ: H \to G$, a $φ$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $φ$-equivariant in the sense that $h \cdot \mathcal{T}(x) = \mathcal{T}( φ(h) \cdot x)$, for all $x \in A^G, h \in H$, where $\cdot$ denotes the shift actions of $G$ and $H$ on $A^G$ and $A^H$, respectively. When $G=H$ and $φ= \text{id}$, the definition of $\text{id}$-cellular automata coincides with the classical definition of cellular automata. The purpose of this paper is to expand the theory of $φ$-cellular automata by focusing on the differences and similarities with their classical counterparts. After discussing some basic results, we introduce the following definition: a $φ$-cellular automaton $\mathcal{T} : A^G \to A^H$ has the unique homomorphism property (UHP) if $\mathcal{T}$ is not $ψ$-equivariant for any group homomorphism $ψ: H \to G$, $ψ\neq φ$. We show that if the difference set $Δ(φ, ψ)$ is infinite, then $\mathcal{T}$ is not $ψ$-equivariant; it follows that when $G$ is torsion-free abelian, every non-constant $\mathcal{T}$ has the UHP. Furthermore, inspired by the theory of classical cellular automata, we study $φ$-cellular automata over quotient groups, as well as their restriction and induction to subgroups and supergroups, respectively.