On functions with weak iterative roots (Q1349028): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00010-002-8009-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985878865 / rank
 
Normal rank

Revision as of 02:43, 20 March 2024

scientific article
Language Label Description Also known as
English
On functions with weak iterative roots
scientific article

    Statements

    On functions with weak iterative roots (English)
    0 references
    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

    Identifiers