Next Article in Journal
A New Hard Problem for Post-Quantum Cryptography: Q-Problem Primitives
Previous Article in Journal
Research on Indoor Object Detection and Scene Recognition Algorithm Based on Apriori Algorithm and Mobile-EFSSD Model
Previous Article in Special Issue
Identification of a Time-Dependent Source Term in Multi-Term Time–Space Fractional Diffusion Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

General Construction Method and Proof for a Class of Quadratic Chaotic Mappings

by
Wenxia Xu
1,2,
Xiangkun Chen
1,2,
Ziwei Zhou
3,*,
Guodong Li
1,2 and
Xiaoming Song
4,*
1
School of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541002, China
2
Center for Applied Mathematics of Guangxi (GUET), Guilin 541002, China
3
School of Mathematics and Data Science, Changji University, Changji 831100, China
4
School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541002, China
*
Authors to whom correspondence should be addressed.
Mathematics 2025, 13(15), 2409; https://doi.org/10.3390/math13152409
Submission received: 4 June 2025 / Revised: 19 July 2025 / Accepted: 22 July 2025 / Published: 26 July 2025

Abstract

The importance of chaotic systems as the main pseudo-random cryptographic generator of encryption algorithms in the field of communication secrecy cannot be overstated, but in practical applications, researchers often choose to build upon traditional chaotic maps, such as the logistic map, for study and application. This approach provides attackers with more opportunities to compromise the encryption scheme. Therefore, based on previous results, this paper theoretically investigates discrete chaotic mappings in the real domain, constructs a general method for a class of quadratic chaotic mappings, and justifies its existence based on a robust chaos determination theorem for S single-peaked mappings. Based on the theorem, we construct two chaotic map examples and conduct detailed analysis of their Lyapunov exponent spectra and bifurcation diagrams. Subsequently, comparative analysis is performed between the proposed quadratic chaotic maps and the conventional logistic map using the 0–1 test for chaos and SE complexity metrics, validating their enhanced chaotic properties.

1. Introduction

Discrete chaotic mappings are a widely studied class of mathematical models in dynamical systems and chaos theory, which can be used to describe the nonlinear dynamic behavior of various natural and social phenomena. The logistic map is widely used in various types of chaotic cryptosystems because of their fast operation and easy control. In 1976, the famous biologist May proposed the logistic mathematical model [1]. The proposal of the logistic map can be said to be the beginning of the study of discrete chaotic systems, which is important for the development of discrete chaotic systems. After that, many discrete chaotic systems were proposed, such as the familiar tent mapping [2] and cubic mapping [3]. The study of discrete chaotic mappings is not only important for theoretical science but also has a wide range of applications. For example, it has important applications in communication encryption [4] and image encryption [5,6,7,8,9]. Therefore, the in-depth study of discrete chaotic mappings has important theoretical and practical significance.
Kocarev et al. [10] proposed that when designing chaotic ciphers, the chosen chaotic mapping must at least have the three properties of mixing property, robustness, and large parameter sets. Combining property means spreading the influence of each plaintext to as many ciphertexts as possible. Robustness is the ability of a chaotic system to remain chaotic under small parameter perturbations, which also guarantees its fundamental space diffusion properties. When constructing a chaotic cryptographic algorithm, in the step of selecting and using chaotic systems, we should try if possible to choose chaos with hybridity and robustness in a large set of parameters. Chaotic laser signals have also shown many excellent properties in secure communications and have received a lot of attention and research results. For example, a fractional-order hyperchaotic demodulated laser system (FHDLS) was presented by Li et al. Then they combined FHDLS, an improved hybrid scrubbing algorithm, and a DNA variant diffusion algorithm to design an image encryption system with high-security performance [11]. Yang et al. constructed an improper fractional-order laser chaos system and designed a new image cryptosystem based on this system [12]. In the above-mentioned papers, the chaotic systems they chose all satisfy the three properties of hybridization, robustness, and large parameter sets.
In recent years, with the development of chaotic control technology, the study of chaotic robustness has also received wide attention. Many scholars have studied chaotic robustness from different perspectives. Some of these studies focus on modeling and analysis of chaotic systems [13,14,15], while others focus on control and optimization of chaotic systems. In modeling and analysis of chaotic systems, many scholars have used various mathematical methods, such as differential equations, mappings, and fractals [16] to explore the properties of chaotic systems. In the control and optimization of chaotic systems [17,18], many scholars have proposed various control methods, such as feedback control, open-loop control, and chaotic synchronous control. For example, Li et al. [19] proposed a feedback control-based method that can achieve robust control of chaotic systems. Therefore, it is particularly important to enhance the properties of chaotic systems, especially to improve the robustness of chaotic systems from a theoretical point of view. Chaotic robustness is a complex and important problem with a wide range of applications in areas such as chaotic control and optimization. The primary contributions and key research outcomes presented in this work include the following:
By integrating the necessary conditions for S single-peak mapping with robust chaos theorems, this paper proposes a general construction methodology for quadratic chaotic maps and provides rigorous proof of its validity.
Based on the proposed methodology, two quadratic chaotic maps under distinct conditions are constructed. Their chaotic characteristics are confirmed through analysis of ergodic properties in phase space, bifurcation diagrams, and Lyapunov exponent spectra. Subsequently, comparative 0–1 testing and SE complexity analysis against the conventional logistic map demonstrate the enhanced chaotic properties of the quadratic chaotic systems.
The rest of the paper is organized as follows: In Section 2, based on the S-peak mapping theorem, this work establishes the parameter ranges and provides rigorous mathematical justification for a general class of quadratic chaotic maps. In Section 3, guided by the proposed theorem, four quadratic chaotic maps are designed. Their chaotic properties are verified through analysis of ergodicity in phase space, bifurcation diagrams, and Lyapunov exponent spectra. Subsequent comparative 0–1 testing and SE complexity analysis against the conventional logistic map demonstrate the enhanced chaotic characteristics of the constructed quadratic chaotic systems.

