Related papers: Factorization, reduction and embedding in integrab…
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is…
We present a Fermionic Cellular Automaton model which describes massless Dirac fermion in 1+1 dimension coupled with local, number preserving interaction. The diagonalization of the two particle sector shows that specific values of the…
We show that both confined atoms and electron-atom scattering can be described by a unified basis set method. The central idea behind this method is to place the atom inside a hard potential sphere, enforced by a standard Slater type basis…
We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups.…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the…
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…
In the development of the old ideas of Stueckelberg-Wheeler-Feynman on the "one-electron Universe", we study the purely algebraic dynamics of the ensemble of(two kinds of) identical point-like particles. These are represented by the(real…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
We analyze a stochastic 5-neighbor cellular automaton with several conserved quantities, including the particle density. By examining the eigenvalue problem of the associated transition matrix, we derive an explicit formula for the…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many…
We devise a new 1D atomistic scale model of vicinal growth based on Cellular Automaton. In it the step motion is realized by executing the automaton rule prescribing how adatoms incorporate into the vicinal crystal. Time increases after…
We study limit sets of stable cellular automata standing from a symbolic dynamics point of view where they are a special case of sofic shifts admitting a steady epimorphism. We prove that there exists a right-closing almost-everywhere…
In the near future, material and drug design may be aided by quantum computer assisted simulations. These have the potential to target chemical systems intractable by the most powerful classical computers. However, the resources offered by…
Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both…