We develop a theory of limits of finite posets in close analogy to the recent theory of graph limits. In particular, we study representations of the limits by functions of two variables on a probability space, and connections to exchangeable random infinite posets.

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along both sets of chains, the labels of the chains in the first set remain sorted. We also characterize posets with more restrictive sorting properties.

This paper is devoted to a detailed study of certain remarkable posets which form a natural partition of all abelian ideals of a Borel subalgebra. Our main result is a nice uniform formula for the dimension of maximal ideals in these posets. We also obtain results on ad-nilpotent ideals which complete the analysis started in [CP2], [CP3].

S. Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529–563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a kernel on the unit interval with the standard order, thus answering an open question of Janson. We provide two proofs: real-analytic and combinatorial. The co...

To every labeled poset (P, ω), one can associate a quasisymmetric generating function for its (P, ω)-partitions. We ask: when do two labeled posets have the same generating function? Since the special case corresponding to skew Schur function equality is still open, a complete classification of equality among (P, ω) generating functions is likely too much to expect. Instead, we determine necess...

In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.