scientific article; zbMATH DE number 4100228

From MaRDI portal
Publication:3825792





[For the entire collection see Zbl 0653.00011.] Let f: [0,1]\({}^ n\to [0,1]^ n\) be a \(C^ k\) map. In the present paper the following statement is discussed: The difference between any ``entropy-like invariant of f and the topological entropy h(f) is bounded by the ``complexity of f. The problem of finding a suitable notion for the complexity of f is dealt with in some detail. Then a result as above, proved previously by the author, is stated: The difference between `k-entropy' and topological entropy of f does not exceed \(\frac{n}{k}(\lim_{i\to \infty}\frac{1}{i}\max_{x\in [0,1]^ n}\log \| df^ i(x)\|)\), which may be interpreted as a kind of complexity.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3825792)