# The rearrangement number: how many rearrangements of a series suffice to verify absolute convergence? Mathematics Colloquium at Penn, September 2016

This will be a talk for the Mathematics Colloquium at the University of Pennsylvania, Wednesday, September 14, 2016, 3:30 pm, tea at 3 pm, in the mathematics department.

Abstract. The well-known Riemann rearrangement theorem asserts that a series $\sum_n a_n$ is absolutely convergent if and only if every rearrangement $\sum_n a_{p(n)}$ of it is convergent, and furthermore, any conditionally convergent series can be rearranged so as to converge to any desired extended real value. But how many rearrangements $p$ suffice to test for absolute convergence in this way? The rearrangement number, a new cardinal characteristic of the continuum, is the smallest size of a family of permutations, such that whenever the convergence and value of a convergent series is invariant by all these permutations, then it is absolutely convergent. The exact value of the rearrangement number turns out to be independent of the axioms of set theory. In this talk, I shall place the rearrangement number into a discussion of cardinal characteristics of the continuum, including an elementary introduction to the continuum hypothesis and, time permitting, an account of Freiling’s axiom of symmetry.

This talk is based in part on current joint work with Jörg Brendle, Andreas Blass, Will Brian, myself, Michael Hardy and Paul Larson.

Related MathOverflow post: How many rearrangements must fail to alter the value of a sum before you conclude that none do?