No CrossRef data available.
Article contents
An Inductive Rearrangement Theorem
Published online by Cambridge University Press: 20 November 2018
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
In [2, Theorem 3.2, p. 429] and [3, Theorem 2.1, p. 155], the author established two induction theorems which gave rise to a series of fundamental results in spectral and rearrangement inequalities. In particular, the classical inequalities of Hardy-Littlewood-Pólya [4, Theorem 108, p. 89] and Pólya [6] were derived and conditions for equalities obtained (see [2, Theorem 3.8, p. 433] and [3, Theorem 2.6, p. 157]). In [5, Theorem 6, p. 651 ; and Theorem 20, p. 569], Fischer and Holbrook also gave alternative conditions for equalities to hold in the aforesaid inequalities. In this paper, we show that the result of Fischer and Holbrook can be proved by induction using an inductive rearrangement theorem which turns out to be a stronger version of the induction theorems given in [2, Theorem 3.2, p. 429] and [3, Theorem 2.1, p. 155].
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1979
References
1.
Chong, K. M., Some extensions of a theorem of Hardy, Littlewood and Pôlya and their applications, Can. J. Math. 26 (1974), 1321–1340.Google Scholar
2.
Chong, K. M., A general induction theorem for rearrangements of n-tuples, J. Math. Anal. Appl. 53 (1976), 426–437.Google Scholar
3.
Chong, K. M., An induction theorem for rearrangements, Can. J. Math. 28 (1976), 154–160.Google Scholar
5.
Fischer, P. and Holbrook, J. A. R., Matrices doubly stochastic by blocks, Can. J. Math.
29 (1977), 559–577.Google Scholar
6.
Pôlya, G., Remark on WeyVs note: Inequalities between the two kinds of eigenvalues of a linear transformation, Proc. Nat. Acad. Sci.. 36 (1950), 49–51.Google Scholar
You have
Access