{'fraction_non_alphanumeric': 0.043039817028797174, 'fraction_numerical': 0.012163426551616592, 'mean_word_length': 4.777777777777778, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 4, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Hidden Attractors in Discrete Dynamical Systems

Research using chaos theory allows for a better understanding of many phenomena modeled by means of dynamical systems. The appearance of chaos in a given process can lead to very negative effects, e.g., in the construction of bridges or in systems based on chemical reactors. This problem is important, especially when in a given dynamic process there are so-called hidden attractors. In the scientific literature, we can find many works that deal with this issue from both the theoretical and practical points of view. The vast majority of these works concern multidimensional continuous systems. Our work shows these attractors in discrete systems. They can occur in Newton’s recursion and in numerical integration.


Introduction
In nature, many phenomena are generated by dynamical systems. These are, i.a., fixed points, periodic or non-periodic (quasiperiodic) oscillations, as well as chaotic oscillations. From a scientific and practical point of view, chaotic oscillations are the most interesting. They are found both in engineering (e.g., in chemical reactors [1][2][3]) and in such fields as cryptography (e.g., [4]). Research in the field of chaos covers issues such as hyperchaos and multistability [5,6], Lyapunov exponents [7], or systems with lags [8]. One of the aspects of research on chaos is the so-called hidden attractors. Much has been said in the scientific literature about so-called hidden attractors, including hidden stable periodic attractors and hidden chaotic attractors. We deal with a hidden attractor when the mathematical model of a given system does not have a constant dynamic equilibrium point (stationary point). Previous literature reports on this subject concern both dynamic continuous systems (e.g., [9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25]), and discrete multidimensional dynamic systems (for example: [26][27][28][29][30]). Research on this issue is crucial because it can protect the system from dangerous, chaotic oscillations. However, due to their nature, it is difficult to find them at the design stage [31]. Dynamical systems with hidden attractors may also have a positive impact on the development of some fields, for example, in the encryption of images [22,32,33] or in the wireless control of mobile robots [34].
This work presents examples of periodic orbits without an equilibrium point and hidden chaotic attractors in one-dimensional discrete systems. Using Lyapunov's exponents it was shown that periodic orbits without an equilibrium point are unstable. These orbits are a solution of the multiple compounding of a given discrete transformation, which means that their detection by means of numerical simulation is practically impossible. This problem is significantly simplified when the mathematical model of a given discrete system is an even or at least symmetric function. From the examples presented in this paper, mathematical dependencies were derived that explicitly define the unstable periodic orbits. Hidden chaotic attracting orbits have been determined only numerically. The behavior of partial sums composed of elements of chaotic attractors was also investigated in this work. The fractal nature of these sums was shown, which is presented in the appropriate figure.
The goal of our work is to show that hidden chaotic attractors can occur not only in complex multivariate continuous systems but also in simple single discrete systems that are, for example, described by recursive equations, and that they are quite common in such systems. We also demonstrate repellers in discrete systems without an equilibrium point. The scientific literature mainly deals with hidden attractors in continuous systems. There is, however, a clear deficiency in discrete systems.
In our work, we use tools of nonlinear dynamics, especially chaotic dynamics and fractals. These are primarily the formulas for calculating the Lyapunov exponents, the sensitivity test on the change of initial conditions, and the phase diagram in the form of a discrete fractal map ( Figure 5).
This article is structured as follows: The Introduction section provides an overview of the topic and an overview of similar works in the scientific literature; the Mathematical Foundations section describes a method of constructing discrete maps that generate hidden orbits as a result of iteration; in the next part examples of maps constructed with the proposed method are presented; then, in the section devoted to the Euler method, the method of constructing maps on the example of numerical integration is shown. The article ends with conclusions and references.

Mathematical Foundations
Suppose a function f (x) such that for every real number x: To derive a discrete model without a fixed point, we will use the well-known Newton's method for determining the roots of the equation. Thus, the following recursive Newton process: is not a convergent process. This means that the transformation (2) does not have a dynamic equilibrium point (fixed point). In this case, the stable periodic orbits and the chaotic attracting orbits are hidden ones. F (m) (x) should be understood as the m-th composition of the recursive transform (2) (m-th cycle). All m-periodic orbits (m > 1) can be determined from the m-th transformation of the relationship (2): Assuming: x k+m = x k = x sm , the m-periodic orbit are the roots of the equation (m > 1): In case when the function f (x) is even, i.e., f (x) = f (−x), the two-period orbit is defined by the points x s1 = −x s2 . They can be determined directly from (2) as a solution to the equation: In the case where f (x) is a symmetrical function with respect to x * = 0, the plot of the function should be shifted so that the zero point becomes the point of symmetry and then formula (5) should be applied. In all other cases, formula (4) should be used to determine other periodic orbits. The other attracting orbits are chaotic orbits.

Examples
Example 1. Let us suppose: This equation has no solution, and the function f (x) is an even function. Therefore, applying Formula (5), we get that the two-period orbit of transformation (2) are the points: This orbit is unstable, as evidenced by the value of Lyapunov's exponent: This transformation also has a hidden chaotic attracting orbit (Figure 1).
This equation has no solution, and the function f (x) is an even function. Therefore, applying Formula (5), we get that the two-period orbit of transformation (2) are the points: This orbit is unstable, as evidenced by the value of Lyapunov's exponent: This transformation also has a hidden chaotic attracting orbit (Figure 2).

Example 3.
Let us suppose: This equation has no solution. The function f (x) is not an even function, but it is a symmetrical function with respect to the point x * = − 1 2 . The two-period orbit of Transformation (2) is defined in this case by the points: This orbit is unstable, as evidenced by the value of Lyapunov's exponent: This transformation also has a hidden chaotic attracting orbit (Figure 3). The remaining higher-order orbits (m > 2), occurring in the above examples, can be determined using Formula (4).

Example 4
Example 4. Let us suppose: This equation has no solution, and the function f (x) is neither even nor symmetric. Transformation (2) based on this function has no periodic orbit, but a chaotic attracting orbit (Figure 4). An interesting issue is to check the behavior of average partial sums, defined as: Taking into account Example 1, the points with the coordinates (S k , S k+1 ) are marked in Figure 5.

Hidden Chaotic Attractors with Euler Integration Method
Suppose we have the following differential equation: where g(x) = 0 has no solution. Let us say the function g(x) can be represented as: which, in conjunction with (17), gives: where f (x) = 0 has no solution.
Simple transformations of dependencies (19) lead to the general final form: where x 0 = x(t = 0). It is clearly visible that for t = 0, Equation (20) has a solution that is x = x 0 . Therefore, there must be a limit t l , above which the equation no longer has a solution. Suppose, for example, that: where then: It is thus clear that in this case: Integrating Equation (17) using the Euler method we obtain the recursion: This means that for t < t l the numerical process tends to a specific value of the variable x (for t = t l x = 0), while for t > t l the numerical process becomes chaotic and has the feature of hidden chaos, regardless of the value of the integration variable ∆t. This phenomenon is shown in Figure 6 for x 0 = 3. The limit value, in this case, is t l = 2.3026.

Summary
The examples presented in the paper show the existence of unstable periodic orbits without an equilibrium point and hidden chaotic attracting orbits in discrete models. In the scientific literature, these attracting orbits are called "hidden" because the mathematical models from which they were generated do not have dynamic equilibrium points. Therefore, detecting these types of orbits is extremely difficult. For these examples, mathematical formulas were derived to define unstable periodic orbits without an equilibrium point. Newton's method and Euler's method utilized in the work are used to obtain discrete mappings that generate hidden chaotic solutions for appropriately selected functions. The examples presented in the paper show the existence of unstable periodic orbits without an equilibrium point and hidden chaotic orbits in discrete models.

Conflicts of Interest:
The authors declare no conflict of interest.