Abstract
The decreasing rearrangement of a finite sequence a1, a2, … , an of real numbers is a second sequence aπ(1), aπ(2), … , aπ(n), where π(l), π(2), … , π(n) is a permutation of 1, 2, … , n and(1, p. 260). The kth term of the rearranged sequence will be denoted by . Thus the terms of the rearranged sequence correspond to and are equal to those of the given sequence ak, but are arranged in descending (non-increasing) order.
Publisher
Canadian Mathematical Society
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献