Some theorems on polynomials
β Scribed by L. Carlitz
- Book ID
- 112788642
- Publisher
- Springer Netherlands
- Year
- 1957
- Tongue
- English
- Weight
- 128 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0004-2080
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Real polynomials have very often very few real roots, and when algorithms depend on the number of real roots of polynomials rather than on their degrees, this fact has consequences on average complexity of algorithms. In this paper we recall some classical results on the average number of real root
Lazebnik, F., Some corollaries of a theorem of Whitney on the chromatic polynomial, Discrete Mathematics 87 (1991) 53-64. Let 9 denote the family of simple undirected graphs on u vertices having e edges, P(G; A) be the chromatic polynomial of a graph G. For the given integers v, e, A, let f(v, e, A