Related papers: Convolution equations on lattices: periodic soluti…
We propose dynamical systems defined on algebra of lattices, which we call `lattice equations'. We give exact general solutions of initial value problems for a class of lattice equations, and evaluate the complexity of the solutions.…
Novel types of convolution operators for quaternion linear canonical transform (QLCT) are proposed. Type one and two are defined in the spatial and QLCT spectral domains, respectively. They are distinct in the quaternion space and are…
In the article a transition from pattern evolution equation of reaction-diffusion type to a cellular automaton (CA) is described. The applicability of CA is demonstrated by generating patterns of complex irregular structure on a hexagonal…
We consider the problem of discretizing evolution operators of linear delay equations with the aim of approximating their spectra, which is useful in investigating the stability properties of (nonlinear) equations via the principle of…
We develop a unified framework for constructing matrix approximations to the convolution operator of Volterra type defined by functions that are approximated using classical orthogonal polynomials on $[-1, 1]$. The numerically stable…
We prove an abstract criterion that a surjective convolution operator in spaces of analytic functions on convex subsets of the complex plane has a continuous linear right inverse. Considered convex sets have a countable neighborhood basis…
We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over $Z_2$). This provides graphs with a new geometric context and leads to a new tool to analyze them. The digraphs of…
A matrix representation of the evolution operator associated with a nonlinear stochastic flow with additive noise is used to compute its spectrum. In the weak noise limit a perturbative expansion for the spectrum is formulated in terms of…
Convolutional Neural Networks (CNNs) have become the state-of-the-art in supervised learning vision tasks. Their convolutional filters are of paramount importance for they allow to learn patterns while disregarding their locations in input…
In this paper, we introduce the notion of a characteristic operator for closable linear operators and explore their connected spectral properties via equivalence. Additionally, we develop an explicit scheme for constructing characteristic…
In this paper we present a quantization of Cellular Automata. Our formalism is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this…
The transport and chemical reactions of solutes are modelled as a cellular automaton in which molecules of different species perform a random walk on a regular lattice and react according to a local probabilistic rule. The model describes…
Convolution, a cornerstone of signal processing and optical neural networks, has traditionally been implemented by mapping mathematical operations onto complex hardware. Here, we overcome this challenge by revealing that wave dynamics in…
The emergent dynamics in spacetime diagrams of cellular automata (CAs) is often organised by means of a number of behavioural classes. Whilst classification of elementary CAs is feasible and well-studied, non-elementary CAs are generally…
In this paper, we first introduce a new notion of canonical convolution operator, and show that it satisfies the commutative, associative, and distributive properties, which may be quite useful in signal processing. Moreover, it is proved…
A discretized time evolution of the wave function for a Dirac particle on a cubic lattice is represented by a very simple quantum cellular automaton. In each evolution step the updated value of the wave function at a given site depends only…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for…
We redefine the transition function of elementary cellular automata (ECA) in terms of discrete operators. The operator representation provides a clear hint about the way systems behave both at the local and the global scale. We show that…
Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…