I am wondering whether we can also find lower bounds on the number of runs in the Burrows-Wheeler transform for some strings with a slight modification of your proposed ideas. Is it possible to show that each additional application of $\phi$ gives us at least $c$ many new runs, for $c$ being a constant, probably dependent on $\phi$?