Abstract
An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let denote the number of (2+2)-free posets of size . In a recent paper, Bousquet-Mélou et al.\cite{BCDK} found, using so called ascent sequences, the generating function for the number of (2+2)-free posets of size : . We extend this result in two ways. First, we find the generating function for (2+2)-free posets when four statistics are taken into account, one of which is the number of minimal elements in a poset. Second, we show that if equals the number of (2+2)-free posets of size with minimal elements, then . The second result cannot be derived from the first one by a substitution. On the other hand, can easily be obtained from thus providing an alternative proof for the enumeration result in \cite{BCDK}. Moreover, we conjecture a simpler form of writing . Our enumeration results are extended to certain restricted permutations and to regular linearized chord diagrams through bijections in \cite{BCDK,cdk}. Finally, we define a subset of ascent sequences counted by the Catalan numbers and we discuss its relations with (2+2)- and (3+1)-free posets.
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.