The triangular maps with closed sets of periodic points (Q2488811): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jmaa.2005.06.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023954395 / rank
 
Normal rank

Revision as of 18:49, 19 March 2024

scientific article
Language Label Description Also known as
English
The triangular maps with closed sets of periodic points
scientific article

    Statements

    The triangular maps with closed sets of periodic points (English)
    0 references
    0 references
    16 May 2006
    0 references
    A continuous selfmap of the square is called triangular if it is of the form \(F(x,y)=(f(x), g_x(y))\). A list of 19 conditions is considered, one of them being that the set of periodic points is closed. These conditions are known to be equivalent for continuous maps of the interval. In the paper under review, they are studied in the class of triangular maps. With a few exceptions, all possible implications among them are proved or disproved (using also results previously known about this problem). In the class of triangular maps with nondecreasing fibre maps \(g_x(y)\), a complete classification is given. Further, regularly recurrent points in minimal sets of triangular maps are studied (a point is regularly recurrent if the set of return times of this point to any neighbourhood of it contains the set \(\{m_i; \;i=0,1,\dots \}\) for some \(m\)). One of the results shows that a minimal set of a triangular map \(F\) may contain no regularly recurrent point though its first projection is contained in the set of regularly recurrent points of \(f\).
    0 references
    triangular (skew-product) maps
    0 references
    minimal sets
    0 references
    regularly recurrent points
    0 references
    ergodic measures
    0 references

    Identifiers

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