A fixed point theorem for commuting families of relational homomorphisms. Applications to metric spaces, ordered sets and oriented graphs (Q2310779)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A fixed point theorem for commuting families of relational homomorphisms. Applications to metric spaces, ordered sets and oriented graphs
scientific article

    Statements

    A fixed point theorem for commuting families of relational homomorphisms. Applications to metric spaces, ordered sets and oriented graphs (English)
    0 references
    0 references
    0 references
    6 April 2020
    0 references
    In this paper, the authors extend the notion of a compact normal structure to binary relational systems. They prove that for involutive and reflexive binary relational systems, every commuting family of relational homomorphisms has a common fixed point. They also show that a result in the paper extends the well-known Tarski fixed point theorem to graphs which are retracts of reflexive oriented zigzags of bounded length. They illustrate the fact that the study of binary relational systems and of generalized metric spaces are equivalent. This paper with different theoretical results and applications will be very interesting for researchers working in the area of fixed point theory.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Chebyshev center
    0 references
    fences
    0 references
    fixed-point
    0 references
    graphs
    0 references
    hyperconvex spaces
    0 references
    metric spaces
    0 references
    non-expansive mappings
    0 references
    normal structure
    0 references
    order-preserving maps
    0 references
    ordered sets
    0 references
    relational homomorphisms
    0 references
    relational systems
    0 references
    retracts
    0 references
    zigzags
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references