Profile and hereditary classes of ordered relational structures
Combinatorics
2014-09-04 v1
Abstract
Let be a class of finite combinatorial structures. The \textit{profile} of is the function which counts, for every integer , the number of members of defined on elements, isomorphic structures been identified. The \textit{generating function of} is . Many results about the behavior of the function 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