A generalization of G. Faber's theorem on polynomial bases
โ Scribed by Z. A. Chanturiya
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1967
- Tongue
- English
- Weight
- 133 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph K m \* r = K m,. ..,m with equal part size m. We obtained the asymptotics in the case ln r = o(ln m). The proof generalizes the classical result of A.L. Rubin for the case r = 2.
We construct two classes of 3 ร 3 and 4 ร 4 real symmetric matrices, and establish sufficient conditions for the spectrum of a matrix A in each class to be disjoint from its kth order Gershgorin region. This provides a partial answer to a question raised by Newman and Thompson. The problem of provid