Inequalities for Charlier polynomials with application to teletraffic theory
โ Scribed by Madan Lal Mehta; Erik A van Doorn
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 485 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We present a method for factoring polynomials of the shape f X y f Y , where f is a univariate polynomial over a field k. We then apply this method in the case when f is a member of the infinite family of exceptional polynomials we ลฝ . ลฝ . discovered jointly with H. Lenstra in 1995; factoring f X y
The best known upper bound on the permanent of a O-l matrix relies on the knowledge of the number of nonzero entries per row. In certain applications only the total number of nonzero entries is known. In order to derive bounds in this situation we prove that the function f:( -1, co) + l%, defined by
We give a lower bound for solutions of linear recurrence relations of the form \(z a_{n}=\sum_{k=n-N}^{n+N} \alpha_{k, n} a_{k}\), whenever \(z\) is not in the \(P^{P}\)-spectrum of the corresponding banded operator. In particular if \(P_{n}\) are polynomials orthonormal with respect to a measure \(