4 research outputs found
Counting Proper Mergings of Chains and Antichains
A proper merging of two disjoint quasi-ordered sets and is a
quasi-order on the union of and such that the restriction to and
yields the original quasi-order again and such that no elements of and
are identified. In this article, we consider the cases where and
are chains, where and are antichains, and where is an antichain and
is a chain. We give formulas that determine the number of proper mergings
in all three cases, and introduce two new bijections from proper mergings of
two chains to plane partitions and from proper mergings of an antichain and a
chain to monotone colorings of complete bipartite digraphs. Additionally, we
use these bijections to count the Galois connections between two chains, and
between a chain and a Boolean lattice respectively.Comment: 36 pages, 15 figures, 5 table
Proper Mergings of Stars and Chains are Counted by Sums of Antidiagonals in Certain Convolution Arrays -- The Details
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.Comment: 27 pages, 7 figures, 1 table. Jonathan Farley has solved Problem
4.18; added Section 4.4 to describe his solutio
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum