Related papers: Minimality of $5$-adic polynomial dynamical system…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
We study dynamical systems forced by a combination of random and deterministic noise and provide criteria, in terms of Lyapunov exponents, for the existence of random attractors with continuous structure in the fibres. For this purpose, we…
We introduce dynamical systems $(X,G)$ with closed relations $G$ on compact metric spaces $X$ and discuss different types of minimality of such dynamical systems, all of them generalizing minimal dynamical systems $(X,f)$ with continuous…
This paper deals with random dynamical systems of polynomial automorphisms (complex generalized H\'{e}non maps and their conjugate maps) of $\Bbb{C}^{2}.$ We show that a generic random dynamical system of polynomial automorphisms has ``mean…
Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
For each prime number $p$, the dynamical behavior of the square mapping on the ring $\mathbb{Z}_p$ of $p$-adic integers is studied. For $p=2$, there are only attracting fixed points with their attracting basins. For $p\geq 3$, there are a…
In this paper we study substitutions on $A^\mathbb{Z}$ where $A$ is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The…
We study the dynamics of one-particle and few-particle billiard systems in containers of various shapes. In few-particle systems, the particles collide elastically both against the boundary and against each other. In the one-particle case,…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
An algebraic characterization of the property of approximate controllability is given, for behaviours of spatially invariant dynamical systems, consisting of distributional solutions, that are periodic in the spatial variables, to a system…
Systems of differential equations with polynomial right-hand sides are very common in applications. On the other hand, their mathematical analysis is very challenging in general, due to the possibility of complex dynamics: multiple basins…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…
The problem of finding all minimal surfaces presented in parametric form as polynomials of certain degree is discussed by many authors. It is known that the classical Enneper surface is (up to position in space and homothety) the only…
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…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
A number of simple chaotic three-dimensional dynamical systems (DSs) with quadratic polynomials on the right-hand sides are reported in the literature, containing exactly 5 or 6 monomials of which only 1 or 2 are quadratic. However, none of…