✦ LIBER ✦

The business cycle model with a unique stable limit cycle

✍ Scribed by Kazuyuki Sasakura

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 552 KB
Volume: 20
Category: Article
ISSN: 0165-1889
DOI: 10.1016/0165-1889(95)00897-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Differential game model of the dynastic

Differential game model of the dynastic cycle: 3D-canonical system with a stable limit cycle

✍ G. Feichtinger; A. J. Novak 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 714 KB

Abel-like differential equations with a

Abel-like differential equations with a unique limit cycle

✍ M.J. Álvarez; J.L. Bravo; M. Fernández 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 265 KB

For the family of scalar Abel-like equations and k ≥ 1, we characterize the existence of non-trivial limit cycles (periodic solutions that are isolated in the set of periodic solutions different from the trivial x(t) ≡ 0) in terms of n, m, k, i l , j l , i b , j b .

Asymptotically stable limit cycles in a

Asymptotically stable limit cycles in a model of glycolytic oscillations

✍ A.K. Dutt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 278 KB

A perturbation method has been used to prove that in the reversible Selkov model, a model describing glycolytic oscillations, the limit cycles emerging at the Hopf points are stable asymptotically within a range of parameter values.

Analysis of the US business cycle with a

Analysis of the US business cycle with a Vector-Markov-switching model

✍ Zenon G. Kontolemis 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 262 KB 👁 2 views

Uniqueness of limit cycles for a class o

Uniqueness of limit cycles for a class of Lienard systems with applications

✍ B. Coll; A. Gasull; J. Llibre 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 444 KB

The number of tournaments with a unique

The number of tournaments with a unique spanning cycle

✍ J. W. Moon 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB 👁 1 views

## Abstract The number of tournaments __T~n~__ on __n__ nodes with a unique spanning cycle is the (2__n__‐6)th Fibonacci number when __n__ ≥ 4. Another proof of this result is given based on a recursive construction of these tournaments.