Density cardinals

How many permutations are needed so that every infinite–coinfinite set of natural numbers with asymptotic density can be rearranged to no longer have the same density? We prove that the density number $\mathrm{dd}$, which answers this question, is equal to the least size of a nonmeager set of reals, $\mathrm{non}\left(M\right)$. The same argument shows that a slight modification of the rearrangement number $\mathrm{rr}$ of Blass et al. [Trans. Amer. Math. Soc. 373 (2020), no. 1, 41–69]is equal to $\mathrm{non}\left(M\right)$, and similarly for a cardinal invariant related to large-scale topology introduced by Banakh [3], thus answering a question of the latter. We then consider variants of $\mathrm{dd}$ given by restricting the possible densities of the original set and/or of the permuted set, providing lower and upper bounds for these cardinals and proving consistency of strict inequalities. We finally look at cardinals defined in terms of relative density and of asymptotic mean, and relate them to the rearrangement numbers of Blass et al. [Trans. Amer. Math. Soc. 373 (2020), no. 1, 41–69].