Canadian Journal of Mathematics · 1976 · 21 citations · 0 references
Spectral TheoryOrder TheoryInduction TheoremBijective CombinatoricsTheorem 2Algebraic CombinatoricsDiscrete MathematicsPartially Ordered SetRecursive FunctionCertain Proposition
In this paper, an induction theorem for rearrangements involving w-tuples in Rn is proved, showing that a certain proposition regarding a pair of w-tuples related by the weak spectral order ≪ is true for any integer n ≧ 2 if and only if it is true for n = 2. This theorem contains as particular cases a well-known theorem of Hardy-Littlewood-Pólya [4, Lemma 2, p. 47], a theorem of Pólya [ 8 ], a theorem of Rado [ 9 , pp. 1-2], two theorems of Mirsky [6, Theorem 2, p. 232; 7, Theorem 4, p. 90], a result given in [ 1 , Corollary 2.4, p. 1333] and also [ 2, Proposition 2.1, p. 439].