English

On naturally labelled posets and permutations avoiding 12-34

Combinatorics 2024-12-20 v2

Abstract

A partial order \prec on [n][n] is naturally labelled (NL) if xyx\prec y implies x<yx<y. We establish a bijection between {3, 2+2}-free NL posets and 12-34-avoiding permutations, determine functional equations satisfied by their generating function, and use series analysis to investigate their asymptotic growth, presenting evidence of stretched exponential behaviour. We also exhibit bijections between 3-free NL posets and various other objects, and determine their generating function. The connection between our results and a hierarchy of combinatorial objects related to interval orders is described.

Keywords

Cite

@article{arxiv.2311.08023,
  title  = {On naturally labelled posets and permutations avoiding 12-34},
  author = {David Bevan and Gi-Sang Cheon and Sergey Kitaev},
  journal= {arXiv preprint arXiv:2311.08023},
  year   = {2024}
}

Comments

22 pages; to appear in the European Journal of Combinatorics

R2 v1 2026-06-28T13:20:32.703Z