Zobrazeno 1 - 10
of 381
pro vyhledávání: '"Ramirez, Alonso"'
For a group $G$ and a finite set $A$, a cellular automaton (CA) is a transformation $\tau : A^G \to A^G$ defined via a finite memory set $S \subseteq G$ and a local map $\mu : A^S \to A$. Although memory sets are not unique, every CA admits a unique
Externí odkaz:
http://arxiv.org/abs/2404.06394
Publikováno v:
Theoretical Computer Science, vol. 1009, 12 September 2024, 114698
Motivated by the search for idempotent cellular automata (CA), we study CA that act almost as the identity unless they read a fixed pattern $p$. We show that constant and symmetrical patterns always produce idempotent CA, and we characterize the quas
Externí odkaz:
http://arxiv.org/abs/2401.09593
Publikováno v:
Communications in Algebra, 2024
Given a finite set $A$ and a group homomorphism $\phi : H \to G$, a $\phi$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $\phi$-equivariant in the sense that $h \cdot \m
Externí odkaz:
http://arxiv.org/abs/2310.04926
Elementary cellular automata (ECA) are one-dimensional discrete models of computation with a small memory set that have gained significant interest since the pioneer work of Stephen Wolfram, who studied them as time-discrete dynamical systems. Each o
Externí odkaz:
http://arxiv.org/abs/2305.02947
Publikováno v:
Published in Semigroup Forum (2023)
For a group $G$ acting on a set $X$, let $\text{End}_G(X)$ be the monoid of all $G$-equivariant transformations, or $G$-endomorphisms, of $X$, and let $\text{Aut}_G(X)$ be its group of units. After discussing few basic results in a general setting, w
Externí odkaz:
http://arxiv.org/abs/2203.12158
Autor:
Pérez-Arana, Gonzalo-Martín, González-Domínguez, Álvaro, Visiedo, Francisco, Gómez, Alfredo Díaz, Bancalero-de los Reyes, José, Camacho-Ramírez, Alonso, Ribelles-García, Antonio, Almorza-Gomar, David, Gracia-Romero, Manuel, Casar-García, Juan, Prada-Oliveira, José-Arturo
Publikováno v:
In Journal of Gastrointestinal Surgery June 2024 28(6):923-932
Publikováno v:
Bulletin of the Iranian Mathematical Society 48 (2022) 1859-1868
For any group $G$ and any set $A$, consider the shift action of $G$ on the full shift $A^G$. A configuration $x \in A^G$ has \emph{least period} $H \leq G$ if the stabiliser of $x$ is precisely $H$. Among other things, the number of such configuratio
Externí odkaz:
http://arxiv.org/abs/2102.09524
Autor:
Castillo-Ramirez, Alonso
Publikováno v:
Journal of Algebra and Its Applications 21, No. 11, 2250215 (2022)
For a group $G$ and a set $A$, let $\text{End}(A^G)$ be the monoid of all cellular automata over $A^G$, and let $\text{Aut}(A^G)$ be its group of units. By establishing a characterisation of surjunctuve groups in terms of the monoid $\text{End}(A^G)$
Externí odkaz:
http://arxiv.org/abs/2004.07321
Publikováno v:
Journal of Pure and Applied Algebra 225, 2021
A code algebra $A_C$ is a nonassociative commutative algebra defined via a binary linear code $C$. In a previous paper, we classified when code algebras are $\mathbb{Z}_2$-graded axial (decomposition) algebras generated by small idempotents. In this
Externí odkaz:
http://arxiv.org/abs/2001.08426