English

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

Combinatorics 2020-11-30 v2

Abstract

A structure S\cal S is quasi-projective if for every structure T\cal T, for every homomorphism f:STf : {\cal S} \rightarrow {\cal T} and every epimorphism j:STj: {\cal S}\rightarrow {\cal T} there is an endomorphism ϕ\phi of S\cal S such that ϕj=f\phi\circ 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.

Keywords

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}
}
R2 v1 2026-06-23T20:27:46.136Z