Abstract
A proper merging of two disjoint quasi-ordered sets and is a quasi-order on the union of and such that the restriction to or yields the original quasi-order again and such that no elements of and are identified. In this article, we determine the number of proper mergings in the case where is a star (i.e. an antichain with a smallest element adjoined), and is a chain. We show that the lattice of proper mergings of an -antichain and an -chain, previously investigated by the author, is a quotient lattice of the lattice of proper mergings of an -star and an -chain, and we determine the number of proper mergings of an -star and an -chain by counting the number of congruence classes and by determining their cardinalities. Additionally, we compute the number of Galois connections between certain modified Boolean lattices and chains.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.