Sufficient Conditions for Labelled 0-1 Laws
If F(x) = e G(x), where F(x) = Σf(n)x n and G(x) = Σ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''...
Main Authors: | Stanley Burris, Karen Yeats |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/618 |
Similar Items
-
Sufficient conditions for labelled 0-1 laws
by: Stanley N. Burris, et al.
Published: (2008-01-01) -
Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law
by: Jason P. Bell, et al.
Published: (2012-05-01) -
Migrant workers : adequacy and sufficiency of law
by: Sardar Baig, Farheen Baig
Published: (2013) -
Local symmetry and triangle laws are sufficient for metrisability
by: Roscoe, A, et al.
Published: (1985) -
Sufficient conditions of univalency for complex functions in the class \(C^1\)
by: Petru T. Mocanu
Published: (1981-02-01)