2007
DOI: 10.4171/em/57
|View full text |Cite
|
Sign up to set email alerts
|

Also set-valued functions do not like iterative roots

Abstract: Witold Jarczyk obtained his PhD and habilitation from the Silesian University in 1983 and 1993, respectively. Presently, he is professor of mathematics at the University of Zielona Góra in Poland. His interests lie in functional equations and inequalities, iteration theory and discrete dynamical systems. Weinian Zhang received his PhD from the Peking University in 1990. Presently, he is professor of mathematics at the Sichuan University in China. His interests lie in bifurcation theory of differential equation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
24
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(24 citation statements)
references
References 14 publications
0
24
0
Order By: Relevance
“…Let F c (X) stands for the set of all setvalued functions f : X → 2 X such that card f (c) > 1 and f (x) is a singleton whenever x ∈ X\{c}. Many other theorems on this topic were proved by Powierża, Jarczyk, Jarczyk, Li and Zhang (see [50,51,[110][111][112][113]). They considered mainly the case where the values of G consist of one or two elements.…”
Section: Set-valued Iterative Roots Of Bijectionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Let F c (X) stands for the set of all setvalued functions f : X → 2 X such that card f (c) > 1 and f (x) is a singleton whenever x ∈ X\{c}. Many other theorems on this topic were proved by Powierża, Jarczyk, Jarczyk, Li and Zhang (see [50,51,[110][111][112][113]). They considered mainly the case where the values of G consist of one or two elements.…”
Section: Set-valued Iterative Roots Of Bijectionsmentioning
confidence: 99%
“…Moreover, they obtained several results indicating that the smallest set-valued iterative root of a given order does not exist. In papers [51,82] it is shown that the phenomenon of the lack of iterative roots appears also for some set-valued functions with exactly one value not being a singleton. Even assumptions such as continuity or strict monotonicity on the single-valued parts of such a set-valued function does not guarantee the existence of its square roots.…”
Section: Set-valued Iterative Roots Of Bijectionsmentioning
confidence: 99%
“…Encountering difficulties in finding iterative roots, ones also made efforts (see e.g. [6,7,15,19]) to find multivalued iterative roots, which have at least one set-valued point (or called jump simply). In general, the composition G • F of multifunctions F : X → 2 Y and G : Y → 2 Z is defined by (G • F )(x) = G(F (x)), where the image F (A) of a set A ⊂ X is defined by F (A) := ∪ x∈A F (x).…”
Section: Introductionmentioning
confidence: 99%
“…Many advances have been made to iterative roots for various kinds of maps, e.g., continuous strictly monotone self-maps of intervals [3,6], homeomorphisms of the circle [28,29,34], series and transseries [4], set-valued functions [9,18,24,25], high dimensional mappings [15][16][17]23]. Many researchers are also devoted to some properties of iterative roots, for instance, differentiability [11,13,33,38], approximation [39], stability [40,41], category and measure [2,27].…”
Section: Introductionmentioning
confidence: 99%