Abstract
In this paper, the author gives the exact counting of unlabeled rigid interval posets regarding or disregarding the height by using generating functions. The counting technique follows those introduced in El-Zahar (1989), Hanlon (Trans Amer Math Soc 272:383–426, 1982), Khamis (Discrete Math 275:165–175, 2004). The main advantage of the suggested technique is that a very simple recursive construction of unlabeled rigid interval poset from small ones leads to derive the given generating function for unlabeled rigid interval posets whose coefficients can be easily computed. Moreover, it is proven that the sets of n-element unlabeled rigid interval posets and upper triangular 0–1 matrices with n ones and no zero rows or columns are in one-to-one correspondence. In addition, n-element unlabeled interval posets are counted for n ≥ 1, using the given generating function for rigid ones. Upper and lower bounds for the number of n-element unlabeled rigid interval posets are given. Also, an asymptotic estimate for the required numbers is obtained. Numerical results for unlabeled interval posets coincide with those given in El-Zahar (1989) and Khamis (Discrete Math 275:165–175, 2004). The exact numbers of n-element unlabeled rigid and general interval posets with and without height k are included, for 1 ≤ k ≤ n ≤ 15.
Similar content being viewed by others
References
Bayoumi, B.I., El-Zahar, M.H., Khamis, S.M.: Asymptotic enumeration of N-free partial orders. Order 6, 219–232 (1989)
Bousquet-Melou, M., Claesson, A., Dukes, M., Kitaev, S.: (2+2)-free posets,ascent sequences and pattern avoiding permutation. J. Comb. Theory, Ser A 117(7), 884–909 (2010)
Brinkmann, G., McKay, B.: Posets on up to 16 points. Order 19, 147–179 (2002)
El-Zahar, M.H.: Enumeration of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 327–352. Kluwer, Dordrecht (1989)
Fishburn, P.C.: Intransitive indifference in preference theory. A survey. Oper. Res. 18, 207–228 (1970)
Hanlon, P.: Counting interval graphs. Trans. Amer. Math. Soc. 272, 383–426 (1982)
Haxell, P.E., McDonald, J.J., Thomasson, S.K.: Counting interval orders. Order 4, 269–272 (1987)
Heitzig, J., Reinhold, J.: The number of unlabeled orders on fourteen elements. Order 17, 333–341 (2000)
Khamis, S.M.: Height counting of unlabeled interval and N-free posets. Discrete Math. 275, 165–175 (2004)
Sloane, N.J.A.: The on-line encyclopedia of integer sequences. Published electronically at www.research.att.com/~njas/sequences/ (2007)
Stoimenow, A.: Enumeration of chord diagrams and an upper bound for Vassiliev invariants. J. Knot Theory Ramif. 7(1), 93–114 (1998)
Zagier, D.: Vassiliev invariants, and a strange identity related to the Dedekind eta-function. Topology 40, 945–960 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Khamis, S.M. Exact Counting of Unlabeled Rigid Interval Posets Regarding or Disregarding Height. Order 29, 443–461 (2012). https://doi.org/10.1007/s11083-011-9213-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-011-9213-5