No label defined (Q3825792)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4100228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4100228 |
Statements
1988
0 references
entropy
0 references
k-entropy
0 references
topological entropy
0 references
0.7884684205055237
0 references
0.7606219053268433
0 references
0.7542119026184082
0 references
[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.
0 references