Mathematics – Combinatorics
Scientific paper
2007-03-08
Mathematics
Combinatorics
35 pages, in english, proceedings of the 14th Symposium of 35 pages, en english, Proceedings of The Tunisian Mathematical Soci
Scientific paper
The {\it profile} of a relational structure $R$ is the function $\phi_R$ which counts for every integer $n$ the number of its $n$-element substructures up to an isomorphism. Many counting functions are profiles. Interesting examples come from permutation groups. Some salient facts about the behavior of the profile are presented. Techniques from ordered sets and combinatorics (notably the notion of well-quasi-order, the related notions of ordered algebras, Ramsey theorem) are illustrated. Ongoing resarch suggests to view the profile of a relational structure $R$ as the Hilbert function of some graded algebra associated with $R$. A hint at the solution of a conjecture of P.J.Cameron on the integrity of the ring of the orbit algebra is given. Recent progress made with Y.Boudabbous and N.Thi\'ery on the conjecture that the profile is a quasi-polynomial if its growth is polynomial (and the structure has a finite kernel) are presented.
No associations
LandOfFree
The Profile of relations 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 The Profile of relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Profile of relations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-642752