On Tabor's problem concerning a certain quasi-ordering of iterative roots of functions (Q914868): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q176880
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Witold Jarczyk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3901916 / rank
 
Normal rank

Latest revision as of 16:51, 20 June 2024

scientific article
Language Label Description Also known as
English
On Tabor's problem concerning a certain quasi-ordering of iterative roots of functions
scientific article

    Statements

    On Tabor's problem concerning a certain quasi-ordering of iterative roots of functions (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    Given a selfmapping f of a set E denote by F(f) the set of all iterative roots of f and endow it with the following quasi-ordering: \(\phi\leq \psi\) iff \(\phi\) is an iterative root of \(\psi\). J. Tabor asked when this relation is antisymmetric, i.e. when it is an ordering. Answering this question the authors proved what follows. If the set E is infinite then the set of all selfmappings of E can be decomposed into three parts \(\Phi_ 1\), \(\Phi_ 2\), \(\Phi_ 3\) which have the same cardinality and satisfy the following conditions: 1) Any \(f\in \Phi_ 1\) has no proper iterative root. 2) Every \(f\in \Phi_ 2\cup \Phi_ 3\) has a proper iterative root and \(f\in \Phi_ 2\) implies that \(\leq\) is not antisymmetric on F(f), while \(\leq\) is antisymmetric on F(f) for every \(f\in \Phi_ 3\).
    0 references
    0 references
    0 references
    0 references
    0 references
    iterate
    0 references
    quasi-ordering
    0 references
    selfmapping
    0 references
    iterative roots
    0 references
    0 references
    0 references
    0 references