paper

Type R -Permutation Approach to Velleman's Open Problem

arXiv:2507.20062

Abstract

Previously, mathematicians Steven Krantz and Jeffery McNeal studied a type of positive numbers permutation called -permutation. This type of permutation, when applied to the index of terms of a series, is defined to be both convergence-preserving and "fixing" at least one divergent series, that is, rearranging the terms of any convergent series will result in a convergent series, while rearranging the terms of some divergent series will result in a convergent series. In general, if a divergent series can be fixed to converge in some way (it does not need to be by -permutation), it is called a "conditionally divergent series". In 2006, another mathematician Daniel Velleman raised an open problem related to -permutation: for a conditionally divergent series , let , can ever be something between and ? This paper is devoted to partially answering this open problem by considering a subset of -permutation constraint by how we can permute, named type R -permutation. Then we answer the analogous question about a subset of S with respect to type R -permutation, named . We show that is either , a singleton or . We also provide sufficient conditions on the conditionally divergent series for to be a singleton or , by introducing a "substantial property" on the series.

Type R $λ$-Permutation Approach to Velleman's Open Problem · wovepaper