Iterative roots of piecewise monotonic functions of nonmonotonicity height not less than 2 (Q644200): Difference between revisions

Let \(X\) be a given set, \(F: X\rightarrow X\) be a mapping, and \(n\in\mathbb N\). A function \(f: X\rightarrow X\) is said to be an \textit{iterative root} (of order \(n\)) of \(F\), if \(f^n=F\) holds, where \(f^n\) stands for the \(n\)th iterate of \(f\). The problem of finding iterative roots can be traced back to the investigations of Babbage and has inspired many investigations. A complete description of iterative roots of continuous strictly monotonic self-mappings of a given interval is due to Kuczma. In their paper, the authors study the iterative roots of piecewise monotonic functions of nonmonotonicity height not less than 2. They consider the case when the number of forts (those points that have no neighborhood on which the function is strictly monotonic) is equal to the order of iteration.