Endo- and polymorphisms of finite strict orders
by
Rainer Lenz
University of Kaiserslautern

In recent years a considerable attention was paid to an investigation of finite orders relative to different properties of their endo- and polymorphisms (see [1], [2] and [3]).
Some algebraic properties of strict orders - known as irreflexive, asymmetric and transitive binary relations - were already studied in [4].
In our talk we shall concern some recent results on determining a finite strict order by its endo- and polymorphisms.

References

[1]        B.Larose, L.Zadori, ``Algebraic properties and dismantlability of finite posets'', Discrete Math. 163, No.1-3, 89-99
    (1997).

[2]        Z.Fueredi, I.G.Rosenberg, ``Orders admitting an isotone majority operation'', Mult.-Valued Log. 3, No.1, 39-53 (1998).

[3]        P.Gibson, I.Zaguia, ``Endomorphism classes of ordered sets, graphs and lattices'', Order 15, 21-34 (1998).

[4]        O.Lueders, D.Schweigert, ``Strictly order primal algebras'', Acta Math. Univ. Comen., New Ser. 63, No.2, 275-284
    (1994).

Date received: May 24, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caee-74.