Quasi-projective posets, lattices, permutations, graphs, digraphs, hypergraphs, point-line geometries

Abstract

A structure S is quasi-projective if for every structure T, for every homomorphism f : S → T and every epimorphism j: S→ T there is an endomorphism φ of S such that φ j=f. In this paper, we characterise the quasi-projective posets and lattices of arbitrary cardinalities, finite permutations, graphs and digraphs of arbitrary cardinalities with loops and without loops, finite hypergraphs, and finite point-line geometries.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…