AFPP vs FPP (Q1811034)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1925063
Language Label Description Also known as
default for all languages
No label defined
    English
    AFPP vs FPP
    scientific article; zbMATH DE number 1925063

      Statements

      AFPP vs FPP (English)
      0 references
      0 references
      0 references
      9 June 2003
      0 references
      The authors make an interesting investigation of the approximation of continuous structures (topological spaces) by discrete structures (graphs) examining the relation between fixed point properties for the two types of structures. The main theme of the paper is that almost fixed point properties of discrete structures and fixed point properties of topological spaces are interdeductible via a suitable category which contains both graphs and topological spaces as objects. Specific applications developed are: a ``digital convexity'' version of Kakutani's fixed point theorem and fixed point properties of dendrites in terms of those of finite discrete trees.
      0 references
      0 references
      almost fixed point property
      0 references
      dendrites
      0 references
      inverse limits
      0 references
      Kakutani theorem
      0 references
      power structures
      0 references
      topological graphs
      0 references

      Identifiers