ON THE NUMBER OF TWO-POINT ANTICHAINS IN THE POWERSET OF AN n-ELEMENT SET ORDERED BY INCLUSION
Tiled orders are used to establish properties of the sequence whose elements count the number of two-point antichains in the powerset of an n-element set ordered by inclusion. In particular, we find a partition formula for numbers in this sequence.
antichain, Auslander-Reiten quiver, categorification of an integer sequence, indecomposable module, integer partition, poset representation, tiled order, order.
