Article contents
Chaos and topological entropy in dimension n>1
Published online by Cambridge University Press: 19 September 2008
Abstract
In this paper we present a generalization to higher dimensions of the techniques for computation of the entropy of graphs in dimension one. Following these methods, we obtain a lower bound for the topological entropy of a differentiable map F:ℝn→ℝn possessing a snap-back repeller.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1986
References
REFERENCES
- 6
- Cited by