Related papers: Coboundaries and eigenvalues of finitary S-adic sy…
We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…
We propose a sharpened version of Dynamical Cobordism, where the physical structure $\xi$ of the theory in question determines an allowed range $R^\xi$ for the critical exponent $\delta$. We interpret a singularity with $\delta \in R^\xi$…
Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems,…
A sequential dynamical system (SDS) consists of a graph, a set of local functions and an update schedule. A linear sequential dynamical system is an SDS whose local functions are linear. In this paper, we derive an explicit closed formula…
The motion of a spinning football brings forth the possible existence of a whole class of finite dynamical systems where there may be non-denumerably infinite number of fixed points. They defy the very traditional meaning of the fixed point…
We show that any $(1,2)$-rational function with a unique fixed point is topologically conjugate to a $(2,2)$-rational function or to the function $f(x)={ax\over x^2+a}$. The case $(2,2)$ was studied in our previous paper, here we study the…
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…
We consider a family of $(2,2)$-rational functions given on the set of complex $p$-adic field $\mathbb{C}_p$. Each such function has a unique fixed point. We study $p$-adic dynamical systems generated by the $(2,2)$-rational functions. We…
We discuss the symbolic dynamics of biochemical networks with separate timescales. We show that symbolic dynamics of monomolecular reaction networks with separated rate constants can be described by deterministic, acyclic automata with a…
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…
Modeling stochastic differential equations (SDEs) is crucial for understanding complex dynamical systems in various scientific fields. Recent methods often employ neural network-based models, which typically represent SDEs through a…
Given a rational map $\phi: {\mathbb P}^1\to {\mathbb P}^1$ defined over a number field $K$, we prove a finiteness result for $\phi$-preperiodic points which are $S$-integral with respect to a non-preperiodic point $P$, provided $P$…
Structural resolution (or S-resolution) is a newly proposed alternative to SLD-resolution that allows a systematic separation of derivations into term-matching and unification steps. Productive logic programs are those for which…
A speedup, like a time change in discrete time dynamics, is a way of moving faster through the orbits of a dynamical system. Linearly recurrence is a stronger form of minimality for subshifts, shared by e.g.\ all primitive substitution…
The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…
A stationary random sequence admits under some assumptions a representation as the sum of two others: one of them is a martingale difference sequence, and another is a so-called coboundary. Such a representation can be used for proving some…
A Sequential Dynamical System (SDS) is a quadruple (\Gamma, S_i,f_i,w) consisting of a (directed) graph \Gamma=(V,E), each of whose vertices i\in V is endowed with a finite set state S_i and an update function f_i: \prod_{j, i \to j} S_j…
Discrete-time stochastic systems are an essential modelling tool for many engineering systems. We consider stochastic control systems that are evolving over continuous spaces. For this class of models, methods for the formal verification…
The study of neural computation aims to understand the function of a neural system as an information processing machine. Neural systems are undoubtedly complex, necessitating principled and automated tools to abstract away details to…
In this paper, we study abstract dynamical systems with discrete phase spaces. One example of such a system is induced by the $3 x{+}1$-map on the set of all natural numbers, also known as the Collatz map. Our main focus is on dynamical…