相关论文: Singularity confinement and chaos in discrete syst…

We present a systematic construction of integrable third order systems based on the coupling of an integrable second order equation and a Riccati equation. This approach is the extension of the Gambier method that led to the equation that…

Evolutionary complexity is here measured by the number of trials/evaluations needed for evolving a logical gate in a non-linear medium. Behavioural complexity of the gates evolved is characterised in terms of cellular automata behaviour. We…

This paper establishes some criteria of chaos in non-autonomous discrete systems. Several criteria of strong Li-Yorke chaos are given. Based on these results, some criteria of distributional chaos in a sequence are established. Moreover,…

We present a method for calculating the dynamical degree of a mapping with unconfined singularities. It is based on a method introduced by Halburd for the computation of the growth of the iterates of a rational mapping with confined…

We study correlation measures for complex systems. First, we investigate some recently proposed measures based on information geometry. We show that these measures can increase under local transformations as well as under discarding…

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

After a brief introduction to the Painlev\'{e} property for ordinary differential equations, we present a concise review of the various methods of singularity analysis which are commonly referred to as Painlev\'{e} tests. The tests are…

We apply the algebraic-geometric techniques developed for the study of mappings which have the singularity confinement property to mappings which are integrable through linearisation. The main difference with respect to the previous studies…

We treat three cubic recurrences, two of which generalize the famous iterated map $x \mapsto x (1-x)$ from discrete chaos theory. A feature of each asymptotic series developed here is a constant, dependent on the initial condition but…

We study singularity confinement phenomena in examples of delay-differential Painlev\'e equations, which involve shifts and derivatives with respect to a single independent variable. We propose a geometric interpretation of our results in…

In this letter we give fourth-order autonomous recurrence relations with two invariants, whose degree growth is cubic or exponential. These examples contradict the common belief that maps with sufficiently many invariants can have at most…

A monotone self-mapping of the nonnegative orthant induces a monotone discrete-time dynamical system which evolves on the same orthant. If with respect to this system the origin is attractive then there must exists points whose image under…

We prove the holding of chaos in the sense of Li-Yorke for a family of four-dimensional discrete dynamical systems that are naturally associated to ODE systems describing coupled oscillators subject to an external non-conservative force,…

Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…

In recent studies, new measures of complexity for nonlinear systems have been proposed based on probabilistic grounds, as the LMC measure (Phys. Lett. A {\bf 209} (1995) 321) or the SDL measure (Phys. Rev. E {\bf 59} (1999) 2). All these…

This paper presents an application of partial contraction analysis to the study of global synchronization in discrete chaotic systems. Explicit sufficient conditions on the coupling strength of networks of discrete oscillators are derived.…

We develop a theory of classical complexity. We study the relations between classical complexity and entropy, and conjecture that in an isolated system, classical absolute complexity always tends to grow, until it reaches its maximum. We…

The disorder and a simple convex measure of complexity are studied for rank ordered power law distributions, indicative of criticality, in the case where the total number of ranks is large. It is found that a power law distribution may…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

The heights of iterates of the discrete Painleve equations over number fields appear to grow no faster than polynomials while the heights of generic solutions of non-integrable discrete equations grow exponentially. This gives rise to a…