2. Robust Chaos for General Quadratic Mapping

Based on Li-York’s “period three implies chaos” theorem, Hailing Zhou et al. proposed a sufficient necessary condition to judge quadratic polynomials with three periodic points [20], and Andrecut and Ali proposed a judgment theorem [21] for robust chaos of S-single-peaked mappings.
Definition 1. 
Mapping φ x : J = p , q J is called S Single-peak mapping if the following conditions are satisfied.
(1) The mapping  φ x  has a continuous third-order derivative function;
(2)    p  is an immovable point, and there exists an original image  q , i.e.,  φ p = φ q = p ;
(3) The existence of a unique maximal point  m  on the interval  p , q  for the mapping  φ x  such that the mapping  φ x  strictly increases on the interval  p , m  and strictly decreases on the interval  m , q ;
(4) Mapping  φ x  has a negative Schwarzian derivatives, i.e., the following:
S φ , x = φ x φ x 3 ( φ x ) 2 2 ( φ x ) 2 < 0 .
The chaos theorem based on the S single-peaked mapping is as follows:
Theorem 1.  
If the mapping  φ v x : J = p , q J  is an  S  single-peaked mapping containing the parameters  v  and there exists a maximum at the point  m p , q  such that for any parameter  v v m i n , v m a x , φ v m = q , then the mapping  φ v x  for any parameter  v v m i n , v m a x  is chaotic.
Based on Definition 1 and Theorem 1, a robust chaos judgment theorem for general quadratic functions can be established.
Theorem 2. 
Let the mapping of general real quadratic functions take the following form:
φ x = a x 2 + b x + c   a 0 .
Let  ( b 1 ) 2 = v a c , if  v , 0 4 , + , the set of parameters  S = v , a , b  satisfy one of the following cases:
Condition (i)
a < 0 , b = 4 v 1 3 1 4 v 4 v 1 .
Condition (ii)
a < 0 , b = 4 v 1 + 3 1 4 v 4 v 1 .
Then  φ x : J = p , q J  is a single-peaked mapping,  p = b 1 2 a + ( b 1 ) 2 4 a c 2 a ,   q = b + 1 ( b 1 ) 2 4 a c 2 a .  And there exists a point  m = b 2 a p , q  that satisfies  φ m = q , i.e.,  φ x  is a quadratic chaotic mapping.
Proof. 
First, prove that if the set of parameters S = v , a , b satisfies condition (i), the φ x is a chaotic mapping.
Determine the symbols first.
When v > 4
b = 4 v 1 3 1 4 v 4 v 1 > 0 , c = ( b 1 ) 2 v a < 0 .
When v < 0
b = 4 v 1 3 1 4 v 4 v 1 > 0 , c = ( b 1 ) 2 v a > 0 .
By p = b 1 + ( b 1 ) 2 4 a c 2 a , q = b + 1 ( b 1 ) 2 4 a c 2 a , we have ( b 1 ) 2 4 a c > 0 regardless of v > 4 or v < 0 , and both have the position relation of p and q .
p q = ( b 1 ) + ( b 1 ) 2 4 a c 2 a ( b + 1 ) ( b 1 ) 2 4 a c 2 a = b + 1 + ( b 1 ) 2 4 a c + b + 1 + ( b 1 ) 2 4 a c 2 a = 2 + 2 ( b 1 ) 2 4 a c 2 a < 0 ,
then p < q .
Clearly, φ x has the third-order derivative
φ x = 2 a x + b ,
φ x = 2 a ,
φ x = 0 .
Satisfy condition (1) of Definition 1. Let φ 1 m = 0 , we can obtain m = b 2 a . And a < 0 , m = b 2 a is the local maximum point of φ x . φ x is increasing on , m and decreasing on  m , + .
Then prove that φ x satisfies condition (2) of Definition 1, i.e., satisfies φ p = φ q = p , then
φ ( p ) = a p 2 + b p + c = a ( ( b 1 ) + ( b 1 ) 2 4 a c 2 a ) 2 + b ( ( b 1 ) + ( b 1 ) 2 4 a c 2 a ) + c = ( ( b 1 ) + ( b 1 ) 2 4 a c ) 2 4 a + 2 b ( ( b 1 ) + ( b 1 ) 2 4 a c ) 4 a + 4 a c 4 a = ( b 1 ) + ( b 1 ) 2 4 a c 2 a = p ,
φ ( q ) = a q 2 + b q + c = a ( ( b + 1 ) ( b 1 ) 2 4 a c 2 a ) 2 + b ( ( b + 1 ) ( b 1 ) 2 4 a c 2 a ) + c = b 2 + 2 b + 1 + 2 ( b + 1 ) ( b 1 ) 2 4 a c + ( b 1 ) 2 4 a c 2 b ( b + 1 ) 2 b ( b 1 ) 2 4 a c + 4 a c 4 a = 2 b 2 + 2 + 2 b ( b 1 ) 2 4 a c + 2 ( b 1 ) 2 4 a c 2 b 2 2 b 2 b ( b 1 ) 2 4 a c 4 a = ( b 1 ) + ( b 1 ) 2 4 a c 2 a = p ,
then φ p = φ q = p .
Now judge the relationship between the positions of p , q , and m
p m = ( b 1 ) + ( b 1 ) 2 4 a c 2 a ( b 2 a ) = 1 ( b 1 ) 2 4 a c 2 a < 0 ,
q m = ( b + 1 ) ( b 1 ) 2 4 a c 2 a ( b 2 a ) = 1 ( b 1 ) 2 4 a c 2 a > 0 ,
thus p < m < q . In the interval p , q , m = b 2 a is the only local maximum point, φ x is increasing on p , m and decreasing on m , q .
Finally, prove that φ x has negative Schwarzian derivatives in p , q for any  x p , q
S ( φ , x ) = φ ( x ) φ x 3 ( φ ( x ) ) 2 2 ( φ x ) 2 = 0 2 a x + b 3 ( 2 a ) 2 2 ( 2 a x + b ) 2 < 0 .
Then φ x has negative Schwarzian derivatives in p , q . So when v > 4 or v < 0 , φ x is the S single-peaked mapping.
And because   ( b 1 ) 2 v = a c
  ( b 1 ) 2 v = a c
