On functions with weak iterative roots (Q1349028)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On functions with weak iterative roots |
scientific article; zbMATH DE number 1742889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On functions with weak iterative roots |
scientific article; zbMATH DE number 1742889 |
Statements
On functions with weak iterative roots (English)
0 references
21 May 2002
0 references
The author, after giving the notion of weak iterative root introduced by Gy. Targonski, proves the following: Theorem: Let \(X\) be an arbitrary set. If \(f\in X^X\) has a weak iterative root of order \(r\) then it also has an iterative root of the same order. From the proof of the theorem it is seen that every weak iterative root generates a family of iterative roots.
0 references
weak iterative roots
0 references
iterative functional equation
0 references
0 references
0.90961045
0 references
0.8988886
0 references
0.89361465
0 references
0.89235145
0 references
0.8922688
0 references
0.89191926
0 references
0.8914859
0 references
0.88819444
0 references
