Related papers: Generalized Linear Cellular Automata in Groups and…
The completeness of the group classification of systems of two linear second-order ordinary differential equations with constant coefficients is delineated in the paper. The new cases extend what has been done in the literature. These cases…
A new class of linear sequence generators based on cellular automata is here introduced in order to model several nonlinear keystream generators with practical applications in symmetric cryptography. The output sequences are written as…
To test generalization ability of a class of deep neural networks, we randomly generate a large number of different rule sets for 2-D cellular automata (CA), based on John Conway's Game of Life. Using these rules, we compute several…
For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the…
We give model theoretic accounts and proofs of the existence and uniqueness of differential Galois extensions with no new constants, for logarithmic differential equations over a differential field K, when the field C of constants of K is…
We extend the notions of nonautonomous dynamics to arbitrary groups, through groupoid morphisms. This also presents a generalization of classic dynamical systems and group actions. We introduce the structure of cotranslations, as a specific…
Full set of autonomous completely solvable differential systems of equations in total differentials is built by basis of infinitesimal operators, universal invariant, and structure constants of admited multiparametric Lie group (abelian and…
We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…
Computation biology helps to understand all processes in organisms from interaction of molecules to complex functions of whole organs. Therefore, there is a need for mathematical methods and models that deliver logical explanations in a…
The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…
We study families of linear differential equations parametrized by an algebraic variety $\mathcal{X}$ and show that the set of all points $x\in \mathcal{X}$, such that the differential Galois group at the generic fibre specializes to the…
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
This paper describes the classification of analytic $q$-difference equations. The difference Galois groups are computed. A tentative description of the universal difference Galois group is given.
We show that Galois theory of cyclotomic number fields provides a powerful tool to construct systematically integer-valued matrices commuting with the modular matrix S, as well as automorphisms of the fusion rules. Both of these…
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have…
An analysis of discrete systems is important for understanding of various physical processes, such as excitations in crystal lattices and molecular chains, the light propagation in waveguide arrays, and the dynamics of Bose-condensate…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…
Cellular automata and their differentiable counterparts, Neural Cellular Automata (NCA), are highly expressive and capable of surprisingly complex behaviors. This paper explores how NCAs perform when applied to tasks requiring precise…
In this paper, we present methods to simplify reducible linear differential systems before solving. Classical integrals appear naturally as solutions of such systems. We will illustrate the methods developed in a previous paper on several…