AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P be a finite partially ordered set with a cut-set X. If every subset of X has either a meet or a join, then P has the fixed point property. This theorem is strengthened to include a certain class of infinite partially ordered sets, as well
This book provides a primary resource in basic fixed-point theorems due to Banach, Brouwer, Schauder...
We provide a polynomial time algorithm that identifies if a given finite ordered set is in the class...
AbstractThis survey exhibits various algorithms to decide the question if a given ordered set P has ...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
AbstractWe prove that if L is a semimodular lattice of finite length (with least element 0 and great...
We prove that, for a finite ordered set P that contains no crowns with 6 or more elements, it can be...
The purpose of this paper is to prove some new fixed point theorem and common fixed point theorems o...
An analogue of Banach's fixed point theorem in partially ordered sets is proved in this paper, and s...
Let (X,) be a partially ordered set and d be a metric on X such that (X, d) is a complete metric spa...
The purpose of this paper is to present a fixed point theorem using a contractive condition of ratio...
This chapter gives an overview how retractions are used to prove fixed point results in ordered sets...
Let X be a partially ordered set with partial ordering “≤”and d a metric on X such that (X,d) is a (...
In this Thesis, we discussing about existence and uniqueness of a fixed point in ordered metric spac...
This book provides a primary resource in basic fixed-point theorems due to Banach, Brouwer, Schauder...
We provide a polynomial time algorithm that identifies if a given finite ordered set is in the class...
AbstractThis survey exhibits various algorithms to decide the question if a given ordered set P has ...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
AbstractWe prove that if L is a semimodular lattice of finite length (with least element 0 and great...
We prove that, for a finite ordered set P that contains no crowns with 6 or more elements, it can be...
The purpose of this paper is to prove some new fixed point theorem and common fixed point theorems o...
An analogue of Banach's fixed point theorem in partially ordered sets is proved in this paper, and s...
Let (X,) be a partially ordered set and d be a metric on X such that (X, d) is a complete metric spa...
The purpose of this paper is to present a fixed point theorem using a contractive condition of ratio...
This chapter gives an overview how retractions are used to prove fixed point results in ordered sets...
Let X be a partially ordered set with partial ordering “≤”and d a metric on X such that (X,d) is a (...
In this Thesis, we discussing about existence and uniqueness of a fixed point in ordered metric spac...
This book provides a primary resource in basic fixed-point theorems due to Banach, Brouwer, Schauder...
We provide a polynomial time algorithm that identifies if a given finite ordered set is in the class...
AbstractThis survey exhibits various algorithms to decide the question if a given ordered set P has ...
DOI
Add to ORKG