Abstract
In this paper we consider the class of interval orders, recently considered by several authors from both an algebraic and an enumerative point of view. According to Fishburn’s Theorem (Fishburn J Math Psychol 7:144–149, 1970), these objects can be characterized as posets avoiding the poset 2 + 2. We provide a recursive method for the unique generation of interval orders of size n + 1 from those of size n, extending the technique presented by El-Zahar (1989) and then re-obtain the enumeration of this class, as done in Bousquet-Melou et al. (2010). As a consequence we provide a method for the enumeration of several subclasses of interval orders, namely AV(2 + 2, N), AV(2 + 2, 3 + 1), AV(2 + 2, N, 3 + 1). In particular, we prove that the first two classes are enumerated by the sequence of Catalan numbers, and we establish a bijection between the two classes, based on the cardinalities of the principal ideals of the posets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baldy, P., Morvan, M.: A linear time and space algorithm to recognize interval orders. Discrete Appl. Math. 46, 173–178 (1993)
Banderier, C., Bousquet-Melou, M., Denise, A., Flajolet, P., Gardy, D., Gouyou-Beauchamps, D., Generating functions for generating trees. Discrete Math. 246, 29–55 (2002)
Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: ECO: a methodology for the enumeration of combinatorial objects. J. Diff. Equ. Appl. 5, 435–490 (1999)
Bogart, K.P.: An obvious proof of Fishburn’s interval order theorem. Discrete Math. 118, 233–237 (1993)
K.P. Bogart, Bonin, J., Mitas, J.: Interval orders based on weak orders. Discrete Appl. Math. 60, 93–98 (1995)
Bona, M.: Combinatorics of Permutations. CRC Press Inc (2004)
Bousquet-Melou, M., Claesson, A., Dukes, M., Kitaev, S.: Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory Ser A 117, 884–909 (2010)
Disanto, F., Ferrari, L., Pinzani, R., Rinaldi, S.: Catalan pairs: a relational-theoretic approach to Catalan numbers. Adv. Appl. Math. 45, 505–517 (2010)
El-Zahar, M.H.: Enumeration of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 327–352. Kluwer Acad. Publ., Dordrecht (1989)
Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144–149 (1970)
Fishburn, P.C.: Interval Graphs and Interval Orders. Wiley (1985)
Fishburn, P.C.: Intransitive indifference in preference theory: a survey. Oper. Res. 18, 207–208 (1970)
Haxell, P.E., McDonald, J.J., Thomasson, S.K.: Counting interval orders. Order 17, 269–272 (1987)
Khamis, S.M. (2004) Height counting of unlabeled interval and N-free posets. Discrete Math. 275, 165–175 (2004)
Skandera, M.: A characterization of (3+1)-free posets. J. Comb. Theory Ser A 93, 231–241 (2001)
Sloane, N.J.A.: The on-line encyclopedia of integer sequences. Available on line at http://www.research.att.com/~njas/sequences/
Stanley, R.P.: Enumerative Combinatorics, vol. 1. Cambridge University Press (1997)
Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press (1999)
Stoimenow, A.: Enumeration of chord diagrams and an upper bound for Vassiliev invariants. J. Knot Theory Ramif. 7, 93–114 (1998)
Zagier, D.: Vassiliev invariants and a strange identity related to the Dedeking eta-function. Topology 40, 945–960 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Disanto, F., Pergola, E., Pinzani, R. et al. Generation and Enumeration of Some Classes of Interval Orders. Order 30, 663–676 (2013). https://doi.org/10.1007/s11083-012-9269-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-012-9269-x