Skip to Main content Skip to Navigation
Journal articles

Sufficient conditions for labelled 0-1 laws

Abstract : If F(x) = e^G(x), where F(x) = \Sum f(n)x^n and G(x) = \Sum g(n)x^n, with 0 ≤ g(n) = O(n^θn/n!), θ ∈ (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 [Compton 1987] 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^θn) for some θ ∈ (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.
Document type :
Journal articles
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-00972301
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, April 3, 2014 - 4:07:31 PM
Last modification on : Saturday, November 18, 2017 - 1:06:28 AM
Long-term archiving on: : Thursday, July 3, 2014 - 4:26:42 PM

File

618-3225-2-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00972301, version 1

Collections

Citation

Stanley N. Burris, Karen A. Yeats. Sufficient conditions for labelled 0-1 laws. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (1), pp.147--156. ⟨hal-00972301⟩

Share

Metrics

Record views

169

Files downloads

908