and b = 4 v   1 3 1 4 v 4 v   1 that have
φ ( m ) q = 4 ( b 1 ) 2 v b 2 + 2 b + 2 + 2 ( b 1 ) 1 4 v 4 a = ( 4 v 1 3 1 4 v 4 v 1 1 ) 2 v a 1 4 a ( 4 v 1 3 1 4 v 4 v 1 ) 2 + 1 2 a ( 4 v 1 3 1 4 v 4 v 1 ) + 1 2 a + 2 ( 4 v 1 3 1 4 v 4 v 1 1 ) 1 4 v 4 a = 36 v ( 1 4 v ) ( 1 + 6 1 4 v + 9 1 4 v ) + 2 + 6 1 4 v + 2 + 6 4 a = 0 ,
which satisfies Theorem 1, then the quadratic polynomial φ x is chaotic on the interval p , q . □
Proof. 
It is proved below that φ x is a chaotic mapping if the parameter set S = v , a , b satisfies condition (ii).
First of all, there are still the judgment symbols.
When v > 4
b = 4 v 1 + 3 1 4 v 4 v 1 < 0 , c = ( b 1 ) 2 v a < 0 .
When 1 2 < v < 0
b = 4 v 1 + 3 1 4 v 4 v 1 > 0 , c = ( b 1 ) 2 v a > 0 .
When v < 1 2
b = 4 v 1 + 3 1 4 v 4 v 1 < 0 , c = ( b 1 ) 2 v a > 0 .
By p = b 1 + ( b 1 ) 2 4 a c 2 a ,   q = b + 1 ( b 1 ) 2 4 a c 2 a , whether v > 4 or v < 0 , we have b 1 2 4 a c > 0 and both have the position relation between p and q
p q = ( b 1 ) + ( b 1 ) 2 4 a c 2 a ( b + 1 ) ( b 1 ) 2 4 a c 2 a = b + 1 + ( b 1 ) 2 4 a c + b + 1 + ( b 1 ) 2 4 a c 2 a = 2 + 2 ( b 1 ) 2 4 a c 2 a < 0
then p < q .
The proof process is similar to condition (i), and from Equations (8)–(10), we discover that φ x has the third-order derivative. Let φ 1 m = 0 , we obtain m = b 2 a . a < 0 and m = b 2 a is the local maximum point of φ x . φ x is increasing on , m and decreasing on m , + . Satisfied Equations (11) and (12), φ p = φ q = p , satisfies condition (2) of Definition 1.
From Equation (15), φ x has negative Schwarzian derivatives in the interval p , q . Therefore, when  v > 4 or v < 1 2 , φ x is an S single-peaked mapping.
Finally, prove that φ x is chaotic under condition (ii), since ( b 1 ) 2 v = a c , with
φ ( m ) q = a m 2 + b m + c ( b + 1 ) ( b 1 ) 2 4 a c 2 a = a ( b 2 a ) 2 + b ( b 2 a ) + c ( b + 1 ) ( b 1 ) 2 4 a c 2 a = 4 a c b 2 + 2 b + 2 + 2 ( b 1 ) 2 4 a c 4 a = 4 ( b 1 ) 2 v b 2 + 2 b + 2 + 2 ( b 1 ) 1 4 v 4 a
and b = 4 v   1 3 1 4 v 4 v   1 that have
φ ( m ) q = 4 ( b 1 ) 2 v b 2 + 2 b + 2 + 2 ( b 1 ) 1 4 v 4 a = 4 ( 4 v 1 3 1 4 v 4 v 1 1 ) 2 v ( 4 v 1 3 1 4 v 4 v 1 ) 2 + 2 ( 4 v 1 3 1 4 v 4 v 1 ) + 2 4 a + 2 ( 4 v 1 3 1 4 v 4 v 1 1 ) 1 4 v 4 a = 36 v ( 1 4 v ) ( 1 + 6 1 4 v + 9 1 4 v ) + 2 + 6 1 4 v + 2 + 6 4 a = 0 ,
which satisfies Theorem 1, and then the quadratic polynomial φ x is chaotic on the interval p , q . □
In summary, if φ x satisfies any of the conditions of Theorem 2, φ x is chaotic.

