Combinatorial patterns for maps of the interval (Q3983371)

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 26696
Language Label Description Also known as
default for all languages
No label defined
    English
    Combinatorial patterns for maps of the interval
    scientific article; zbMATH DE number 26696

      Statements

      Combinatorial patterns for maps of the interval (English)
      0 references
      0 references
      0 references
      27 June 1992
      0 references
      interval map
      0 references
      combinatorial pattern
      0 references
      Let \(f\) be a continuous map of a closed interval \(I\) to itself. The authors define a combinatorial pattern \(\theta\) of \(f\). They say that a combinatorial pattern \(\theta\) forces another combinatorial pattern \(\eta\) if every continuous map \(f: I\to I\) which exhibits \(\theta\) also exhibits \(\eta\). Some criteria are given for deciding if \(\theta\) forces \(\eta\) in any specific case. Extensions and reductions of patterns are studied. The authors investigate a weakening of the notion of extension, which they call combinatorial shadowing. The relation between entropy estimates arising from different patterns is explored.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references