๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Asymptotic Formula for Binomial Sums

โœ Scribed by Richard J. McIntosh

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
460 KB
Volume
58
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We obtain complete asymptotic expansions for certain binomial sums, including the Ape ry numbers. In general, binomial sums cannot be expressed by closed formulae, but they do satisfy polynomial recurrence relations. We use the asymptotic expansion of a binomial sum to calculate a lower bound for the number of terms in its recurrence relation.

๐Ÿ“œ SIMILAR VOLUMES

An Asymptotic Formula for a Trigonometri
An Asymptotic Formula for a Trigonometric Sum of Vinogradov
โœ Todd Cochrane; J.C Peral ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 189 KB

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

An Asymptotic Formula for the Commutator
An Asymptotic Formula for the Commutators
โœ Daniel Beltita; Mihai Sabac ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

In what follows we shall describe some asymptotic formulas for the commutators defined by the values of the analytic functional calculus of some commuting n-tuple of bounded operators in a complex Banach space. 1998 Academic Press Let B(X) be the algebra of all bounded linear operators on a complex

An Algorithm for Finding Recurrence Rela
An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity
โœ Nobuki Takayama ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.

An Asymptotic Formula for the Number of
An Asymptotic Formula for the Number of Complete Propositional Connectives
โœ Roger F. Wheeler ๐Ÿ“‚ Article ๐Ÿ“… 1962 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 205 KB

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