A new class of two-dimensional rational maps with self-excited and hidden attractors

This paper studies a new class of two-dimensional rational maps exhibiting self-excited and hidden attractors. The mathematical model of these maps is firstly formulated by introducing a rational term. The analysis of existence and stabilities of the fixed points in these maps suggests that there are four types of fixed points, i.e., no fixed point, one single fixed point, two fixed points and a line of fixed points. To investigate the complex dynamics of these rational maps with different types of fixed points, numerical analysis tools, such as time histories, phase portraits, basins of attraction, Lyapunov exponent spectrum, Lyapunov (Kaplan-Yorke) dimension and bifurcation diagrams, are employed. Our extensive numerical simulations identify both self-excited and hidden attractors, which were rarely reported in the literature. Therefore, the multi-stability of these maps, especially the hidden one, is further explored in the present work.

THE AFFINE RATIONAL POTENTIAL MODEL

We develop a class of rational term structure models in the framework of the potential approach based upon a family of positive supermartingales that are driven by an affine Markov process. These models generally feature nonnegative interest rates and analytic pricing formulae for zero bonds, caps, swaptions, and European currency options, even in the presence of multiple factors. Moreover, in a model specification, the short rate stays near the zero lower bound for an extended period.

Tabling, Rational Terms, and Coinduction Finally Together!

Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more infinite sub-terms but with a finite representation. Rational terms can be generated in Prolog by omitting the occurs check when unifying two terms. Applications of rational terms include definite clause grammars, constraint handling systems, and coinduction. In this paper, we report our extension of YAP's Prolog tabling mechanism to support rational terms. We describe the internal representation of rational terms within the table space and prove its correctness. We then use this extension to implement a tabling based approach to coinduction. We compare our approach with current coinductive transformations and describe the implementation. In addition, we present an algorithm that ensures a canonical representation for rational terms.