Variational analysis of functions of the roots of polynomials
โ Scribed by James V. Burke; Adrian S. Lewis; Michael L. Overton
- Publisher
- Springer-Verlag
- Year
- 2005
- Tongue
- English
- Weight
- 292 KB
- Volume
- 104
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We give some applications of our recent work [10] about Hall-Littlewood functions at roots of unity. In particular, we prove the two conjectures of N. Sultana [17] on specializations of Green polynomials, and we generalize classical results concerning characters of the symmetric group induced by max
It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)ร(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a