Jens Jägersküpper has provided important lower bounds for evolution strategies
in continuous domains. Teytaud and Gelly have provided some extensions using combinatorial
arguments and in particular the branching factor of comparison-based evolution strategies. 
Using geometric technics and Sauer's lemma for level sets of finite VC-dimension, 
we show new bounds for (mu,lambda)-ES 
with application to the speed-up of parallel evolution strategies and derive practical
hints for designing new mutation operators.