3. Example Verification

Based on the quadratic chaotic mapping of the general form given above (Theorem 2), Matlab is used to verify whether the iterative sequence has chaotic properties if the parameters satisfy any of the cases in the theorem.

3.1. The Quadratic Discrete Mapping

Construct the quadratic discrete mapping as follows:
x n + 1 = a x n 2 + b x n + c
Take the parameter a = 3 , v = 5.2 and v = 5.2 , respectively, substituted into the two cases of Theorem 2, and the calculation results are shown in Table 1, the function graph and the chaotic scatter plot of x n obtained by n = 10,000 times iterations are shown in Figure 1.
Figure 1 displays phase space plots of the quadratic chaotic map under condition (i) and condition (ii). Analysis demonstrates that when v > 4 , v < 0 and all parameters satisfy any condition specified in Theorem 2, chaotic dynamics emerge over p , q . From Figure 1a–d, it can be seen that after only 10,000 iterations, x n spreads over almost all values of the interval 0.5408 , 1.8742 , 1.5408 , 0.2075 , 0.1241 , 1.2092 and 0.8759 , 0.4574 , with a high degree of complexity. And outside the interval, the whole system is stable, so the chaotic system has good ergodicity and unpredictability.

3.2. Bifurcation Diagrams and Lyapunov Exponent Spectra

