Hostname: page-component-cb9f654ff-c75p9 Total loading time: 0 Render date: 2025-08-19T07:08:16.923Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on Combinatorial Identities for Partial Sums

Published online by Cambridge University Press:  20 November 2018

S. G. Mohanty
S. G. Mohanty*
Affiliation:
Mcmaster University, Hamilton, Ontario
Rights & Permissions [Opens in a new window]

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.

For a sequence σ = (x 1, …, xn ) of real numbers, let σi and respectively denote the cyclic permutation (xi , x i+1, …, x i-1) and the reverse cyclic permutation (xj , x j-1, …, x j+1), and let . Also denote by M rj (σ) and mrj (σ) the rth largest and the rth smallest numbers respectively, among the first j partial sums s 1, s 2, …, Sj for 1≤r≤j≤n. As usual, let the superscripts + and — respectively mean maximize and minimize with zero.

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 14 , Issue 1 , January 1971 , pp. 65 - 67
Copyright
Copyright © Canadian Mathematical Society 1971

References

1. Dwass, M., A fluctuation theorem for cyclic random variables, Ann. Math. Statist. 33 (1962), 1450-1454.Google Scholar
2. Graham, R. L., A combinatorial theorem for partial sums, Ann. Math. Statist. 34 (1963), 1600-1602.Google Scholar
3. Harper, L. H., A family of combinatorial identities, Ann. Math. Statist. 37 (1966), 509-512.Google Scholar