English

Profile and hereditary classes of ordered relational structures

Combinatorics 2014-09-04 v1

Abstract

Let C\mathfrak{C} be a class of finite combinatorial structures. The \textit{profile} of C\mathfrak{C} is the function φC\varphi_{\mathfrak{C}} which counts, for every integer nn, the number φC(n)\varphi_{\mathfrak{C}}(n) of members of C\mathfrak{C} defined on nn elements, isomorphic structures been identified. The \textit{generating function of} C\mathfrak{C} is HC(x):=n0φC(n)xn\mathcal {H}_{\mathfrak{C}}(x):=\sum_{n\geqq 0}\varphi_{\mathfrak{C}}(n)x^{n}. Many results about the behavior of the function φC\varphi_{\mathfrak{C}} have been obtained. Albert and Atkinson have shown that the generating series of several classes of permutations are algebraic. In this paper, we show how their results extend to classes of ordered binary relational structures; putting emphasis on the notion of hereditary well quasi order, we discuss some of their questions and answer one.

Cite

@article{arxiv.1409.1108,
  title  = {Profile and hereditary classes of ordered relational structures},
  author = {Djamila Oudrar and Maurice Pouzet},
  journal= {arXiv preprint arXiv:1409.1108},
  year   = {2014}
}

Comments

21 pages, 1 figure

R2 v1 2026-06-22T05:47:38.942Z