Related papers: Singularity confinement and chaos in discrete syst…
We confront two integrability criteria for rational mappings. The first is the singularity confinement based on the requirement that every singularity, spontaneously appearing during the iteration of a mapping, disappear after some steps.…
We examine the validity of the results obtained with the singularity confinement integrability criterion in the case of discrete Painlev\'e equations. The method used is based on the requirement of non-exponential growth of the homogeneous…
We describe the various types of singularities that can arise for second order rational mappings and we discuss the historical and present-day, practical, role the singularity confinement property plays as an integrability detector. In…
We present a new approach to singularity confinement which makes it an efficient and reliable discrete integrability detector. Our method is based on the full-deautonomisation procedure, which consists in analysing non-autonomous extensions…
We present a quasi-integrable two-dimensional lattice equation: i.e., a partial difference equation which satisfies a criterion of integrability, singularity confinement, although it has a chaotic aspect in the sense that the degrees of its…
Two important notions of integrability for discrete mappings are algebraic integrability and singularity confinement, have been used for discrete mappings. Algebraic integrability is related to the existence of sufficiently many conserved…
The deautonomisation of birational maps that have the singularity confinement property, i.e. the construction of nonautonomous versions of such maps that preserve the singularity properties of the original, has proven crucial in our…
We investigate indeterminate points in discrete integrable system. They appear in singularity confinement phenomenon naturally. We develop a method to analyse indeterminate points of dynamical maps and using this method we clarify behaviour…
The singularity confinement test is very useful for isolating integrable cases of discrete-time dynamical systems, but it does not provide a sufficient criterion for integrability. Quite recently a new property of the bilinear equations…
We examine the notion of anticonfinement and the role it has to play in the singularity analysis of discrete systems. A singularity is said to be anticonfined if singular values continue to arise indefinitely for the forward and backward…
We examine a family of discrete second-order systems which are integrable through reduction to a linear system. These systems were previously identified using the singularity confinement criterion. Here we analyse them using the more…
We study the link between the degree growth of integrable birational mappings of order higher than two and their singularity structures. The higher order mappings we use in this study are all obtained by coupling mappings that are…
We investigate the spread complexity of a generic two-level subsystem of a larger system to analyze the influence of energy level statistics, comparing chaotic and integrable systems. Initially focusing on the nearest-neighbor level…
In this paper we present a rigorous method for deciding whether a birational three point mapping that has the singularity confinement property is integrable or not, based only on the structure of its (confined) singularity patterns. We also…
Integrability of the differential constraints arising from the singularity analysis of two (1+1)-dimensional second-order evolution equations is studied. Two nonlinear ordinary differential equations are obtained in this way, which are…
Intrinsic computation refers to how dynamical systems store, structure, and transform historical and spatial information. By graphing a measure of structural complexity against a measure of randomness, complexity-entropy diagrams display…
We introduce two numerical conjugacy invariants for dynamical systems -- the complexity and weak complexity indices -- which are well-suited for the study of "completely integrable" Hamiltonian systems. These invariants can be seen as "slow…
Different 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…
We introduce a series of discrete mappings, which is considered to be an extension of the Hietarinta-Viallet mapping with one parameter. We obtain the algebraic entropy for this mapping by obtaining the recurrence relation for the degrees…
We consider an integrability test for ultradiscrete equations based on the singularity confinement analysis for discrete equations. We show how singularity pattern of the test is transformed into that of ultradiscrete equation. The…