✦ LIBER ✦

General theorem for the existence of iterative roots of homeomorphisms with periodic points

✍ Scribed by Paweł Solarz

Book ID: 113722000
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 233 KB
Volume: 394
Category: Article
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2012.03.048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existence of quasi-periodic orbits for t

Existence of quasi-periodic orbits for twist homeomorphisms of the annulus

✍ John N. Mather 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Schauder fixed point theorem based exist

Schauder fixed point theorem based existence of periodic solution for the response of Duffing’s oscillator

✍ Ahmad Feyz Dizaji; Hossein Ali Sepiani; Farzad Ebrahimi; Akbar Allahverdizadeh; 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 527 KB

Existence of solutions for periodic elli

Existence of solutions for periodic elliptic system with general superlinear nonlinearity

✍ Liao, Fangfang; Tang, X. H.; Zhang, Jian 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 282 KB

A Decomposition Theorem for Bounded Solu

A Decomposition Theorem for Bounded Solutions and the Existence of Periodic Solutions of Periodic Differential Equations

✍ Toshiki Naito; Nguyen Van Minh; Rinko Miyazaki; Jong Son Shin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 199 KB

A sequential implicit function theorem f

A sequential implicit function theorem for iterative solution of generalized equation involving point-based approximation

✍ Diana Kirilova Nedelcheva 📂 Article 📅 2011 🏛 Springer Milan 🌐 Italian ⚖ 471 KB

Combinatorial Proofs of the Conley-Zehnd

Combinatorial Proofs of the Conley-Zehnder-Franks Theorem on a Fixed Point for Torus Homeomorphisms

✍ S. Alpern; V.S. Prasad 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

We give two combinatorial proofs of Franks' Theorem, that an area preserving torus homeomorphism with mean rotation zero has a fixed point. The first proof uses Lax's version of the Marriage Theorem. The second proof uses Euler's Theorem on circuits in graphs and an explicit method of Alpern for dec