Forbidden retracts for finite ordered sets of width at most four

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Science. Official publication website can be found on muni.cz.
Authors

NIEDERLE Josef

Year of publication 2008
Type Article in Periodical
Magazine / Source Discrete Mathematics
MU Faculty or unit

Faculty of Science

Citation
Field General mathematics
Keywords Algorithm; concrete category; fixed point property; forbidden retract; ordered set
Description 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 with 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.