English

Counting Self-Dual Interval Orders

Combinatorics 2011-11-28 v1

Abstract

In this paper, we present a new method to derive formulas for the generating functions of interval orders, counted with respect to their size, magnitude, and number of minimal and maximal elements. Our method allows us not only to generalize previous results on refined enumeration of general interval orders, but also to enumerate self-dual interval orders with respect to analogous statistics. Using the newly derived generating function formulas, we are able to prove a bijective relationship between self-dual interval orders and upper-triangular matrices with no zero rows. Previously, a similar bijective relationship has been established between general interval orders and upper-triangular matrices with no zero rows and columns.

Keywords

Cite

@article{arxiv.1106.2261,
  title  = {Counting Self-Dual Interval Orders},
  author = {Vít Jelínek},
  journal= {arXiv preprint arXiv:1106.2261},
  year   = {2011}
}

Comments

20 pages

R2 v1 2026-06-21T18:20:59.782Z