Profile and hereditary classes of ordered relational structures
Djamila Oudrar, Maurice Pouzet

TL;DR
This paper explores the profile and generating functions of classes of finite ordered relational structures, extending known results from permutation classes and examining hereditary well quasi order properties.
Contribution
It extends results on algebraic generating functions from permutation classes to ordered binary relational structures, focusing on hereditary well quasi orders.
Findings
Generated algebraic series for classes of ordered structures
Connected hereditary well quasi order properties to generating functions
Addressed open questions on hereditary classes
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Coding theory and cryptography
