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

Polynomial relations among the nth roots of one

โœ Scribed by David R. Richman


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
199 KB
Volume
16
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Roots of Chromatic Polynomials
โœ Jason I. Brown ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 158 KB

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

On the roots of cauchy polynomials
โœ K.P. Hadeler; G. Meinardus ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 734 KB