Taking the parameter v > 4 as an example, Figure 2 and Figure 3 demonstrate the bifurcation diagrams and Lyapunov exponent spectra of the chaotic map under Condition (i) and Condition (ii), respectively.
Figure 2 presents the bifurcation diagram and Lyapunov exponent spectrum for the quadratic chaotic map in Condition (i), with parameters a 4.5 , 1.5 , v 10 , 10 , and initial value x 1 0.55 , 1.87 . Figure 3 presents the bifurcation diagram and Lyapunov exponent spectrum for the quadratic chaotic map in Condition (ii), with parameters a 4.5 , 1.5 , v 10 , 10 , and initial value x 1 1.54 , 0.21 . Figure 2 and Figure 3 demonstrate that the system exhibits chaotic dynamics across the specified parameter ranges. This confirms that under the conditions of Theorem 2, a valid quadratic chaotic map can be constructed.

3.3. Chaos Detection: 0–1 Test and SE Complexity Metrics

For the above quadratic chaotic maps in Condition (i) and Condition (ii) with fixed parameters and initial values, we conduct the 0–1 test for chaos and spectral entropy (SE) complexity metrics, with comparative analysis against the standard logistic map. Figure 4 presents the p , s phase diagrams for both systems.
Figure 4 reveals that the p , s phase diagrams for quadratic chaotic maps in both Condition (i) and Condition (ii) exhibit Brownian-like motion with significantly greater complexity than those of the Logistic map. Table 2 presents the spectral entropy (SE) and 0–1 test results for both quadratic chaotic maps under the two conditions and the Logistic map. The data further confirm the superior chaotic performance of quadratic chaotic maps over the Logistic map.

4. Conclusions

Building upon existing theoretical foundations, this work conducts an in-depth investigation into discrete chaotic mappings over real domains. A universal construction methodology for quadratic chaotic maps is established, with rigorous verification of its existence based on robust chaos theorems for unimodal mappings. Furthermore, two parametric conditions of quadratic chaotic maps are constructed according to the theorem. Their chaotic characteristics are validated through analysis of phase space ergodicity, bifurcation diagrams, and Lyapunov exponent spectra. Finally, performance evaluation via 0–1 testing for chaos and SE complexity metrics demonstrates significantly enhanced chaotic properties compared to the classical logistic map. Future research will explore the application potential of the constructed mappings.

Author Contributions

All authors contributed to the study conception and design. X.C. carried out the simulations and experiments and wrote the first draft of the manuscript. Material preparation, data collection and analysis were performed by G.L., W.X., Z.Z. and X.S. All authors commented on previous versions of the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Guangxi Center for Applied Mathematics (Grant No. GuikeAD23023002), (grant No. GuikeAD25069086), the Natural Science Foundation of Guangxi province (grant No. 2022 gxnsfaa 035554), and the Guilin University of Electronic Technology Fund of Guodong Li (grant No. YSZ202503).

Data Availability Statement

