Index of Volumes 151–160 (1996–1999)
(1999)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “The fundamental theorem of dynamical systems”
Index of Volumes 151–160 (1996–1999)
Index of Volumes 141–150 (1992–1996)
(1996)
Fundamenta Mathematicae
Similarity:
Conspectus materiae tomorum LXXXI–XC (1997–1999)
(1999)
Acta Arithmetica
Similarity:
On backward stability of holomorphic dynamical systems
Genadi. Levin (1998)
Fundamenta Mathematicae
Similarity:
For a polynomial with one critical point (maybe multiple), which does not have attracting or neutral periodic orbits, we prove that the backward dynamics is stable provided the Julia set is locally connected. The latter is proved to be equivalent to the non-existence of a wandering continuum in the Julia set or to the shrinking of Yoccoz puzzle-pieces to points.
List of Paul Erdős's publications in number theory
(1997)
Acta Arithmetica
Similarity:
Switched modified function projective synchronization between two complex nonlinear hyperchaotic systems based on adaptive control and parameter identification
Xiaobing Zhou, Murong Jiang, Yaqun Huang (2014)
Kybernetika
Similarity:
This paper investigates adaptive switched modified function projective synchronization between two complex nonlinear hyperchaotic systems with unknown parameters. Based on adaptive control and parameter identification, corresponding adaptive controllers with appropriate parameter update laws are constructed to achieve switched modified function projective synchronization between two different complex nonlinear hyperchaotic systems and to estimate the unknown system parameters. A numerical...
Each nowhere dense nonvoid closed set in Rn is a σ-limit set
Andrei Sivak (1996)
Fundamenta Mathematicae
Similarity:
We discuss main properties of the dynamics on minimal attraction centers (σ-limit sets) of single trajectories for continuous maps of a compact metric space into itself. We prove that each nowhere dense nonvoid closed set in , n ≥ 1, is a σ-limit set for some continuous map.
Reverse mathematics of some topics from algorithmic graph theory
Peter Clote, Jeffry Hirst (1998)
Fundamenta Mathematicae
Similarity:
This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.