The present article is really a continuation of the author's earlier paper [,l] on this subject. The line of investigation described previously is rounded off by deriving some further numcrical results, which include, in particular, an asymptotic fonnula for the number of complete propositional conn
An Asymptotic Formula for the Number of Smooth Values of a Polynomial
โ Scribed by Greg Martin
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 402 KB
- Volume
- 93
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The zeros of the Meixner polynomial m n (x; ;, c) are real, distinct, and lie in (0, ). Let : n, s denote the s th zero of m n (n:; ;, c), counted from the right; and let :ร n, s denote the sth zero of m n (n:; ;, c), counted from the left. For each fixed s, asymptotic formulas are obtained for both
We obtain a representation formula for the trigonometric sum f (m, n) and deduce from it the upper bound f(m, n) < (4/p 2 ) m log m+ (4/p 2 )(c -log(p/2)+2C G ) m+O(m/`log m), where C G is the supremum of the function G(t) :=; . k=1 log |2 sin pkt|/(4k 2 -1), over the set of irrationals. The coeffi
We give a lower bound for the minimum distance between two zeros of a polynomial system f in terms of the distance of f to a variety of ill-posed problems.