Minimal combinatorial models for maps of an interval with a given set of periods (Q4467696)

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 2072464
Language Label Description Also known as
default for all languages
No label defined
    English
    Minimal combinatorial models for maps of an interval with a given set of periods
    scientific article; zbMATH DE number 2072464

      Statements

      Minimal combinatorial models for maps of an interval with a given set of periods (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      10 June 2004
      0 references
      combinatorial model
      0 references
      horseshoe
      0 references
      periodic point
      0 references
      permutation model
      0 references
      Sharkovsky's theorem
      0 references
      simple cycle
      0 references
      A combinatorial model for a property \(\mathcal{P}\) of continuous self-maps of a compact interval \([a,b]\) is a self-map \(\pi\) of a finite set \(P=\{a=p_0<p_1<\cdots<p_k=b\}\) such that any continuous self-map \(f\) of \([a,b]\) satisfying \(f(p_k)=\pi(p_k)\) which is (not necessarily strictly) monotone on any of the intervals \([p_k,p_{k+1}]\) has the property \(\mathcal{P}\). Permutation models are defined similarly (now \(\pi\) is required to be a permutation). The well-known Sharkovsky theorem states that the set \(\text{Per}(f)\) of periods of periodic points of a continuous interval map is one of the following: (1) \(\{t:t\leq_S 2^k\}\) for some \(k\geq 0\); (2) \(\{t:\text{}t\) is a power of 2
      0 references

      Identifiers