Coincidence theorems on \(\omega\)-connected spaces (Q2495236): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.11650/twjm/1500403838 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2738289705 / rank
 
Normal rank

Latest revision as of 14:30, 19 March 2024

scientific article
Language Label Description Also known as
English
Coincidence theorems on \(\omega\)-connected spaces
scientific article

    Statements

    Coincidence theorems on \(\omega\)-connected spaces (English)
    0 references
    5 July 2006
    0 references
    The paper provides a discussion and proofs of several results concerning the existence of fixed-points for compositions of set-valued maps and their coincidences. The maps act in so-called \(\omega\)-connected spaces (equivalently, infinitely connected, or \(C^\infty\)-spaces if we use the terminology of Borsuk) and satisfy regularity assumptions similar to those from the celebrated Browder-Fan theorem. A typical result reads as follows: given a compact \(\omega\)-connected space \(X\), a set-valued map \(F:X\multimap X\), having nonempty values and such that, for every open \(U\subset X\), the set \(\cup_{x\in U}F(x)\) is \(\omega\)-connected if nonempty, has a fixed point provided the fibres of \(F\) are open (i.e., for each \(y\in X\), \(F^{-1}(y)=\{x\in X\mid y\in F(x)\}\) is open). The regularity assumptions of the paper are rather restrictive and difficult to check in concrete situations, but the conclusions are interesting since the class of \(\omega\)-connected spaces seems to be very large.
    0 references
    infinitely connected space
    0 references
    fixed-points
    0 references
    set-valued maps
    0 references
    0 references

    Identifiers