About posets of height one as retracts

Abstract

We investigate connected posets C of height one as retracts of finite posets P. We define two multigraphs: a multigraph F(P) reflecting the network of so-called improper 4-crown bundles contained in the extremal points of P, and a multigraph C(C) depending on C but not on P. There exists a close interdependence between C being a retract of P and the existence of a graph homomorphism of a certain type from F(P) to C(C). In particular, if C is an ordinal sum of two antichains, then C is a retract of P iff such a graph homomorphism exists. Returning to general connected posets C of height one, we show that the image of such a graph homomorphism can be a clique in C(C) iff the improper 4-crowns in P contain only a sparse subset of the edges of C.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…