## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ Β© 1993 John Wiley & Sons, Inc.
Simplified Lower Bounds for Polynomials with Algebraic Coefficients
β Scribed by Walter Baur
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 89 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions.
We give upper and lower bounds for the Kazhdan-Lusztig polynomials of any Coxeter group W . If W is finite we prove that, for any k β₯ 0, the kth coefficient of the Kazhdan-Lusztig polynomial of two elements u, v of W is bounded from above by a polynomial (which depends only on k) in l(v)l(u). In par
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 \(