Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-26T22:03:26.348Z Has data issue: false hasContentIssue false
  • English
  • Français

AN APPLICATION OF NETWORK FLOWS TO REARRANGEMENT OF SERIES

Published online by Cambridge University Press:  01 April 1999

C. St J. A. NASH-WILLIAMS  and
D. J. WHITE
C. St J. A. NASH-WILLIAMS
Affiliation:
Department of Mathematics, University of Reading, Whiteknights, PO Box 220, Reading RG6 6AX; [email protected], [email protected]
D. J. WHITE
Affiliation:
Department of Mathematics, University of Reading, Whiteknights, PO Box 220, Reading RG6 6AX; [email protected], [email protected]
Get access

Abstract

For each permutation f of the set of positive integers, all triples s, t, u are determined such that t and u are the lower and upper limits of the sequence of partial sums of the ‘f-rearrangement’ [sum ]af(n) of some real series [sum ]an with sum s.

Type
Notes and Papers
Information
Journal of the London Mathematical Society , Volume 59 , Issue 2 , April 1999 , pp. 637 - 646
Copyright
The London Mathematical Society 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)