加载中…
Let be a class of finite combinatorial structures. The of is the function which counts, for every integer , the number of members of defined on elements, isomorphic structures been identified. The is $\mathcal {H}{\mathfrak{C}}(x):=\sum{n\geqq 0}\varphi_{\mathfrak{C}}(n)x^{n}$. 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本