No data were used for the research described in the article.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. May, R.M. Simple mathematical models with very complicated dynamics. Nature 1976, 261, 459–467. [Google Scholar] [CrossRef]
  2. Liao, G.; Wang, L. Almost periodicity, chain recurrence and chaos. Isr. J. Math. 1996, 93, 145–156. [Google Scholar] [CrossRef]
  3. Hoppe, V. Specification of geometrical parameters for elements with cubic mapping functions. Int. J. Numer. Methods Eng. 1973, 7, 94–98. [Google Scholar] [CrossRef]
  4. Zhao, H.; Xie, S.; Zhang, J.; Wu, T. A Dynamic Block Image Encryption Using Variable-Length Secret Key and Modified Henon. Map. Opt. 2021, 230, 166307. [Google Scholar] [CrossRef]
  5. Feng, W.; Zhang, J.; Chen, Y.; Qin, Z.; Zhang, Y.; Ahmad, M.; Woźniak, M. Exploiting robust quadratic polynomial hyperchaotic map and pixel fusion strategy for efficient image encryption. Expert Syst. Appl. 2024, 246, 123190. [Google Scholar] [CrossRef]
  6. Gu, Y.; Li, G.; Xu, X.; Song, X.; Zhong, H. Solution of a new high-performance fractional-order Lorenz system and its dynamics analysis. Nonlinear Dyn. 2023, 111, 1–25. [Google Scholar] [CrossRef]
  7. Ye, C.; Tan, S.; Wang, J.; Shi, L.; Zuo, Q.; Feng, W. Social Image Security with Encryption and Watermarking in Hybrid Domains. Entropy 2025, 27, 276. [Google Scholar] [CrossRef]
  8. Feng, W.; Yang, J.; Zhao, X.; Qin, Z.; Zhang, J.; Zhu, Z.; Wen, H.; Qian, K. A Novel Multi-Channel Image Encryption Algorithm Leveraging Pixel Reorganization and Hyperchaotic Maps. Mathematics 2024, 12, 3917. [Google Scholar] [CrossRef]
  9. Feng, W.; Wang, Q.; Liu, H.; Ren, Y.; Zhang, J.; Zhang, S.; Qian, K.; Wen, H. Exploiting Newly Designed Fractional-Order 3D Lorenz Chaotic System and 2D Discrete Polynomial Hyper-Chaotic Map for High-Performance Multi-Image Encryption. Fractal Fract. 2023, 7, 887. [Google Scholar] [CrossRef]
  10. Kocarev, L.; Jakimoski, G. Logistic map as a block encryption algorithm. Phys. Lett. A 2001, 289, 199–206. [Google Scholar] [CrossRef]
  11. Li, X.; Mou, J.; Banerjee, S.; Wang, Z.; Cao, Y. Design and DSP implementation of a fractional-order detuned laser hyperchaotic circuit with applications in image encryption. Chaos Solitons Fractals 2022, 159, 112133. [Google Scholar] [CrossRef]
  12. Yang, F.; Mou, J.; Ma, C.; Cao, Y. Dynamic analysis of an improper fractional-order laser chaotic system and its image encryption application. Opt. Lasers Eng. 2020, 129, 106031. [Google Scholar] [CrossRef]
  13. Pecora, L.M.; Carroll, T.L. Synchronization in chaotic systems. Phys. Rev. Lett. 1990, 64, 821–824. [Google Scholar] [CrossRef]
  14. Zhang, J.; Xiao, X. Predicting chaotic time series using recurrent neural networks. Chinese Phys. Lett. 2000, 17, 88. [Google Scholar] [CrossRef]
  15. Tao, C.; Zhang, Y.; Jiang, J.J. Estimating system parameters from chaotic time series with synchronization optimized by a genetic algorithm. Phys. Rev. E 2007, 76, 016209. [Google Scholar] [CrossRef]
  16. Xu, X.L.; Li, G.D.; Dai, W.Y.; Song, X.M. Multi-direction chain and grid chaotic system based on julia fractal. Fractals 2021, 29, 2150264. [Google Scholar] [CrossRef]
  17. Abedini, M.; Vatankhah, R.; Assadian, N. Stabilizing chaotic system on periodic orbits using multi-interval and modern optimal control strategies. Commun. Nonlinear Sci. Numer. Simul. 2012, 17, 3832–3842. [Google Scholar] [CrossRef]
  18. Mohammadi, S.; Hejazi, S.R. Using particle swarm optimization and genetic algorithms for optimal control of non-linear fractional-order chaotic system of cancer cells. Math. Comput. Simul. 2023, 206, 538–560. [Google Scholar] [CrossRef]
  19. Li, C.; Li, H. Robust control for a class of chaotic and hyperchaotic systems via linear state feedback. Phys. Scr. 2012, 85, 25007. [Google Scholar] [CrossRef]
  20. Zhou, H.L.; Song, E.B. 3-periodic point determination for quadratic polynomial mapping. J. Sichuan Univ. Nat. Sci. Ed. 2009, 46, 561–564. [Google Scholar]
  21. Andrecut, M.; Ali, M.K. Robust chaos in smooth unimodal maps. Phys. Rev. E 2001, 64, 025203. [Google Scholar] [CrossRef]
