Related papers: Convolution equations on lattices: periodic soluti…
This paper deals with homogenization problem for convolution type non-local operators in random statistically homogeneous ergodic media. Assuming that the convolution kernel has a finite second moment and satisfies the uniform ellipticity…
We consider evolution equations generated by quadratic operators admitting a decomposition in creation-annihilation operators without usual ellipticity-type hypotheses; this class includes hypocoercive model operators. We identify the…
We generalize the definition of convolution of vectors and tensors on the 2-sphere, and prove that it commutes with differential operators. Moreover, vectors and tensors that are normal/tangent to the spherical surface remain so after the…
We develop a rigorous topological theory of anomalies on the lattice, which are obstructions to gauging global symmetries and the existence of trivial symmetric states. We also construct $\Omega$-spectra of a class of invertible states and…
Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular-automaton analogous of localizations or…
The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…
We apply the method of spectral sequences to study classical problems in analysis. We illustrate the method by finding polynomial vector fields that commute with a given polynomial vector field and finding integrals of polynomial…
The spectrum of masses from a lattice QCD simulation may be found by fitting exponential functions to correlators of operators possessing the quantum numbers of the particles of interest. The ability of evolutionary algorithms to find…
The convolution operator is the fundamental building block of modern convolutional neural networks (CNNs), owing to its simplicity, translational equivariance, and efficient implementation. However, its structure as a fixed, linear,…
We develop a theory of quantum harmonic analysis on lattices in $\mathbb{R}^{2d}$. Convolutions of a sequence with an operator and of two operators are defined over a lattice, and using corresponding Fourier transforms of sequences and…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
Discrete circular convolution over $\mathbb{Z}/N\mathbb{Z}$ is a linear operator and can be implemented on quantum hardware within the linear-combination-of-unitaries (LCU) framework. In this work, we make this connection explicit through…
Let L:= Z^D be the D-dimensional lattice and let A^L be the Cantor space of L-indexed configurations in some finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F of A^L,…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
We develop a family of reformulations of an arbitrary consistent linear system into a stochastic problem. The reformulations are governed by two user-defined parameters: a positive definite matrix defining a norm, and an arbitrary discrete…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
Dense prediction tasks typically employ encoder-decoder architectures, but the prevalent convolutions in the decoder are not image-adaptive and can lead to boundary artifacts. Different generalized convolution operations have been…
Evolution by natural selection, which is one of the most compelling themes of modern science, brought forth evolutionary algorithms and evolutionary computation, applying mechanisms of evolution in nature to various problems solved by…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…