Sufficient Conditions for Labelled 0-1 Laws

Details Sufficient Conditions for Labelled 0-1 Laws Sufficient Conditions for Labelled 0-1 Laws

2006-08-29

arxiv.org/abs/math/0608735v1

Mathematics

Combinatorics

8 pages, 1 figure

Scientific paper

If F(x) = e^G(x), where F(x) = \sum f(n)x^n and $G(x) = \sum g(n)x^n, with 0 \le g(n) = O(n^{theta n}/n!),theta in (0,1), and gcd(n : g(n) > 0)=1, then f(n) = o(f(n-1)). This gives an answer to Compton's request in Question 8.3 for an ``easily verifiable sufficient condition'' to show that an adequate class of structures has a labelled first-order 0-1 law, namely it suffices to show that the labelled component count function is O(n^{theta n}) for some theta in (0,1). It also provides the means to recursively construct an adequate class of structures with a labelled 0-1 law but not an unlabelled 0-1 law, answering Compton's Question 8.4.

Affiliated with

Also associated with

No associations

Rating

Sufficient Conditions for Labelled 0-1 Laws 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 Sufficient Conditions for Labelled 0-1 Laws, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sufficient Conditions for Labelled 0-1 Laws will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-74460