Skip to content

Sufficient Conditions for Labelled 0-1 Laws

Stanley Burris, Karen Yeats

math.COarXiv:math/0608735

Abstract

If F(x) = eG(x), where F(x) = Σ f(n)xn and $G(x) = Σ g(n)xn, with 0 g(n) = O(ntheta 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(ntheta 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.

Create a lesson