1997
DOI: 10.4064/ap-65-2-119-128
|View full text |Cite
|
Sign up to set email alerts
|

PM functions, their characteristic intervals and iterative roots

Abstract: Abstract. The concept of characteristic interval for piecewise monotone functions is introduced and used in the study of their iterative roots on a closed interval.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
46
0
2

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 65 publications
(48 citation statements)
references
References 7 publications
0
46
0
2
Order By: Relevance
“…Now we are interested in the more complicated case H(F ) ≥ 2. Then, as Weinian Zhang proved in [72], the function F has no continuous iterative roots of order r greater than #S(F ). So the problem is: Does F ∈ PM(a, b) with H(F ) ≥ 2 have an iterative root of order r for r ≤ #S(F )?…”
Section: In 1944mentioning
confidence: 99%
See 2 more Smart Citations
“…Now we are interested in the more complicated case H(F ) ≥ 2. Then, as Weinian Zhang proved in [72], the function F has no continuous iterative roots of order r greater than #S(F ). So the problem is: Does F ∈ PM(a, b) with H(F ) ≥ 2 have an iterative root of order r for r ≤ #S(F )?…”
Section: In 1944mentioning
confidence: 99%
“…[72] by Weinian Zhang and [25] by Lin Li, Dilian Yang and Weinian Zhang) and can be reduced to the monotonic case in the following way. By Fact 1.3 we know that the function F is not monotonic on the interval [a, b] but it is monotonic on the interval…”
Section: In 1944mentioning
confidence: 99%
See 1 more Smart Citation
“…Their method based on the notion of so called "characteristic interval" was described in the paper mentioned above and then was developed in [85,183].…”
Section: Theorem 24 ([14]) Let F Be a Strict Horseshoe Map Of Type (mentioning
confidence: 99%
“…By PM (I) we denote the set of all continuous piecewise monotonic functions with finitely many forts. If [84,183]). For a given function F ∈ PM(I) we define the nonmonotonicity height H(F ) as the least k ≥ 0 satisfying S(F k ) = S(F k+1 ) if such a k exists and ∞ otherwise.…”
Section: Theorem 24 ([14]) Let F Be a Strict Horseshoe Map Of Type (mentioning
confidence: 99%