Related papers: On algebraic cellular automata
We study qualitative properties of two-dimensional freezing cellular automata with a binary state set initialized on a random configuration. If the automaton is also monotone, the setting is equivalent to bootstrap percolation. We explore…
Let $G$ be a group. Let $X$ be a connected algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of $K$-points of $X$. We study a class of endomorphisms of pro-algebraic groups, namely algebraic group cellular…
Building over recent results, we expand the basic theory of algebraic extensions to the realm of superfields -a field with multivalued sum and product-, showing that every superfield has a (unique up to isomorphism) strong algebraic…
Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements…
A cell algebra structure is found for a family of generalized Schur algebras previously studied by the author. This cell algebra structure is then used to construct the irreducible representations of these algebras and to determine when the…
The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions. Group-theoretic…
In mathematics and engineering, control theory is concerned with the analysis of dynamical systems through the application of suitable control inputs. One of the prominent problems in control theory is controllability which concerns the…
Finite cellular automata (FCA) are widely used in simulating nonlinear complex systems, and their reversibility is closely related to information loss during the evolution. However, only a relatively small portion of their reversibility…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
In this paper, we look at the extention of Hedlund's characterization of cellular automata to the case of cellular automata in the hyperbolic plane. This requires an additionnal condition. The new theorem is proved with full details in the…
We study algebraic and model-theoretic properties of existentially closed fields with an action of a fixed finite group. Such fields turn out to be pseudo-algebraically closed in a rather strong sense. We place this work in a more general…
A hermitian algebra is a unital associative ${\mathbb C}$-algebra endowed with an involution such that the spectra of self-adjoint elements are contained in ${\mathbb R}$. In the case of an algebra ${\mathcal A}$ endowed with a…
Two cellular automata are strongly conjugate if there exists a shift-commuting conjugacy between them. We prove that the following two sets of pairs $(F,G)$ of one-dimensional one-sided cellular automata over a full shift are recursively…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
We say that an algebraic group $G$ over a field is anti-affine if every regular function on $G$ is constant. We obtain a classification of these groups, with applications to the structure of algebraic groups in positive characteristics, and…
We expand our previously founded basic theory of equiresidual algebraic geometry over an arbitrary commutative field, to a well-behaved theory of (equiresidual) algebraic varieties over a commutative field, thanks to the generalisation of…
Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…
We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…