On the Pringsheim Rearrangement Theorems
โ Scribed by Marion Scheepers
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 140 KB
- Volume
- 267
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
We show that requiring that the set of positions of the positive terms in a conditionally convergent numerical series have asymptotic density provides converses for old rearrangement theorems of Alfred Pringsheim.
๐ SIMILAR VOLUMES
In this note we prove that a finite group is almost solvable if every irreducible ลฝ character is induced from a character of degree at most 4 more precisely, such a ลฝ . ลฝ . .
## Abstract Let us call a finite subset __X__ of a Euclidean __m__โspace E^m^ __Ramsey__ if for any positive integer __r__ there is an integer __n__ = __n__(__X;r__) such that in any partition of E^n^ into __r__ classes __C__~1~,โฆ, __C~r~__, some __C~i~__ contains a set __X__' which is the image of