Iterative roots of clenched single-plateau functions

DOI10.1007/S00025-016-0625-9MaRDI QIDQ511800zbMATH OpenOpenAlexFDO

Authors Yinhe Lin, Yingying Zeng, Weinian Zhang

Publication date 22 February 2017

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00025-016-0625-9

clenched class of functions fort iteration iterative root plateau

Iteration of real functions in one variable (26A18) Dynamical systems involving maps of the interval (37E05) Iteration theory, iterative and composite equations (39B12)

Review text

Let \(f\) be a mapping of \(I := [0,1]\) into itself. Then the iterates of \(f\) is defined as \(f^0(x) = x\) and \(f^n(x) = f(f^{n-1}(x))\) for \(n = 1, 2, \ldots\). A solution of the functional equation \(f^n(x) = F(x)\), \(x\in I\), is called an \(n\)th order iterative root of the mapping \(F:\, I\to I\). In the paper, the problem of iterative roots is studied for a special class of continuous functions \(F\). Each function \(F\) of the class has a non-degenerate interval \(J\subset I\) on which \(F\) is constant and is strictly monotone on other sub-intervals of \(I\). Moreover, for every positive integer \(n\) the iterate \(F^n\) is constant on \(J\). The class of functions is called clenched class with single plateau. The authors distinguish six cases, depending on the location of the interval \(J\) and the nature of the behavior of the function at additional intervals. For each case, conditions are obtained under which a function \(F\) has iterative roots or not. The obtained results are illustrated by some examples.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Iterative roots of clenched single-plateau functions

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