Related papers: On the Induction Operation for Shift Subspaces and…
Let $G$ be a group and let $X$ be an algebraic variety over an algebraically closed field $k$ of characteristic zero. Denote $A=X(k)$ the set of rational points of $X$. We investigate invertible algebraic cellular automata $\tau \colon A^G…
The dynamics by iteration of a function on a compact metric space, sometimes called a cascade, can be extended to the dynamics of a closed relation on such a space. Here we apply this relation dynamics to study semiflows (and their relation…
We show that morphisms from n A_infinity-algebras to a single one are maps over an operad module with n+1 commuting actions of the operad A_infinity, whose algebras are conventional A_infinity-algebras. Similar statement holds for homotopy…
The paper demonstrates that invariant foliations are accurate, data-efficient and practical tools for data-driven modelling of physical systems. Invariant foliations can be fitted to data that either fill the phase space or cluster about an…
We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of…
Computational power can be measured by assigning an algebraic structure to a computational device. Here, we convert a small patch of Conway's Game of Life into a transformation semigroup. The conversion captures not only time evolution but…
In this paper, we investigate the dynamics on the hyperspace induced by a non-autonomous dynamical system $(X,\mathbb{F})$, where the non-autonomous system is generated by a sequence $(f_n)$ of continuous self maps on $X$. We relate the…
We initiate the study of analogues of symmetric spaces for the family of finite dihedral groups. In particular, we investigate the structure of the automorphism group, characterize the involutions of the automorphism group, and determine…
Continuation of algebraic structures in families of dynamical systems is described using category theory, sheaves, and lattice algebras. Well-known concepts in dynamics, such as attractors or invariant sets, are formulated as functors on…
The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be…
In this paper we introduce and study the notion of dynamical forcing. Basically, we develop a toolkit of techniques to produce finitely presented groups which can only act on the circle with certain prescribed dynamical properties. As an…
It is shown that each integrable mapping is connected with a hierarchical completely integrable sytem of equations of evolution type which are invariant with respect to the transformation described by this mapping.
Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…
Controlling hybrid systems is mostly very challenging due to the variety of dynamics these systems can exhibit. Inspired by the concept of differential flatness of nonlinear continuous systems and their inherent invertibility property, the…
Modulated symmetries are internal symmetries that are not invariant under spacetime symmetry actions. We propose a general way to describe the lattice translation modulated symmetries in 1+1D, including the non-invertible ones, via the…
A sofic shift is a shift space consisting of bi-infinite labels of paths from a labelled graph. Being a dynamical system, the distribution of its closed orbits may indicate the complexity of the space. For this purpose, prime orbit and…
Is it possible to understand the intricacies of a dynamical system not solely from its input/output pattern, but also by observing the behavior of other systems within the same class? This central question drives the study presented in this…
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…
Modelling interactions is critical in learning complex dynamical systems, namely systems of interacting objects with highly non-linear and time-dependent behaviour. A large class of such systems can be formalized as $\textit{geometric…
Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the term `cellular automaton' or…