Quasi-projective posets, lattices, permutations, graphs, digraphs, hypergraphs, point-line geometries
Combinatorics
2020-11-30 v2
Abstract
A structure is quasi-projective if for every structure , for every homomorphism and every epimorphism there is an endomorphism of such that . 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.
Cite
@article{arxiv.2011.11793,
title = {Quasi-projective posets, lattices, permutations, graphs, digraphs, hypergraphs, point-line geometries},
author = {Éva Jungábel},
journal= {arXiv preprint arXiv:2011.11793},
year = {2020}
}