We use an elementary argument building on group actions to prove that the selection-free steady state genetic algorithm analyzed by Sutton and Witt (GECCO 2019) takes expected number of $\Omega(2^n / \sqrt n)$ iterations find any particular target search point. This bound is valid for all population sizes $\mu$. Our result improves over previous lower $\Omega(\exp(n^{\delta/2}))$ $\mu = O(n^{1/...

Symmetry analysis is a powerful tool that enables the user to construct exact solutions of a given differential equation in a fairly systematic way. For this reason, the Lie point symmetry groups of most well-known differential equations have been catalogued. It is widely believed that the set of symmetries of an initial-value problem (or boundary-value problem) is a subset of the set of symmet...