Order Preserving Maps of Posets
Zhousheng Mei, Suijie Wang

TL;DR
This paper investigates the structure of order-preserving maps between finite posets, revealing their lattice properties, dualities, and applications to counting maps and characteristic polynomials.
Contribution
It establishes that the hom-poset from a poset to the collection of order ideals forms a distributive lattice and characterizes it via a product of posets, introducing new structural insights.
Findings
Hom(P,J(Q)) is a distributive lattice.
Hom(P,J(Q)) is isomorphic to J(P*×Q).
Calculated the number of order-preserving maps to Boolean algebras.
Abstract
For any two finite posets and , let be the hom-poset consisting of all order preserving maps from to , and the collection of all order ideals of . In this paper, we study some basic properties of the hom-poset and prove that is a distributive lattice and characterized by \[ \Hom\big(P,J(Q)\big)\cong J(P^*\times Q), \] where is the dual of . Consequently, we obtain that and are dual isomorphic, i.e., \[ \Hom\big(P,J(Q)\big)\cong \Hom^{*}\big(Q,J(P)\big). \] As applications, we calculate the number of order preserving maps from any poset to the boolean algebra, and the characteristic polynomial of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Mathematics and Applications · Advanced Algebra and Logic
