Related papers: Solvable Chaos
To make research of chaos more friendly with discrete equations, we introduce the concept of an unpredictable sequence as a specific unpredictable function on the set of integers. It is convenient to be verified as a solution of a discrete…
We describe a new class of positive linear discrete-time switching systems for which the problems of stability or stabilizability can be resolved constructively. This class generalizes the class of systems with independently switching state…
In this chapter, we consider a class of discrete dynamical systems defined on the homogeneous space associated with a regular tiling of $\R^N$, whose most familiar example is provided by the $N-$dimensional torus $\T ^N$. It is proved that…
We present a new chaotic system of three coupled ordinary differential equations, limited to quadratic nonlinear terms. A wide variety of dynamical regimes are reported. For some parameters, chaotic reversals of the amplitudes are produced…
In the present study, we investigate the dynamics of impulsive differential equations driven by a chaotic system. We rigorously prove that, likewise the drive, the response impulsive system is also chaotic. Our results are based on the…
The paper is focused on the discussion of the phenomenon of transitional chaos in dynamic autonomous and non-autonomous systems. This phenomenon involves the disappearance of chaotic oscillations in specific time periods and the system…
We present a definition of chaotic Delone set, and establish the genericity of chaos in the space of $(\epsilon,\delta)$-Delone sets for $\epsilon\geq \delta$. We also present a hyperbolic analogue of the cut-and-project method that…
We discuss the method of folding for discrete planar systems and use it to establish the existence or non-existence of cycles or chaos in planar systems of rational difference equations with variable coefficients. These include some systems…
The truly chaotic finite machines introduced by authors in previous research papers are presented here. A state of the art in this discipline, encompassing all previous mathematical investigations, is provided, explaining how finite state…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We introduce the notion of domain-structured chaos and apply it to establish a connection between stochastic dynamics and deterministic chaos.
In this paper we extend the concept of separatrix reconnection into chaotic regimes. We show that even under chaotic conditions one can still understand abrupt jumps of diffusive-like processes in the relevant phase-space in terms of…
Impulsive control is used to suppress the chaotic behavior in an one-dimensional discrete supply and demand dynamical system. By perturbing periodically the state variable with constant impulses, the chaos can be suppressed. It is proved…
We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
Chaos degree defined through two complexities in information dynamics is applied to some deterministic dynamical models. It is shown that this degree well describes the chaostic feature of the models.
We deal with a set of solutions of the continuous multi-valued dynamical systems on $\mathbb{R}^2$ of the form $\dot x \in F(x)$ where $F(x)$ is a set-valued function and $F=\{f_1,f_2\}$. Such dynamical systems are frequently used in…
The scalar nonlinear Schrodinger (NLS) equation and a suitable discretization are well known integrable systems which exhibit the phenomena of ``effective'' chaos. Vector generalizations of both the continuous and discrete system are…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…