Profile and hereditary classes of ordered relational structures

preprint2014arXivOpen access

Abstract

Let C\mathfrak{C} be a class of finite combinatorial structures. The \textit{profile} of C\mathfrak{C} is the function φCφ_{\mathfrak{C}} which counts, for every integer nn, the number φC(n)φ_{\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):=∑n≧0φC(n)xn\mathcal {H}_{\mathfrak{C}}(x):=\sum_{n\geqq 0}φ_{\mathfrak{C}}(n)x^{n}. Many results about the behavior of the function φCφ_{\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.