Related papers: Singularity confinement and chaos in discrete syst…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
In contrast to dyadic interactions, higher-order interactions may contain one another, with subgroups naturally embedded within larger groups. These containment patterns arise empirically in ecology, sociology, computer science and the…
In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to…
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…
This note is concerned with weakly interacting stochastic particle systems with possibly singular pairwise interactions. In this setting, we observe a connection between entropic propagation of chaos and exponential concentration bounds for…
We introduce a family of discrete dynamical systems which includes, and generalizes, the mutation dynamics of rank two cluster algebras. These systems exhibit behavior associated with integrability, namely preservation of a symplectic form,…
In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…
Two-dimensional driven dissipative flows are generally integrable via a conservation law that is singular at equilibria. Nonintegrable dynamical systems are confined to n*3 dimensions. Even driven-dissipative deterministic dynamical systems…
A particularly simple model belonging to a wide class of coupled maps which obey a local conservation law is studied. The phase structure of the system and the types of the phase transitions are determined. It is argued that the structure…
We address the problem of the relative importance of the intrinsic chaos and the external noise in determining the complexity of population dynamics. We use a recently proposed method for studying the complexity of nonlinear random…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…
We show analytically that Newtonian iterations, when applied to a polynomial equation, have a positive topological entropy. In a specific example of an attempt to ``find'' the real solutions of the equation $x^2+1=0$, we show that the…
Complex systems are characterised by a tight, nontrivial interplay of their constituents, which gives rise to a multi-scale spectrum of emergent properties. In this scenario, it is practically and conceptually difficult to identify those…
Integrable difference equations commonly have more low-order conservation laws than occur for nonintegrable difference equations of similar complexity. We use this empirical observation to sift a large class of difference equations, in…
The full family of discrete logistic maps has been widely studied both as a canonical example of the period-doubling route to chaos, and as a model of natural processes. In this paper we present a study of the stochastic process described…
We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…
In contrast to entropy, which increases monotonically, the "complexity" or "interestingness" of closed systems seems intuitively to increase at first and then decrease as equilibrium is approached. For example, our universe lacked complex…
We apply the results of singularity analysis to the isotropic cosmological models in general relativity and string theory with a variety of matter terms. For some of these models the standard Painlev\'{e} test is sufficient to demonstrate…