Some relational structures with polynomial growth and their associated algebras II

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, submitted to ROGICS'08

Scientific paper

The profile of a relational structure R is the function phi which counts for every integer n the number, possibly infinite, phi(n) of substructures of R induced on the n-element subsets, isomorphic substructures being identified. If phi takes only finite values, this is the Hilbert function of a graded algebra associated with R, the age algebra, introduced by P. J. Cameron. In this paper, we give a closer look at this association, particularly when the relational structure R 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 phi is eventually a quasi-polynomial, this supporting the conjecture that, under mild assumptions on R, phi is eventually a quasi-polynomial whenever it is bounded by some polynomial. We also characterize when the age algebra is finitely generated.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Some relational structures with polynomial growth and their associated algebras II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some relational structures with polynomial growth and their associated algebras II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some relational structures with polynomial growth and their associated algebras II will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-185143

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.