Some Relational Structures with Polynomial Growth and their Associated Algebras I: Quasi-Polynomiality of the Profile
Maurice Pouzet, Nicolas Marc Thiéry
Source abstract
The profile of a relational structure is the function which counts for every integer the number , possibly infinite, of substructures of induced on the -element subsets, isomorphic substructures being identified. If takes only finite values, this is the Hilbert function of a graded algebra associated with , the age algebra , introduced by P. J. Cameron. In this paper we give a closer look at this association, particularly when the relational structure admits a finite monomorphic decomposition. This setting still encompass well-studied graded commutative algebras like invariant rings of finite permutation groups, or the rings of quasi-symmetric polynomials. We prove that is eventually a quasi-polynomial, this supporting the conjecture that, under mild assumptions on , is eventually a quasi-polynomial when it is bounded by some polynomial.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.