Related papers: Singularity confinement and chaos in discrete syst…
A class of discrete equations is considered from three perspectives corresponding to three measures of the complexity of solutions: the (hyper-) order of meromorphic solutions in the sense of Nevanlinna, the degree growth of iterates over a…
The `deautonomisation' of an integrable mapping of the plane consists in treating the free parameters in the mapping as functions of the independent variable, the precise expressions of which are to be determined with the help of a suitable…
We introduce a new methodology for the analysis of the phenomenon of chaotic itinerancy in a dynamical system using the notion of entropy and a clustering algorithm. We determine systems likely to experience chaotic itinerancy by means of…
Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…
We construct the complete set of orders of growth and we define on it the generalized entropy of a dynamical systems. With this object we provide a framework where we can study the separation of orbits of a map beyond the scope of…
We extend previously proposed measures of complexity, emergence, and self-organization to continuous distributions using differential entropy. This allows us to calculate the complexity of phenomena for which distributions are known. We…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
In this paper we investigate the integrability of two-dimensional partial difference equations using the newly developed techniques of study of the degree of the iterates. We show that while for generic, nonintegrable equations, the degree…
A gas of interacting particles is a paradigmatic example of chaotic systems. It is shown here that even if all but one particle are fixed in generic positions, the excited states of the moving particle are chaotic. They are characterized by…
We consider a family of singular maps as an example of a simple model of dynamical systems exhibiting the property of robust chaos on a well defined range of parameters. Critical boundaries separating the region of robust chaos from the…
Complexity is an important metric for appropriate characterization of different classes of irregular signals, observed in the laboratory or in nature. The literature is already rich in the description of such measures using a variety of…
A large class of technically non-chaotic systems, involving scatterings of light particles by flat surfaces with sharp boundaries, is nonetheless characterized by complex random looking motion in phase space. For these systems one may…
For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
We present a novel way to apply the singularity confinement property as a discrete integrability criterion. We shall use what we call a full deautonomisation approach, which consists in treating the free parameters in the mapping as…
In this paper, we deal with the classification complexity of continuous (Devaney) chaotic systems in dimensions $0,1$ and $\infty$ using the framework of invariant descriptive set theory. We identify the complexity in dimensions $0$ and…
We describe a method for investigating the integrable character of a given three-point mapping, provided that the mapping has confined singularities. Our method, dubbed "express", is inspired by a novel approach recently proposed by R.G.…
This thesis presents two descriptions of complexity in dynamical systems. The algebraic approach deals with the differential Galois group theory and its restrictions on integrability. The geometric part is a formulation of dynamics in the…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
We investigate circuit complexity to characterize chaos in multiparticle quantum systems. In the process, we take a stride to analyze open quantum systems by using complexity. We propose a new diagnostic of quantum chaos from complexity…