Abstract
The relationship between the fixed point property and forbidden retracts associated with a forgetful functor is formulated. Finite ordered sets of width at most four with fixed point free automorphisms are described. Linear time algorithms for deciding whether a finite ordered set of width two has the fixed point property and whether a finite ordered set of width at most three has a fixed point free automorphism are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