Figure 1. Secondary chaos mapping plot: (a) Scatter plot of condition (i) at x 1 = 1.2 , v = 5.2 ; (b) Scatter plot of condition (ii) at x 1 = 0.5 , v = 5.2 ; (c) Scatter plot of condition (i) at x 1 = 1.2 , v = 5.2 ; (d) Scatter plot of condition (ii) at x 1 = 0.5 , v = 5.2 .
Figure 1. Secondary chaos mapping plot: (a) Scatter plot of condition (i) at x 1 = 1.2 , v = 5.2 ; (b) Scatter plot of condition (ii) at x 1 = 0.5 , v = 5.2 ; (c) Scatter plot of condition (i) at x 1 = 1.2 , v = 5.2 ; (d) Scatter plot of condition (ii) at x 1 = 0.5 , v = 5.2 .
Mathematics 13 02409 g001
Figure 2. The bifurcation diagrams and Lyapunov exponent spectra of Condition (i). (a). a 4.5 , 1.5 . (b). v 10 , 10 . (c). x 1 0.55 , 1.87 .
Figure 2. The bifurcation diagrams and Lyapunov exponent spectra of Condition (i). (a). a 4.5 , 1.5 . (b). v 10 , 10 . (c). x 1 0.55 , 1.87 .
Mathematics 13 02409 g002
Figure 3. The bifurcation diagrams and Lyapunov exponent spectra of Condition (ii). (a). a 4.5 , 1.5 . (b). v 10 , 10 . (c). x 1 1.54 , 0.21 .
Figure 3. The bifurcation diagrams and Lyapunov exponent spectra of Condition (ii). (a). a 4.5 , 1.5 . (b). v 10 , 10 . (c). x 1 1.54 , 0.21 .
Mathematics 13 02409 g003
Figure 4. The p , s phase diagrams. (a). Condition (i). (b). Condition (ii). (c). Logistic map.
Figure 4. The p , s phase diagrams. (a). Condition (i). (b). Condition (ii). (c). Logistic map.
Mathematics 13 02409 g004
Table 1. Calculation results of secondary mapping parameters (approximation).
Table 1. Calculation results of secondary mapping parameters (approximation).
Parameters and Function EquationsCondition (i)Condition (ii)
ν = 5.2ν = −5.2ν = 5.2ν = −5.2
b 7.24503.2554−5.2450−1.2554
c −2.50000.3261−2.50000.3261
p 0.5408−0.1241−1.5408−0.8759
q 1.87421.2092−0.20750.4574
Lyapunov exponent values0.71820.69300.69620.6932
Table 2. The SE and 0–1 test results for both quadratic chaotic maps and the logistic map.
Table 2. The SE and 0–1 test results for both quadratic chaotic maps and the logistic map.
IndexesCondition (i)Condition (ii)Logistic Map
SE0.94900.95010.9258
Kc0.75680.76260.7131
Kcreg0.75570.76220.7131
KcCorr0.99950.99730.9991
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Xu, W.; Chen, X.; Zhou, Z.; Li, G.; Song, X. General Construction Method and Proof for a Class of Quadratic Chaotic Mappings. Mathematics 2025, 13, 2409. https://doi.org/10.3390/math13152409

AMA Style

Xu W, Chen X, Zhou Z, Li G, Song X. General Construction Method and Proof for a Class of Quadratic Chaotic Mappings. Mathematics. 2025; 13(15):2409. https://doi.org/10.3390/math13152409

Chicago/Turabian Style

Xu, Wenxia, Xiangkun Chen, Ziwei Zhou, Guodong Li, and Xiaoming Song. 2025. "General Construction Method and Proof for a Class of Quadratic Chaotic Mappings" Mathematics 13, no. 15: 2409. https://doi.org/10.3390/math13152409

APA Style

Xu, W., Chen, X., Zhou, Z., Li, G., & Song, X. (2025). General Construction Method and Proof for a Class of Quadratic Chaotic Mappings. Mathematics, 13(15), 2409. https://doi.org/10.3390/math13152409

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop