Fixed point characterization of completeness on lattices for relatively isotone mappings
Jiří Klimeš (1984)
Archivum Mathematicum
Similarity:
Jiří Klimeš (1984)
Archivum Mathematicum
Similarity:
Jiří Klimeš (1985)
Archivum Mathematicum
Similarity:
S. Parameshwara Bhatta (2005)
Czechoslovak Mathematical Journal
Similarity:
In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone map of a weakly chain-complete pseudo-ordered set into itself has a least fixed point.
Vítězslav Novák, Tomáš Novotný (2005)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Continuity of isotone mappings and embeddings of a chain G into another chain are studied. Especially, conditions are found under which the set of points of discontinuity of such a mapping is dense in G.
Klaus Heiner Kamps (1978)
Colloquium Mathematicae
Similarity:
Katsuya Yokoi (2015)
Annales Polonici Mathematici
Similarity:
This paper is concerned with strong chain recurrence introduced by Easton. We investigate the depth of the transfinite sequence of nested, closed invariant sets obtained by iterating the process of taking strong chain recurrent points, which is a related form of the central sequence due to Birkhoff. We also note the existence of a Lyapunov function which is decreasing off the strong chain recurrent set. As an application, we give a necessary and sufficient condition for the coincidence...
Tamura, Takayuki (1975)
Portugaliae mathematica
Similarity:
Bukh, Boris (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: